Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles

DOI10.1007/s10479-006-0006-yzbMath1146.90338OpenAlexW2009241972MaRDI QIDQ867538

John Sniezek, Lawrence Bodin

Publication date: 15 February 2007

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0006-y

zbMATH Keywords

mixed integer programsheuristic methods

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Step cost functions in a fleet size and mix vehicle routing problem with time windows ⋮ Arc routing with trip-balancing and attractiveness measures -- a waste collection case study ⋮ A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms ⋮ A Decade of Capacitated Arc Routing

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Vehicle Routing Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles