A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2781094
DOI10.1287/opre.46.3.330zbMath0987.90070OpenAlexW2141481566MaRDI QIDQ2781094
Gilbert Laporte, Mihnea Stan, Alain Hertz, Michel Gendreau
Publication date: 1 July 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.3.330
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Dynamic vehicle routing using an improved variable neighborhood search algorithm, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, Scheduled penalty variable neighborhood search, Vehicle routing problem with stochastic travel times including soft time windows and service costs, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, Traveling salesman problem with clustering, Learn global and optimize local: a data-driven methodology for last-mile routing, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, 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 unified matheuristic for solving multi-constrained traveling salesman problems with profits, Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows, The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations, A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows, A variable iterated greedy algorithm for the traveling salesman problem with time windows, Finding efficient make-to-order production and batch delivery schedules, Implementation of a linear time algorithm for certain generalized traveling salesman problems, A modified ant colony system for solving the travelling salesman problem with time windows, Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, The capacitated vehicle routing problem with stochastic demands and time windows, New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times, Dynamic transportation of patients in hospitals, Beam-ACO for the travelling salesman problem with time windows, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, A metaheuristic for the delivery man problem 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, Fast local search algorithms for the handicapped persons transportation problem, An ant colony system approach for variants of the traveling salesman problem with time windows, Branch-and-refine for solving time-expanded MILP formulations, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, A tabu search algorithm for scheduling a single robot in a job-shop environment, Improving the filtering of branch-and-bound MDD solver, Tabu search heuristics for the vehicle routing problem with time windows.
