| Article ID: | iaor201681 |
| Volume: | 23 |
| Issue: | 3 |
| Start Page Number: | 433 |
| End Page Number: | 458 |
| Publication Date: | May 2016 |
| Journal: | International Transactions in Operational Research |
| Authors: | Fernndez Elena, Gonzlez-Velarde Jos Luis, Ros-Mercado Roger Z, Garca-Ayala Gabriela |
| Keywords: | networks, design, transportation: road, programming: integer, programming: linear, planning |
The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts.