A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
暂无分享,去创建一个
Sanjeeb Dash | Oktay Günlük | Andrea Tramontani | Andrea Lodi | Andrea Tramontani | O. Günlük | S. Dash | Andrea Lodi
[1] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[2] André Langevin,et al. A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows , 1990, Networks.
[3] Leif H. Appelgren,et al. A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .
[4] Michel Gendreau,et al. An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..
[5] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.
[6] Andrea Lodi,et al. A Hybrid Exact Algorithm for the TSPTW , 2002, INFORMS J. Comput..
[7] Lucio Bianco,et al. Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..
[8] Amos Levin. Scheduling and Fleet Routing Models for Transportation Systems , 1971 .
[9] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[10] Jacques Desrosiers,et al. Chapter 2 Time constrained routing and scheduling , 1995 .
[11] 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 .
[12] Jean-François Cordeau,et al. VRP with Time Windows , 1999, The Vehicle Routing Problem.
[13] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[14] Norbert Ascheuer,et al. Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .
[15] Egon Balas,et al. Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study , 2000, INFORMS J. Comput..
[16] Matteo Fischetti,et al. A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.
[17] M. Grötschel,et al. A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .
[18] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[19] Amelia C. Regan,et al. Local truckload pickup and delivery with hard time window constraints , 2002 .
[20] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[21] Jacques Desrosiers,et al. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..
[22] Egon Balas,et al. The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..
[23] Edward K. Baker,et al. Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..
[24] Andrea Tramontani,et al. Enhanced mixed integer programming techniques and routing problems , 2011, 4OR.
[25] Eric Taillard,et al. A NEW NEIGHBORHOOD STRUCTURE FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. , 1995 .
[26] Amelia Regan,et al. On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints , 2009, Comput. Ind. Eng..
[27] José María Sanchis,et al. An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation , 2008, Eur. J. Oper. Res..