 |
Conference papers
Single Closest Task Assignment: a Heuristic Method for the Sectoring-Arc Routing Problem
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
https://hal-utt.archives-ouvertes.fr/hal-02507709
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, March 13, 2020 - 2:40:14 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, March 13, 2020 - 2:40:14 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM
`