On a \textsc{Capacitated Multivehicle Routing Problem}

DOI10.1145/1400751.1400776MaRDI QIDQ2934342zbMATH OpenOpenAlexFDO

Authors Xiaojie Gao, Leonard J. Schulman

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1400751.1400776

zbMATH Keywords

linear programmingresource allocationtransportation problem\textsc{The Vehicle Routing Problem}

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)

Recommendations

• Algorithms and Data Structures
• Energy Minimizing Vehicle Routing Problem
• Routing vehicles to minimize fuel consumption
• Approximation algorithms for some vehicle routing problems
• Locating depots for capacitated vehicle routing

Cited in

(4)

• Gossip algorithms for heterogeneous multi-vehicle routing problems
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• Capacitated vehicle routing problem on line with unsplittable demands
• Energy Minimizing Vehicle Routing Problem

This page was built for publication: On a \textsc{Capacitated Multivehicle Routing Problem}

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