New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

From MaRDI portal
Revision as of 02:45, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (only showing first 100 items - show all)

A generalized insertion algorithm for the seriation problemA parallel tabu search algorithm for large traveling salesman problemsA tabu search heuristic for the vehicle routing problem with time windows and split deliveriesMinimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approachAn improved heuristic for the period traveling salesman problemProblems of discrete optimization: challenges and main approaches to solve themA multi-start local search algorithm for the vehicle routing problem with time windowsA deterministic tabu search algorithm for the fleet size and mix vehicle routing problemA guided tabu search for the vehicle routing problem with two-dimensional loading constraintsA variable neighborhood search heuristic for periodic routing problemsA variable neighbourhood search algorithm for the open vehicle routing problemThirty years of heterogeneous vehicle routingAdaptive memory programming for the vehicle routing problem with multiple tripsA survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposalLarge neighborhood search for multi-trip vehicle routingA hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goodsThe multi-depot vehicle routing problem with inter-depot routesA generalized model and a heuristic algorithm for the large-scale covering tour problemA partition approach to the inventory/routing problemA survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning levelTwo level general variable neighborhood search for attractive traveling salesman problemFleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithmAn effective tabu search approach with improved loading algorithms for the 3L-CVRPImproved heuristic algorithms for the job sequencing and tool switching problemStatic pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)An iterated tabu search for the multi-compartment vehicle routing problemVehicle routing problem with stochastic travel times including soft time windows and service costsTSP ejection chainsA time-dependent vessel routing problem with speed optimizationRouting problems: A bibliographyBlock coordinate descent for smooth nonconvex constrained minimizationThe bi-objective covering tour problemVariable neighborhood searchThe traveling salesman problem with backhaulsThe simulated trading heuristic for solving vehicle routing problemsDivide and conquer strategies for parallel TSP heuristicsGenetic algorithms for the traveling salesman problemA column generation-based heuristic algorithm for an inventory routing problem with perishable goodsSelf-organizing feature maps for the vehicle routing problem with backhaulsThe open vehicle routing problem with decoupling pointsA set-covering based heuristic algorithm for the periodic vehicle routing problemUsing global search heuristics for the capacity vehicle routing problem.A general VNS heuristic for the traveling salesman problem with time windowsFormulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing ProblemsCompetition and Cooperation in Pickup and Multiple Delivery ProblemsKnowledge-guided local search for the vehicle routing problemA threshold accepting approach to the Open Vehicle Routing problemMulti-objective meta-heuristics for the traveling salesman problem with profitsModel and algorithm for inventory/routing decision in a three-echelon logistics systemMemetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problemA randomized granular tabu search heuristic for the split delivery vehicle routing problemA discrete gravitational search algorithm for solving combinatorial optimization problemsA variable iterated greedy algorithm for the traveling salesman problem with time windowsA SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COSTThe Split Delivery Vehicle Routing Problem: A SurveyMultiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization LogisticsThe traveling salesman problem: An overview of exact and approximate algorithmsThe traveling purchaser problem and its variantsThe vehicle routing problem: An overview of exact and approximate algorithmsAn integer programming-based local search for the covering salesman problemA solution approach to the inventory routing problem in a three-level distribution systemA tabu search algorithm for the open vehicle routing problemExpanding neighborhood GRASP for the traveling salesman problemA tabu search algorithm for the heterogeneous fixed fleet vehicle routing problemA tabu search algorithm for the Min-Max \(k\)-Chinese postman problemA new tabu search algorithm for the vehicle routing problem with backhaulsA cooperative parallel meta-heuristic for the vehicle routing problem with time windowsA branch-and-cut algorithm for the undirected prize collecting traveling salesman problemA simple and effective hybrid genetic search for the job sequencing and tool switching problemIndustrial aspects and literature survey: fleet composition and routingIterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour ProblemThe pickup and delivery traveling salesman problem with first-in-first-out loadingA memetic algorithm for the multi trip vehicle routing problemAn inventory-routing problem with the objective of travel time minimizationLasso solution strategies for the vehicle routing problem with pickups and deliveriesRouting heuristics for automated pick and place machinesThe traveling purchaser problem with budget constraintA variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problemThe Generalized Covering Salesman ProblemA tabu search heuristic for the vehicle routing problem with private fleet and common carrierA tabu search algorithm for the multi-trip vehicle routing and scheduling problemPlanning models for freight transportationUnnamed ItemA parallel variable neighborhood search for solving covering salesman problemA heuristic for the pickup and delivery traveling salesman problemGENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and deliveryPerformance evaluation of distribution strategies for the inventory routing problemThe attractive traveling salesman problemHeuristics for the stochastic Eulerian tour problemEffective Algorithms for a Bounded Version of the Uncapacitated TPPA review of TSP based approaches for flowshop schedulingFast local search algorithms for the handicapped persons transportation problemA sweep-based algorithm for the fleet size and mix vehicle routing problemIntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problemA hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problemThe period traveling salesman problem: A new heuristic algorithmA tabu search heuristic for the undirected selective travelling salesman problemHeuristics for the black and white traveling salesman problemHeuristics for multi-attribute vehicle routing problems: a survey and synthesisTabu search heuristics for the vehicle routing problem with time windows.




This page was built for publication: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem