An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

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

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (18)

A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ A parallel route building algorithm for the vehicle routing and scheduling problem with time windows ⋮ Large neighborhood search for multi-trip vehicle routing ⋮ The multi-depot vehicle routing problem with inter-depot routes ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm ⋮ A heuristic and lower bound for a multi-depot routing problem ⋮ A tabu search heuristic for the multi-depot vehicle routing problem ⋮ A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions ⋮ The shared customer collaboration vehicle routing problem ⋮ The Multi-Depot Routing Allocation Problem ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem ⋮ Heuristische Lösungsverfahren für Lieferplanprobleme ⋮ A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem ⋮ A multi-level composite heuristic for the multi-depot vehicle fleet mix problem ⋮ Search strategies for the feeder bus network design problem

This page was built for publication: An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem