| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 11.92 MB | Adobe PDF |
Advisor(s)
Abstract(s)
This paper explores the problem of sectorization of a parcel delivery service that wants to assign an action region to each of its teams, regarding the number of deliveries scheduled for each zone, so that there is a balanced service amongst sectors, covering contiguous zones, and considering limited capacities for the teams. Besides being relatively easy to model, the available optimization tools and software provide poor results when dimension increases in these types of problems, with computational capacity exceeding. In this paper an integer programming model, combined with an heuristic to return a faster solution, was implemented to solve a sectorization problem in two different situations. The main advantage of the strategy proposed, compared to previous ones, is its simplicity and easy implementation while still returning an optimal solution.
Description
Keywords
Sectorization Heuristics Integer Programming
Citation
Publisher
Springer, Cham