Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics. (June 2019)

• Record Type: Journal Article
• Authors: Muren, ; Wu, Jianjun; Zhou, Li; Du, Zhiping; Lv, Ying
• Is Part Of: Transportation research. Volume 126(2019)
• Page Start: 87
• Page End: 102
• Publication Date: 2019-06
• Subjects: Emergency air logistics -- Traveling salesman problem -- 2-Opt -- Or-opt -- 2-Exchange -- Mixed steepest descent method; Logistics -- Periodicals; Transportation -- Periodicals; 388.011
• DOI: 10.1016/j.tre.2019.04.004
• Languages: English
• ISSNs: 1366-5545

Abstract

Graphical abstract: Fig. 1. Graphic abstract of paper. Highlights: We propose a new faster and effective solution algorithm based on simple heuristic algorithms called the mixed steepest descent method and compared with other traditional algorithms. The large scale case study and numerical results show that our method has strong applicability. We apply this algorithm in emergency air logistics. Abstract: In this paper, a new mixed steepest descent algorithm which has short computation time and stable solution is provided. Comparisons and case studies based on different traffic network and distance are made with other intelligent and exact algorithms. The large-scale experiment shows that the possibility of securing the optimal solution is greater than 99.5% and the average computation time is lower than 0.06 s when the node scales are less than 50. The proposed algorithm can not only be applied in emergency logistics problems but is also useful for solving other real-world problems.