Talk
Models for the Sectoring-Arc Routing Problem (SARP)
Ana Catarina Nunes (Nunes, Ana Catarina); Maria Cândida Mourão (Mourão, Maria Cândida);
Event Title
Euro XXIV - 24th European Conference on Operational Research
Year (definitive publication)
2010
Language
English
Country
Portugal
More Information
Visit Link
Web of Science®

This publication is not indexed in Web of Science®

Scopus

This publication is not indexed in Scopus

Google Scholar

Times Cited: 0

(Last checked: 2024-10-11 21:10)

View record in Google Scholar

Abstract
The Sectoring-Arc Routing Problem (SARP) models the activities associated with the streets of large urban areas, such as waste collection. The SARP is defined over a mixed graph. Its aim is to identify a given number of similar sectors (sub-graphs) and to build a set of collecting trips in each sector, such that the total duration of the trips is minimized. Each sector is collected by one vehicle and each of its trips can not exceed a given load. Linear mixed integer programming formulations are presented for the SARP, and computational results over a set of benchmark problems are reported.
Acknowledgements
--
Keywords
Routing, Graphs and Networks, Transportation and Logistics
Publication Identifiers
ci-pub-9403
Other Publication Details
Yes
Both (printed and digital)
Lisboa
Conference
European
Oral Presentation