A Compressed Annealing Approach with Pre-Process for the Asymmetric Traveling Salesman Problem with Time Windows

The asymmetric traveling salesman problem with time windows (ATSP-TW) is a problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a specific time window. The problem of reverse link cost is called asymmetric. We propose a modified compressed annealing approach which has a pre and post processes to get a suboptimal solution within practical computation time for the large size problem. 1. 序論 巡回セールスマン問題 (Traveling Salesman Problem,TSP) とは,ある都市を出発して,全ての都市を ちょうど一度ずつ訪問するとき,その移動距離が最小 となる都市の巡回順序を求める問題である.これは組 合せ最適化問題の典型的な問題である [1]. 巡回セールスマン問題をグラフG = (V,A)を用いて 表すと,枝上のコスト cij が与えられたとき,点集合 V の全ての要素をちょうど一度ずつ経由する巡回路 (ハミ ルトン閉路)のうち,コストの合計を最小にするものを 求める問題となる.Aは点同士を結ぶ枝の集合である. 数式で表現すると,ρを V = {1, 2, . . . , n}から V 上へ の 1対 1の写像として

[1]  Andrea Lodi,et al.  A Hybrid Exact Algorithm for the TSPTW , 2002, INFORMS J. Comput..

[2]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[3]  Roberto Wolfler Calvo,et al.  A New Heuristic for the Traveling Salesman Problem with Time Windows , 2000, Transp. Sci..

[4]  Barrett W. Thomas,et al.  A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..

[5]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[6]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[7]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[8]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  André Langevin,et al.  A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows , 1990, Networks.

[11]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[12]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[13]  Egon Balas,et al.  Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study , 2000, INFORMS J. Comput..

[14]  Michel Gendreau,et al.  An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..

[15]  Haralambos Sarimveis,et al.  A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem , 2007, Eur. J. Oper. Res..

[16]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[17]  A Compressed Annealing Approach to the Traveling Salesman Problem with Time Windows , 2003 .

[18]  Manuel López-Ibáñez,et al.  Beam-ACO for the travelling salesman problem with time windows , 2010, Comput. Oper. Res..

[19]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[20]  William B. Carlton,et al.  Solving the traveling-salesman problem with time windows using tabu search , 1996 .