Heuristics for vehicle routing on tree-like networks
DOI10.1057/PALGRAVE.JORS.2600747zbMATH Open1054.90519OpenAlexW2013672052MaRDI QIDQ3157366FDOQ3157366
Author name not available (Why is that?)
Publication date: 13 January 2005
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600747
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cited In (4)
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- The preemptive swapping problem on a tree
Recommendations
- A general heuristic for vehicle routing problems 👍 👎
- Capacitated Vehicle Routing on Trees 👍 👎
- A practical heuristic for a large scale vehicle routing problem 👍 👎
- Heuristics for large constrained vehicle routing problems 👍 👎
- Two exact algorithms for the vehicle routing problem on trees 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Heuristics for vehicle routing on tree-like networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157366)
