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.90094MaRDI 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
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90B99: Operations research and management science
Related Items
A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, A generalized exchange heuristic for the capacitated vehicle routing problem, A Lagrangean relaxation heuristic for vehicle routing, An efficient implementation of local search algorithms for constrained routing problems, The school bus routing problem: a review, Stochastic vehicle routing: A comprehensive approach, The savings algorithm for the vehicle routing problem, A modular algorithm for an extended vehicle scheduling problem, Combination of local search and CLP in the vehicle-fleet scheduling problem, A TSSP+1 decomposition strategy for the vehicle routing problem, A period vehicle routing case study, Heuristic methods and applications: A categorized survey, Routing problems: A bibliography, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, A Heuristic Algorithm for Multi-Period Delivery Planning Problems, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Graphical-structure-based models for routing problems
