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 (Q867538)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5127447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 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 |
scientific article; zbMATH DE number 5127447 |
Statements
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 (English)
0 references
15 February 2007
0 references
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.
0 references
mixed integer programs
0 references
heuristic methods
0 references
0.7856742739677429
0 references
0.7856106758117676
0 references
0.7807613611221313
0 references
0.7804718017578125
0 references
