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, Constantino, Miguel, L. Gouveia & Mourão, Maria Cândida (2014). The mixed capacitated arc routing problem with non-overlapping routes. ISCO2014 - 3rd International Symposium on Combinatorial Optimization.
Exportar Referência (IEEE) 
A. C. Nunes et al.,  "The mixed capacitated arc routing problem with non-overlapping routes", in ISCO2014 - 3rd Int. Symp. on Combinatorial Optimization, Lisbon, 2014
Exportar BibTeX 
@misc{nunes2014_1732201064006,
	author = "Nunes, Ana Catarina and Constantino, Miguel and L. Gouveia and Mourão, Maria Cândida",
	title = "The mixed capacitated arc routing problem with non-overlapping routes",
	year = "2014",
	howpublished = "Outro",
	url = "http://isco2014.fc.ul.pt/"
}
Exportar RIS 
TY  - CPAPER
TI  - The mixed capacitated arc routing problem with non-overlapping routes
T2  - ISCO2014 - 3rd International Symposium on Combinatorial Optimization
AU  - Nunes, Ana Catarina
AU  - Constantino, Miguel
AU  - L. Gouveia
AU  - Mourão, Maria Cândida
PY  - 2014
CY  - Lisbon
UR  - http://isco2014.fc.ul.pt/
AB  - Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle service routes with a limited number of shared nodes, i.e. vehicle service routes with a limited number of intersections. This constraint results in solutions that are better shaped for real application purposes.
We propose a new problem, the bounded overlapping MCARP (BCARP), which is denefined as the mixed capacitated arc routing problem (MCARP) with an additional constraint imposing an upper bound on the number of nodes that are common to dierent routes. The best feasible upper bound is obtained from a modifed MCARP in which the minimization criteria is given by the overlapping of the routes.
We show how to compute this bound by solving a simpler problem. To obtain feasible solutions for the bigger instances a heuristic for the BCARP is also proposed. Computational results over two sets of well known benchmark instances show that the BCARP model produces better shaped solutions (more compact, and with few intersections of routes) than the MCARP model, with only a small increase in total traveled time.
ER  -