Single Closest Task Assignment: a Heuristic Method for the Sectoring-Arc Routing Problem

Author

Lacomme, Philippe ; Mourâo, Maria Cândida ; Nunes, Ana Catarina ; Prins, Christian

Author_Institution

LIMOS, Univ. Blaise Pascal, Aubiere

Volume

2

fYear

2006

Firstpage

1531

Lastpage

1535

Abstract

The aim of the sectoring-arc routing problem (SARP) is to partition a large region into a given number of smaller sub-regions (sectors) and to build a set of trips in each sector, such that the total duration of the trips is minimized. A graph partition is made to simplify the organization of the activities that must be executed. The SARP arises here in the context of waste collection. A heuristic method is presented, based on the assignment of single tasks to sectors. Sectors are built simultaneously. The heuristic is performed on a set of benchmark problems. Computational results are presented and analysed

Keywords

graph theory; transportation; vehicles; graph partition; heuristic method; sectoring-arc routing problem; single closest task assignment; trip total duration minimization; vehicles; Business; Cities and towns; Costs; Marketing and sales; Meter reading; Routing; Vehicle driving; arc-routing problem; heuristic method; sectoring problem; two-phase method;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Systems and Service Management, 2006 International Conference on

Conference_Location

Troyes

Print_ISBN

1-4244-0450-9

Electronic_ISBN

1-4244-0451-7

Type

conf

DOI

10.1109/ICSSSM.2006.320763

Filename

4114718