Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics

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.

• Record URL:
  • https://doi.org/10.1016/j.tre.2019.04.004
• Record URL:
  • http://www.sciencedirect.com/science/article/pii/S1366554518312808
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
• Supplemental Notes:
  • © 2019 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
• Authors:
  • Muren
  • Wu, Jianjun
  • Zhou, Li
  • Du, Zhiping
  • Lv, Ying
• Publication Date: 2019-6

Language

• English

Media Info

• Media Type: Web
• Features: Figures; References; Tables;
• Pagination: pp 87-102
• Serial:
  • Transportation Research Part E: Logistics and Transportation Review
  • Volume: 126
  • Issue Number: 0
  • Publisher: Elsevier
  • ISSN: 1366-5545
  • Serial URL: http://www.sciencedirect.com/science/journal/13665545

Subject/Index Terms

• TRT Terms: Air transportation; Algorithms; Hazards and emergency operations; Logistics; Traveling salesman problem
• Subject Areas: Aviation; Planning and Forecasting; Security and Emergencies;

Filing Info

• Accession Number: 01709566
• Record Type: Publication
• Files: TRIS
• Created Date: Jun 28 2019 11:40AM