Exportar Publicação

Nunes, Ana Catarina, Constantino, Miguel, L. Gouveia & Mourão, Maria Cândida (2014). Non-overlapping routes for the mixed capacitated arc routing problem. VeRoLog 2014 - 3rd meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization.

A. C. Nunes et al.,  "Non-overlapping routes for the mixed capacitated arc routing problem", in VeRoLog 2014 - 3rd meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization, Oslo, 2014

@misc{nunes2014_1732202771933,
	author = "Nunes, Ana Catarina and Constantino, Miguel and L. Gouveia and Mourão, Maria Cândida",
	title = "Non-overlapping routes for the mixed capacitated arc routing problem",
	year = "2014",
	howpublished = "Outro",
	url = "http://www.sintef.no/Projectweb/verolog2014/"
}

TY  - CPAPER
TI  - Non-overlapping routes for the mixed capacitated arc routing problem
T2  - VeRoLog 2014 - 3rd meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization
AU  - Nunes, Ana Catarina
AU  - Constantino, Miguel
AU  - L. Gouveia
AU  - Mourão, Maria Cândida
PY  - 2014
CY  - Oslo
UR  - http://www.sintef.no/Projectweb/verolog2014/
AB  - Real world applications for collecting or delivering products along streets usually lead to arc routing problems with additional and complicating requirements. Among them there is the undesirable overlapping of the routes of different vehicles while performing their services. In this work we focus on the mixed capacitated arc routing problem (MCARP) with a limited number of intersections of the routes as a way to avoid the overlapping. Then, we define the bounded overlapping MCARP (BCARP), which results from the MCARP by adding a constraint ensuring an upper bound on the number of nodes shared by different routes. We also introduce a new model to compute the best feasible value for this upper bound. Mixed integer linear programming formulations are presented for the BCARP, and a heuristic is proposed to obtain feasible solutions for the bigger instances. Computational results are reported for well-known benchmark instances. The BCARP seems more suitable for real applications. In fact, the results show that better shaped service routes are obtained (more compact and with fewer intersections), with a small increase in total traveled time, when compared to the MCARP.
ER  -