A heuristic and lower bound for a multi-depot routing problem

DOI10.1016/0305-0548(94)00083-KzbMath0838.90032MaRDI QIDQ1905085

Ina S. Markham, Robert T. Sumichrast

Publication date: 25 February 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicmulti-depot routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (6)

A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem ⋮ Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network ⋮ A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem ⋮ Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems

Cites Work

• Implementing vehicle routing algorithms
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

This page was built for publication: A heuristic and lower bound for a multi-depot routing problem