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
type: Item
instance of: scholarly article
title: 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
zbMATH Open document ID: 1146.90338
author: John Sniezek
author: Lawrence Bodin
published in: Annals of Operations Research
publication date: 2007-02-15T00:00:00Z
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.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5127447
zbMATH Keywords: mixed integer programs
zbMATH Keywords: heuristic methods
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10479-006-0006-y
OpenAlex ID: W2009241972
cites work: Q5687196
cites work: Q4510100
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Q4532232
cites work: Q4532233
cites work: The vehicle routing problem
DOI: 10.1007/S10479-006-0006-Y
description: scientific article; zbMATH DE number 5127447