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

DOI10.1016/J.DAM.2023.12.006OpenAlexW4389802950MaRDI QIDQ6153469FDOQ6153469

Authors:

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 searchrobust optimizationtime windowstraveling salesman problem

Mathematics Subject Classification ID

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

Cites Work

• The Price of Robustness
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Variable neighborhood search
• Variable neighborhood search: Principles and applications
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Title not available (Why is that?)
• Job shop scheduling with setup times, deadlines and precedence constraints
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• The robust vehicle routing problem with time windows
• State-space relaxation procedures for the computation of bounds to routing problems
• 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
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• Beam-ACO for the travelling salesman problem with time windows
• A generalized insertion heuristic for the travelling 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
• 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
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• A general VNS heuristic for the traveling salesman problem with time windows
• New classes of efficiently solvable generalized traveling salesman problems
• A hybrid exact algorithm for the TSPTW
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• A variable iterated greedy algorithm for the traveling salesman problem with time windows
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• An ant colony system approach for variants of the traveling salesman problem with time windows
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
• 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 general variable neighborhood search for the traveling salesman problem with time windows under various objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153469)