Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints

Nacima Labadie, Christian Prins, Yanyan Yang

Abstract

This paper deals with vehicle routing problem (VRP) with synchronization constraints. This problem consists in determining a least-cost set of routes to serve customers who may require several synchronized visits. The main contribution of the paper is: 1) it presents a definition and a classification of different types of synchronization constraints considered in the VRP literature; 2) it describes a variant of vehicle routing problem with synchronization constraints which is formulated as a mixed integer programming model; 3) finally, it provides a constructive heuristics and an iterated local search metaheuristic to solve the considered problem. The performance of the proposed approaches is evaluated small and medium sized instances.

References

  1. Amaya, A., Langevin, A., and Trpanier, M. (2007). The capacitated arc routing problem with refill points. Operations Research Letters, 35:45 -53.
  2. Amaya, A., Langevin, A., and Trpanier, M. (2010). A heuristic method for the capacitated arc routing problem with refill points and multiple loads. Journal of the Operational Research Society, 61:1095-1103.
  3. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., and Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. TOP, 15:1-31.
  4. Braysy, O., Dullaert, W., and Nakari, P. (2009). The potential of optimization in communal routing problems: case studies from finland. Journal of Transport Geography, 17:484 - 490.
  5. Bredstrom, D. and Ronnqvist, M. (2008). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research, 191:19-31.
  6. Dantzig, G. B. and Ramser, J. H. (1959). The truck dispatching problem. Management Science, 1:80-91.
  7. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M., and Soumis, F. (2002). Vrp with pickup and delivery. In Toth, P. and Vigo, D., editors, The vehicle routing problem, volume 9, pages 225-242. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA.
  8. Dohn, A., Rasmussen, M. S., and Larsen, J. (2009). The vehicle routing problem with time windows and temporal dependencies. volume 1. DTU Management Engineering, Copenhagen.
  9. Drexl, M. (2011). Synchronization in vehicle routing: A survey of vrps with multiple synchronization constraints. Technical Report LM.
  10. Ioachim, I. and Desosiers, J. (1999). Fleet assignment and routing with schedule synchronization constraints. European Journal of Operational Research, 119:75 - 90.
  11. Kim, B., Koo, J., and Park, J. (2010). The combined manpower-vehicle routing problem for multi-staged services. Expert Systems with Applications, 37:8424- 8431.
  12. Loureno, H., Martin, O., and Thomas, T. (2003). Iterated local search. In Hillier, F. S., Glover, F., and Kochenberger, G., editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 320-353. Springer New York.
  13. Parragh, S., Doerner, K., and Hartl, R. (2008). A survey on pickup and delivery problems. Journal für Betriebswirtschaft, 58:21-51.
  14. Rasmussen, M. S., Justesen, T., Dohn, A., and Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219:598-610.
  15. S. Bertels, T. F. (2006). A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Computers and Operations Research, 33:2866 - 2890.
  16. Salazar-Aguilar, M. A., Langevin, A., and Laporte, G. (2012). Synchronized arc routing for snow plowing operations. Computers and Operations Research, 39:1432 - 1440.
  17. Salazar-Aguilar, M. A., Langevin, A., and Laporte, G. (2013). The synchronized arc and node routing problem: Application to road marking. Computers and Operations Research, 40:1708 - 1715.
  18. Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4:285-305.
  19. Savelsbergh, M. W. P. (1992). The vehicle routing problems with time windows: Minimizing route duration. INFORMS Journal on Computing, 4:146-154.
Download


Paper Citation


in Harvard Style

Labadie N., Prins C. and Yang Y. (2014). Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 257-263. DOI: 10.5220/0004837502570263


in Bibtex Style

@conference{icores14,
author={Nacima Labadie and Christian Prins and Yanyan Yang},
title={Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={257-263},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004837502570263},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Iterated Local Search for a Vehicle Routing Problem with Synchronization Constraints
SN - 978-989-758-017-8
AU - Labadie N.
AU - Prins C.
AU - Yang Y.
PY - 2014
SP - 257
EP - 263
DO - 10.5220/0004837502570263