The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization
Abstract
The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.
Related Content
|
Yu Bin, Xiao Zeyu, Dai Yinglong.
© 2024.
34 pages.
|
|
Liyin Wang, Yuting Cheng, Xueqing Fan, Anna Wang, Hansen Zhao.
© 2024.
21 pages.
|
|
Tao Zhang, Zaifa Xue, Zesheng Huo.
© 2024.
32 pages.
|
|
Dharmesh Dhabliya, Vivek Veeraiah, Sukhvinder Singh Dari, Jambi Ratna Raja Kumar, Ritika Dhabliya, Sabyasachi Pramanik, Ankur Gupta.
© 2024.
22 pages.
|
|
Yi Xu.
© 2024.
37 pages.
|
|
Chunmao Jiang.
© 2024.
22 pages.
|
|
Hatice Kübra Özensel, Burak Efe.
© 2024.
23 pages.
|
|
|