Heuristic methods for the sectoring arc routing problem - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2009

Heuristic methods for the sectoring arc routing problem

(1, 2) , (3, 2) , (4)
1
2
3
4

Abstract

The sectoring arc routing problem (SARP) is introduced to model activities associated with the streets of large urban areas, like municipal waste collection. The aim is to partition the street network into a given number of sectors and to build a set of vehicle trips in each sector, to minimize the total duration of the trips. Two two-phase heuristics and one best insertion method are proposed. In the two-phase methods, phase 1 constructs the sectors using two possible heuristics, while phase 2 solves a mixed capacitated arc routing problem (MCARP) to compute the trips in each sector. The best insertion method determines sectors and trips simultaneously. In addition to solution cost, some evaluation criteria such as imbalance, diameter and dispersion measures are used to compare algorithms. Numerical results on large instances with up to 401 nodes and 1056 links (arcs or edges) are reported and analysed.

Dates and versions

hal-02493950 , version 1 (28-02-2020)

Identifiers

Cite

Maria Cândida Mourão, Ana Catarina Nunes, Christian Prins. Heuristic methods for the sectoring arc routing problem. European Journal of Operational Research, 2009, 196 (3), pp.856-868. ⟨10.1016/j.ejor.2008.04.025⟩. ⟨hal-02493950⟩

Collections

CNRS UTT LOSI
14 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More