An optimization approach for communal home meal delivery service: A case study

  • Authors:
  • Olli Bräysy;Pentti Nakari;Wout Dullaert;Pekka Neittaanmäki

  • Affiliations:
  • Agora Innoroad Laboratory, Agora Center, P.O. Box 35, FI-40014 University of Jyväskylä, Finland;Agora Innoroad Laboratory, Agora Center, P.O. Box 35, FI-40014 University of Jyväskylä, Finland;Institute of Transport and Maritime Management Antwerp, University of Antwerp, Keizerstraat 64, B-2000 Antwerp, Belgium and Antwerp Maritime Academy, Noordkasteel Oost 6, 2030 Antwerp, Belgium;Department of Mathematical Information Technology, University of Jyväskylä, P.O. Box 35, FI-40014 University of Jyväskylä, Finland

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 7.29

Visualization

Abstract

This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.