The Multi-Depot Routing Allocation Problem

DOI10.1080/01966324.1987.10737206zbMath0622.90026OpenAlexW2012516518WikidataQ58117364 ScholiaQ58117364MaRDI QIDQ3760267

Jossef Perl

Publication date: 1987

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1987.10737206

zbMATH Keywords

vehicle routingheuristictwo-phase methodmulti-depot routing allocationmultiple capacitated depots

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Mathematical programming (90C99)

Related Items (4)

The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ Cooperative game‐theoretic features of cost sharing in location‐routing ⋮ A multi-level composite heuristic for the multi-depot vehicle fleet mix problem ⋮ Search strategies for the feeder bus network design problem

Cites Work

• Unnamed Item
• Implementing vehicle routing algorithms
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Computer Solutions of the Traveling Salesman Problem
• An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

This page was built for publication: The Multi-Depot Routing Allocation Problem