New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
From MaRDI portal
Publication:4032587
DOI10.1287/opre.40.6.1086zbMath0767.90087MaRDI QIDQ4032587
Michel Gendreau, Gilbert Laporte, Alain Hertz
Publication date: 1 April 1993
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.6.1086
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Unnamed Item, A threshold accepting approach to the Open Vehicle Routing problem, Variable neighborhood search: Principles and applications, Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, A tabu search algorithm for the open vehicle routing problem, Adaptive memory programming for the vehicle routing problem with multiple trips, A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, The multi-depot vehicle routing problem with inter-depot routes, A partition approach to the inventory/routing problem, The bi-objective covering tour problem, Self-organizing feature maps for the vehicle routing problem with backhauls, Multi-objective meta-heuristics for the traveling salesman problem with profits, Model and algorithm for inventory/routing decision in a three-echelon logistics system, The pickup and delivery traveling salesman problem with first-in-first-out loading, The traveling salesman problem: An overview of exact and approximate algorithms, The vehicle routing problem: An overview of exact and approximate algorithms, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, Planning models for freight transportation, A generalized insertion algorithm for the seriation problem, A parallel tabu search algorithm for large traveling salesman problems, TSP ejection chains, Variable neighborhood search, Using global search heuristics for the capacity vehicle routing problem., A heuristic for the pickup and delivery traveling salesman problem, The period traveling salesman problem: A new heuristic algorithm, A tabu search heuristic for the undirected selective travelling salesman problem, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Routing heuristics for automated pick and place machines, A sweep-based algorithm for the fleet size and mix vehicle routing problem, Heuristics for the black and white traveling salesman problem, Tabu search heuristics for the vehicle routing problem with time windows., A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, An improved heuristic for the period traveling salesman problem, A multi-start local search algorithm for the vehicle routing problem with time windows, Routing problems: A bibliography, The traveling salesman problem with backhauls, The simulated trading heuristic for solving vehicle routing problems, Divide and conquer strategies for parallel TSP heuristics, Genetic algorithms for the traveling salesman problem, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, Problems of discrete optimization: challenges and main approaches to solve them, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, A variable neighborhood search heuristic for periodic routing problems, A variable neighbourhood search algorithm for the open vehicle routing problem, Expanding neighborhood GRASP for the traveling salesman problem, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, A new tabu search algorithm for the vehicle routing problem with backhauls, A review of TSP based approaches for flowshop scheduling, Fast local search algorithms for the handicapped persons transportation problem, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
