A New Heuristic for the Traveling Salesman Problem with Time Windows

References

• Baker E. K. An Exact Algorithm for the Time-Constrained Traveling Salesman Problem. Opns. Res. (1983) 31:939–945Link, Google Scholar
• Bianco L., Mingozzi A., Ricciardelli S. Dynamic Programming Strategies for the Traveling Salesman Problem with Time Windows and Precedence Constraints. Opns. Res. (1998) 45:365–378Google Scholar
• Cordone R., Wolfler Calvo R. Note on Time Windows Constraints in Routing Problems. (1996) . Internal report 96-005, Politecnico di MilanoGoogle Scholar
• Cordone R., Wolfler Calvo R. A Heuristic for the Vehicle Routing Problem with Time Windows. (1997) . Internal report 97-012 Politecnico di MilanoGoogle Scholar
• Dell'Amico M., Martello S., Dell'Amico M., Maffioli F., Martello S. Linear Assignment. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons, Chichester, U.K) 355–371Google Scholar
• Derosiers J., Dumas Y., Solomon M. M., Soumis F. Time Constrained Routing and Scheduling. Handbook in Operations Research and Management Science (1994) (North-Holland, Amsterdam)35–139Google Scholar
• Dongarra J. J. Performance of Various Computers Using Linear Equations Software. (1997) . Report CS-89-85, Computer Science Department,University of Tennessee, Knoxville, TNGoogle Scholar
• Dumas Y., Desrosiers J., Gélinas E., Solomon M. M. An Optimal Algorithm for the Traveling Salesman Problem with Time Windows. Opns. Res. (1995) 45:367–371Link, Google Scholar
• Gendreau M., Hertz A., Laporte G., Stan M. A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Opns. Res. (1998) 46:330–335Link, Google Scholar
• General Processor Information http://infopad.eecs.berkley.edu/CIC/ (last modified 13 january 1997)Google Scholar
• A file of reported SPEC CINT/CFP benchmark results for various machinesavailable via anonymous ftp from ftp.cdf.toronto.edu in /pub/spectable/Google Scholar
• Healy P., Moll R. A New Extension of Local Search Applied to the Dial-a-Ride Problem. Eur. J. Oper. Res. (1995) 83:83–104Crossref, Google Scholar
• Kindervater G. A. P., Savelsbergh M. W. P., Lenstra J. K., Aarts E. H. L. Vehicle Routing: Handling Edge Exchanges. Local Search in Combinatorial Optimization (1997) (Wiley, Chichester) 337–360Google Scholar
• Langevin A., Desrochers M., Desrosiers J., Soumis F. A Two Commodity Flow Formulation for the Traveling Salesman and Makespan Problems with Time Windows. Network (1993) 23:631–640Crossref, Google Scholar
• Lin S. Computer Solutions to the Travelling Salesman Problem. Bell Syst. Tech. J. (1965) 44:2245–2269Crossref, Google Scholar
• Miller C., Tucker A., Zemlin R. Integer Programming Formulations of Traveling Salesman Problems. JACM (1960) 7:326–329Crossref, Google Scholar
• Bianco L., Mingozzi A., Ricciardelli S. Dynamic Programming Strategies for the Traveling Salesman Problem with Time Windows and Precedence Constraints. Opns. Res. (1998) 45:365–378Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J.-M. An Exact Constraint Logic Programming Algorithm for the TSP with Time Windows. (1996) . Publication CRT-96-15, Centre de recherche sur les transports, Universite de Montreal, MontrealGoogle Scholar
• Potvin J. Y., Bengio S. The Vehicle Routing Problem with Time Windows. II. Genetic Search. INFORMS J. of Comput. (1996) 8:165–172Link, Google Scholar
• Russell R. A. An Effective Heuristic for the m-Tour Travelling Salesman Problem with Some Side Conditions. Opns. Res. (1977) 25:517–524Link, Google Scholar
• Savelsbergh M. W. P. Local Search in Routing Problems with Time Windows. Ann. Opns. Res. (1985) 4:285–305Crossref, Google Scholar
• Solomon M. M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Opns. Res. (1987) 35:254–265Link, Google Scholar