Modeling and Solving the Capacitated Vehicle Routing Problem on Trees

DOI10.1007/978-0-387-77778-8_11zbMath1187.90043OpenAlexW2114447390MaRDI QIDQ3564359

No author found.

Publication date: 2 June 2010

Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_11

zbMATH Keywords

integer linear programming formulationscapacitated vehicle routing on treeshigh-level modeling languages

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Balancing profits and costs on trees ⋮ An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach ⋮ Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• TSPLIB
• AMPL
• SYMPHONY
• Concorde
• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• Branch-and-bound algorithms for the multi-product assembly line balancing problem
• Modeling languages in mathematical optimization.
• The Vehicle Routing Problem
• Heuristics for vehicle routing on tree-like networks
• Capacitated Vehicle Routing on Trees
• Two exact algorithms for the vehicle routing problem on trees

This page was built for publication: Modeling and Solving the Capacitated Vehicle Routing Problem on Trees