Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search

Stefan Edelkamp, Max Gath

Abstract

Transporting goods by courier and express services increases the service quality through short transit times and satisfies individual demands of customers. Determining the optimal route for a vehicle to satisfy transport requests while minimizing the total cost refers to the Single Vehicle Pickup and Delivery Problem. Beside time and distance objectives, in real world operations it is mandatory to consider further constraints such as time windows and the capacity of the vehicle. This paper presents a novel approach to solve Single Vehicle Pickup and Delivery Problems with time windows and capacity constraints by applying Nested Monte-Carlo Search (NMCS). NMCS is a randomized exploration technique which has successfully solved complex combinatorial search problems. To evaluate the approach, we apply benchmarks instances with up to 400 cities which have to be visited. The effects of varying the number of iterations and the search level are investigated. The results reveal, that the algorithm computes state-of-the-art solutions and is competitive with other approaches.

References

  1. Applegate, D. L., Bixby, R. E., Chvatal, V., and Cook, W. J. (2011). The traveling salesman problem: a computational study. Princeton University Press.
  2. Bent, R. and Hentenryck, P. V. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4):875-893.
  3. Bjarnason, R., Fern, A., and Tadepalli, P. (2009). Lower bounding klondike solitaire with monte-carlo planning. In ICAPS.
  4. Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., and Colton, S. (2012). A survey of monte carlo tree search methods. Computational Intelligence and AI in Games, IEEE Transactions on, 4(1):1-43.
  5. Cazenave, T. (2009). Nested monte-carlo search. In IJCAI, pages 456-461.
  6. Cazenave, T. and Teytaud, F. (2012). Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In LION, pages 42-54.
  7. Cordeau, J.-F. and Laporte, G. (2003a). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6):579-594.
  8. Cordeau, J.-F. and Laporte, G. (2003b). The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(2):89-101.
  9. Edelkamp, S., Gath, M., Cazenave, T., and Teytaud, F. (2013). Algorithm and knowledge engineering for the TSPTW problem. In IEEE Symposium Series on Computational Intelligence (SSCI).
  10. Een, N., Mishchenko, A., and Sörensson, N. (2007). Applying logic synthesis for speeding up sat. In Theory and Applications of Satisfiability Testing-SAT 2007, pages 272-286. Springer.
  11. Gajpal, Y. and Abad, P. (2009). An ant colony system (acs) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research, 36(12):3215-3223.
  12. Gendreau, M., Laporte, G., and Vigo, D. (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers & Operations Research, 26(7):699-714.
  13. Hernández-Pérez, H. and Salazar-González, J.-J. (2004). A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics, 145(1):126-139.
  14. Hosny, M. I. and Mumford, C. L. (2007). Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators. In Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, pages 2489- 2496. ACM.
  15. Hosny, M. I. and Mumford, C. L. (2010). The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms. Journal of Heuristics, 16(3):417-439.
  16. Jih, W.-r. and Hsu, Y. (2004). A family competition genetic algorithm for the pickup and delivery problems with time window. Bulletin of the College of Engineering, 90:121-130.
  17. Landrieu, A., Mati, Y., and Binder, Z. (2001). A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. Journal of Intelligent Manufacturing, 12(5-6):497-508.
  18. Luby, M., Sinclair, A., and Zuckerman, D. (1993). Optimal speedup of las vegas algorithms. Information Processing Letters, 47(4):173-180.
  19. Pankratz, G. (2005). A grouping genetic algorithm for the pickup and delivery problem with time windows. OR spectrum, 27(1):21-41.
  20. Parragh, S. N., Doerner, K. F., and Hartl, R. F. (2008). A Survey on Pickup and Delivery Problems Part II: Transportation between Pickup and Delivery Locations. Journal für Betriebswirtschaft, 58(2):81-117.
  21. Psaraftis, H. N. (1983). An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science, 17(3):351-357.
  22. Ropke, S., Cordeau, J.-F., and Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4):258- 272.
  23. Rosin, C. D. (2011). Nested rollout policy adaptation for monte carlo tree search. In IJCAI, pages 649-654. AAAI Press.
  24. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2):254-265.
  25. Srour, F. J. and van de Velde, S. (2013). Are stacker crane problems easy? A statistical study. Computers & Operations Research, 40(3):674 - 690.
  26. Toth, P. and Vigo, D. (1997). Heuristic algorithms for the handicapped persons transportation problem. Transportation Science, 31(1):60-71.
  27. Yan, X., Diaconis, P., Rusmevichientong, P., and Roy, B. V. (2004). Solitaire: Man versus machine. In Saul, L. K., Weiss, Y., and Bottou, L., editors, Advances in Neural Information Processing Systems 17, pages 1553- 1560. MIT Press, Cambridge, MA.
Download


Paper Citation


in Harvard Style

Edelkamp S. and Gath M. (2014). Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search . In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-015-4, pages 22-33. DOI: 10.5220/0004722300220033


in Bibtex Style

@conference{icaart14,
author={Stefan Edelkamp and Max Gath},
title={Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2014},
pages={22-33},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004722300220033},
isbn={978-989-758-015-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Solving Single Vehicle Pickup and Delivery Problems with Time Windows and Capacity Constraints using Nested Monte-Carlo Search
SN - 978-989-758-015-4
AU - Edelkamp S.
AU - Gath M.
PY - 2014
SP - 22
EP - 33
DO - 10.5220/0004722300220033