A New Heuristic for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2783879
DOI10.1287/trsc.34.1.113.12284zbMath1041.90524OpenAlexW2065665769MaRDI QIDQ2783879
Publication date: 17 October 2002
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.34.1.113.12284
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (12)
An effective and fast heuristic for the dial-a-ride problem ⋮ Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework ⋮ A general VNS heuristic for the traveling salesman problem with time windows ⋮ The delivery man problem with time windows ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Beam-ACO for the travelling salesman problem with time windows ⋮ An assignment-based heuristic for vehicle routing with time windows ⋮ New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows ⋮ An efficient GVNS for solving Traveling Salesman Problem with Time Windows ⋮ A stochastic dynamic traveling salesman problem with hard time windows ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
This page was built for publication: A New Heuristic for the Traveling Salesman Problem with Time Windows
