A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
From MaRDI portal
Publication:6153469
Recommendations
- An efficient general variable neighborhood search for large travelling salesman 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
- An efficient GVNS for solving traveling salesman problem with time windows
- New state-space relaxations for solving the traveling salesman problem with time windows
Cites work
- scientific article; zbMATH DE number 1082108 (Why is no real title available?)
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A general VNS heuristic for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A hybrid exact algorithm for the TSPTW
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A time bucket formulation for the traveling salesman problem with time windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An ant colony system approach for variants of the traveling salesman problem with time windows
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Beam-ACO for the travelling salesman problem with time windows
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- Job shop scheduling with setup times, deadlines and precedence constraints
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- New classes of efficiently solvable generalized traveling salesman problems
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- New state-space relaxations for solving the traveling salesman problem with time windows
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- State-space relaxation procedures for the computation of bounds to routing problems
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- The Price of Robustness
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The robust vehicle routing problem with time windows
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
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)
