Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions

DOI10.1287/OPRE.25.3.517MaRDI QIDQ4156166zbMATH OpenOpenAlexFDO

Authors Robert A. Russell

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Operations research and management science (90B99) Programming involving graphs or networks (90C35)

Cited in

(23)

• 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
• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• A Heuristic Algorithm for Multi-Period Delivery Planning Problems
• The period vehicle routing problem and its extensions
• Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
• Graphical-structure-based models for routing problems
• 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
• Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
• General VNS for asymmetric vehicle routing problem with time and capacity constraints
• An efficient implementation of local search algorithms for constrained routing problems

This page was built for publication: Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156166)