New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
From MaRDI portal
Publication:4032587
DOI10.1287/opre.40.6.1086zbMath0767.90087OpenAlexW2125613881MaRDI QIDQ4032587
Michel Gendreau, Alain Hertz, Gilbert Laporte
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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Synchronized truck and drone routing under disastrous conditions (case study: urban thoroughfares disinfection), A no-delay single machine scheduling problem to minimize total weighted early and late work, A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers, Metaheuristics: A Canadian Perspective, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck 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 generalized insertion algorithm for the seriation problem, A parallel tabu search algorithm for large traveling salesman problems, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, An improved heuristic for the period traveling salesman problem, Problems of discrete optimization: challenges and main approaches to solve them, A multi-start local search algorithm for the vehicle routing problem with time windows, 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, Thirty years of heterogeneous vehicle routing, 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, Large neighborhood search for multi-trip vehicle routing, A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods, The multi-depot vehicle routing problem with inter-depot routes, A generalized model and a heuristic algorithm for the large-scale covering tour problem, A partition approach to the inventory/routing problem, A survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning level, Two level general variable neighborhood search for attractive traveling salesman problem, Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, Improved heuristic algorithms for the job sequencing and tool switching problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), An iterated tabu search for the multi-compartment vehicle routing problem, Vehicle routing problem with stochastic travel times including soft time windows and service costs, TSP ejection chains, A time-dependent vessel routing problem with speed optimization, Routing problems: A bibliography, Block coordinate descent for smooth nonconvex constrained minimization, The bi-objective covering tour problem, Variable neighborhood search, 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, A column generation-based heuristic algorithm for an inventory routing problem with perishable goods, Self-organizing feature maps for the vehicle routing problem with backhauls, The open vehicle routing problem with decoupling points, A set-covering based heuristic algorithm for the periodic vehicle routing problem, Using global search heuristics for the capacity vehicle routing problem., A general VNS heuristic for the traveling salesman problem with time windows, Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems, Competition and Cooperation in Pickup and Multiple Delivery Problems, Knowledge-guided local search for the vehicle routing problem, A threshold accepting approach to the Open Vehicle Routing problem, Multi-objective meta-heuristics for the traveling salesman problem with profits, Model and algorithm for inventory/routing decision in a three-echelon logistics system, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, A discrete gravitational search algorithm for solving combinatorial optimization problems, A variable iterated greedy algorithm for the traveling salesman problem with time windows, A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST, The Split Delivery Vehicle Routing Problem: A Survey, Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics, The traveling salesman problem: An overview of exact and approximate algorithms, The traveling purchaser problem and its variants, The vehicle routing problem: An overview of exact and approximate algorithms, An integer programming-based local search for the covering salesman problem, A solution approach to the inventory routing problem in a three-level distribution system, A tabu search algorithm for the open vehicle routing problem, Expanding neighborhood GRASP for the traveling salesman problem, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing 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 cooperative parallel meta-heuristic for the vehicle routing problem with time windows, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, A simple and effective hybrid genetic search for the job sequencing and tool switching problem, Industrial aspects and literature survey: fleet composition and routing, Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem, The pickup and delivery traveling salesman problem with first-in-first-out loading, A memetic algorithm for the multi trip vehicle routing problem, An inventory-routing problem with the objective of travel time minimization, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Routing heuristics for automated pick and place machines, The traveling purchaser problem with budget constraint, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, The Generalized Covering Salesman Problem, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, Planning models for freight transportation, Unnamed Item, A parallel variable neighborhood search for solving covering salesman problem, A heuristic for the pickup and delivery traveling salesman problem, GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery, Performance evaluation of distribution strategies for the inventory routing problem, The attractive traveling salesman problem, Heuristics for the stochastic Eulerian tour problem, Effective Algorithms for a Bounded Version of the Uncapacitated TPP, A review of TSP based approaches for flowshop scheduling, Fast local search algorithms for the handicapped persons transportation problem, A sweep-based algorithm for the fleet size and mix vehicle routing problem, IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, The period traveling salesman problem: A new heuristic algorithm, A tabu search heuristic for the undirected selective travelling salesman problem, Heuristics for the black and white traveling salesman problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Tabu search heuristics for the vehicle routing problem with time windows.
