Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version

DOI10.1016/j.cor.2022.106078OpenAlexW4308902827MaRDI QIDQ2108179

Cédric Pralet

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106078

zbMATH Keywords

makespan minimizationlarge neighborhood searchtraveling salesman problem with time windowssolution feasibilitytime-dependent transitions

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Scheduling complex observation requests for a constellation of satellites: large neighborhood search approaches, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives

Uses Software

• TSPTW

Cites Work

• Unnamed Item
• A general VNS heuristic for the traveling salesman problem with time windows
• An integer programming approach for the time-dependent traveling salesman problem with time windows
• An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• Beam-ACO for the travelling salesman problem with time windows
• Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
• An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• A New Heuristic for the Traveling Salesman Problem with Time Windows
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• A Hybrid Exact Algorithm for the TSPTW
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• An ant colony system approach for variants of the traveling salesman problem with time windows
• State-space relaxation procedures for the computation of bounds to routing problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut