Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
From MaRDI portal
Publication:4156166
DOI10.1287/opre.25.3.517zbMath0377.90094OpenAlexW2140318223MaRDI QIDQ4156166
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.3.517
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Operations research and management science (90B99)
Related Items
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, A TSSP+1 decomposition strategy for the vehicle routing problem, The savings algorithm for the vehicle routing problem, Routing problems: A bibliography, A Lagrangean relaxation heuristic for vehicle routing, Simulated annealing metaheuristics for the vehicle routing problem with time windows, A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, A Heuristic Algorithm for Multi-Period Delivery Planning Problems, Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, A modular algorithm for an extended vehicle scheduling problem, An efficient implementation of local search algorithms for constrained routing problems, Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem, Graphical-structure-based models for routing problems, The Period Vehicle Routing Problem and its Extensions, A generalized exchange heuristic for the capacitated vehicle routing problem, Combination of local search and CLP in the vehicle-fleet scheduling problem, Heuristic methods and applications: A categorized survey, The school bus routing problem: a review, Stochastic vehicle routing: A comprehensive approach, A period vehicle routing case study