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-YMaRDI QIDQ867538zbMATH OpenOpenAlexFDO

Authors 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

heuristic methodsmixed integer programs

Mathematics Subject Classification ID

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

Review text

We present the Composite Approach for solving the Capacitated Arc Routing Problem with Vehicle/Site Dependencies (CARP-VSD). We also present two mixed integer programs, the Initial Fleet Mix Generator (IFM) and the Mathematical Programming Procedure (MPP), and a multi-criterion function called the measure of goodness. The IFM, MPP and Measure of Goodness are critical components of the composite approach. A key application area of the CARP-VSD is the routing of residential sanitation vehicles; throughout this paper, we derive parameters specific to this problem. In this paper, we describe the composite approach, the IFM, the MPP, the measure of goodness and work out several examples in detail.

Recommendations

• Variants of the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• Modeling and solving the mixed capacitated general routing problem
• The fleet size and mix problem for capacitated arc routing
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application

Cites work

• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1749229 (Why is no real title available?)
• scientific article; zbMATH DE number 1749230 (Why is no real title available?)
• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• The vehicle routing problem

Cited in

(6)

• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• 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 decade of capacitated arc routing
• A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms
• Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling

Describes a project that uses

Uses Software

• VRP

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

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