A general variable neighborhood search for the traveling salesman problem with time windows under various objectives

DOI10.1016/j.dam.2023.12.006OpenAlexW4389802950MaRDI QIDQ6153469

No author found.

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.006

zbMATH Keywords

uncertaintylocal searchtraveling salesman problemrobust optimizationtime windows

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites Work

• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• The robust vehicle routing problem with time windows
• A general VNS heuristic for the traveling salesman problem with time windows
• A variable iterated greedy algorithm for the traveling salesman problem with time windows
• Job shop scheduling with setup times, deadlines and precedence constraints
• New classes of efficiently solvable generalized traveling salesman problems
• Variable neighborhood search
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
• Beam-ACO for the travelling salesman problem with time windows
• 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 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 Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• 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
• The Price of Robustness
• State-space relaxation procedures for the computation of bounds to routing problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• 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
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
• Variable neighborhood search: Principles and applications
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: A general variable neighborhood search for the traveling salesman problem with time windows under various objectives