Exportar Publicação

Nunes, A. C., Mourão, M. C. & Prins, C. (2009). Heuristic Methods for the sectoring arc routing problem. European Journal of Operational Research . 196 (3), 856-868

A. C. Nunes et al.,  "Heuristic Methods for the sectoring arc routing problem", in European Journal of Operational Research , vol. 196, no. 3, pp. 856-868, 2009

@article{nunes2009_1732202210058,
	author = "Nunes, A. C. and Mourão, M. C. and Prins, C.",
	title = "Heuristic Methods for the sectoring arc routing problem",
	journal = "European Journal of Operational Research ",
	year = "2009",
	volume = "196",
	number = "3",
	doi = "10.1016/j.ejor.2008.04.025",
	pages = "856-868",
	url = "http://www.sciencedirect.com/science/article/pii/S0377221708003834"
}

TY  - JOUR
TI  - Heuristic Methods for the sectoring arc routing problem
T2  - European Journal of Operational Research 
VL  - 196
IS  - 3
AU  - Nunes, A. C.
AU  - Mourão, M. C.
AU  - Prins, C.
PY  - 2009
SP  - 856-868
SN  - 0377-2217
DO  - 10.1016/j.ejor.2008.04.025
UR  - http://www.sciencedirect.com/science/article/pii/S0377221708003834
AB  - 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.
ER  -