Contactless Distribution Path Optimization Based on Improved Ant Colony Algorithm

Feng Wu

Mathematical Problems in Engineering, 2021, vol. 2021, 1-11

Abstract:

In the context of the normalization of the epidemic, contactless delivery is becoming one of the most concerned research areas. In the severe epidemic environment, due to the frequent encounter of bayonet temperature measurement, road closure, and other factors, the real-time change frequency of each traffic information is high. In order to improve the efficiency of contactless distribution and enhance user satisfaction, this paper proposes a contactless distribution path optimization algorithm based on improved ant colony algorithm. First of all, the possible traffic factors in the epidemic environment were analyzed, and the cost of each link in the distribution process was modeled. Then, the customer satisfaction is analyzed according to the customer service time window and transformed into a cost model. Finally, the total delivery cost and user satisfaction cost were taken as the optimization objectives, and a new pheromone updating method was adopted and the traditional ant colony algorithm was improved. In the experiment, the effectiveness of the proposed model and algorithm is verified through the simulation optimization and comparative analysis of an example.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/5517778.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/5517778.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5517778

DOI: 10.1155/2021/5517778

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().