An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

From MaRDI portal
Publication:5650513

DOI10.1287/mnsc.18.11.664zbMath0238.90047OpenAlexW2059480483MaRDI QIDQ5650513

Thomas M. Cain, Frank A. Tillman

Publication date: 1972

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.18.11.664




Related Items

A unified heuristic for a large class of vehicle routing problems with backhaulsA parallel route building algorithm for the vehicle routing and scheduling problem with time windowsLarge neighborhood search for multi-trip vehicle routingThe multi-depot vehicle routing problem with inter-depot routesThe multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementationFleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithmA heuristic and lower bound for a multi-depot routing problemA tabu search heuristic for the multi-depot vehicle routing problemA New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known SolutionsThe shared customer collaboration vehicle routing problemThe Multi-Depot Routing Allocation ProblemSolving the multidepot vehicle routing problem with limited depot capacity and stochastic demandsHybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problemHeuristische Lösungsverfahren für LieferplanproblemeA SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COSTCombining biased randomization with iterated local search for solving the multidepot vehicle routing problemA multi-level composite heuristic for the multi-depot vehicle fleet mix problemSearch strategies for the feeder bus network design problem