| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 699.06 KB | Adobe PDF |
Advisor(s)
Abstract(s)
Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When the safes to be collected are located along the streets, it corresponds to an arc routing problem, which we call DARP, and when the money is from ATMs, it corresponds to a vehicle routing problem, usually referred to as the peripatetic routing problem. The former problem arises in a Portuguese company in charge of street parking in Lisbon. The firm needs to define tours to collect safes from parking meters, minimizing the total collecting time. To avoid robberies these tours cannot be repeated or somehow anticipated. For this new problem, we present a mixed integer linear programming (MILP) model and develop a matheuristic. Preliminary experiments are provided with data that mimic the real confidential data. Results point to a good performance of the matheuristic, while the smaller instances can be solved to optimality with the MILP model and a commercial solver.
Description
Keywords
Arc Routing Dissimilar Arc Routing Mixed Integer Linear Programming Formulation Flow Models Matheuristics Risk Constrained Cash-in-transit
Pedagogical Context
Citation
Constantino, Miguel, M. Cândida Mourão and Leonor S. Pinto .(2017). Wiley Periodicals, Inc. - NETWORKS, Vol. 70, No. 3: pp. 233–245 . (Search PDF in 2023).
Publisher
John Wiley & Sons