Exportar Publicação

A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.

Exportar Referência (APA) 
Nunes, Ana Catarina, Cortinhal, M.J. & Mourão, Maria Cândida (2013). An adaptive large neighborhood search heuristic for the sectoring-arc routing problem. EURO-INFORMS XXVI - 26th European Conference on Operational Research.
Exportar Referência (IEEE) 
A. C. Nunes et al.,  "An adaptive large neighborhood search heuristic for the sectoring-arc routing problem", in EURO-INFORMS XXVI - 26th European Conf. on Operational Research, Roma, 2013
Exportar BibTeX 
@misc{nunes2013_1732200781476,
	author = "Nunes, Ana Catarina and Cortinhal, M.J. and Mourão, Maria Cândida",
	title = "An adaptive large neighborhood search heuristic for the sectoring-arc routing problem",
	year = "2013",
	howpublished = "Outro",
	url = "http://euro2013.org/"
}
Exportar RIS 
TY  - CPAPER
TI  - An adaptive large neighborhood search heuristic for the sectoring-arc routing problem
T2  - EURO-INFORMS XXVI - 26th European Conference on Operational Research
AU  - Nunes, Ana Catarina
AU  - Cortinhal, M.J.
AU  - Mourão, Maria Cândida
PY  - 2013
CY  - Roma
UR  - http://euro2013.org/
AB  - The sectoring-arc routing problem involves partitioning one area into sectors, within a time-limit and building arc routing trips per sector, within the vehicles capacity. Among its several real world applications lies the refuse collection. In the refuse collection problem, the aim is to design routes that minimize the total routing cost but taking into account desirable features for the sectors, such as balancing, compactness and contiguity. We propose an adaptive large neighborhood search heuristic. The performance of the algorithm is evaluated over a set of benchmark problems.
ER  -