Research on Logistics Distribution Model of E-commerce Based on Improved Ant Colony Algorithm

Wang, Yue; Zhu, Qingchao; Song, Xiaoou; Huang, Hongmei; Yang, Qi

doi:10.1007/978-3-030-50399-4_41

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same cannot be said of heuristics that are mostly problem-dependent. Similarly, many researchers assert that the ATSP is more difficult to solve than its symmetric counterpart because it requires a reformulation as a symmetric TSP problem with some constraints [ 48 , 49 ].…”

Section: Travelling Salesman Problemmentioning

confidence: 99%

A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem

Odili¹,

Ahmad

Zarina

2021

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). Quite unlike the symmetric Travelling Salesman Problem, there is a paucity of research studies on the asymmetric counterpart. This is quite disturbing because most real-life applications are actually asymmetric in nature. These six algorithms were chosen for their performance comparison because they have posted some of the best results in literature and they employ different search schemes in attempting solutions to the ATSP. The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. After a number of experiments on the popular but difficult 15 out of the 19 ATSP instances in TSPLIB, the results show that the African Buffalo Optimization algorithm slightly outperformed the other algorithms in obtaining the optimal results and at a much faster speed.

show abstract

Section: Travelling Salesman Problemmentioning

confidence: 99%