A rich vehicle routing problem dealing with perishable food: a case study

• Pedro Amorim ^[1] ; Sophie N. Parragh ^[2] ; Fabrício Sperandio ^[1] ; Bernardo Almada-Lobo ^[1]
  1. [1] Universidade Do Porto

     Universidade Do Porto

     Santo Ildefonso, Portugal

     
  2. [2] University of Vienna

     University of Vienna

     Innere Stadt, Austria

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 22, Nº. 2, 2014, págs. 489-508
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • This paper presents a successful application of operations research techniques in guiding the decision making process to achieve a superior operational efficiency in core activities. We focus on a rich vehicle routing problem faced by a Portuguese food distribution company on a daily basis. This problem can be described as a heterogeneous fleet site dependent vehicle routing problem with multiple time windows. We use the adaptative large neighbourhood search framework, which has proven to be effective to solve a variety of different vehicle routing problems. Our plans are compared against those of the company and the impact that the proposed decision support tool may have in terms of cost savings is shown. The algorithm converges quickly giving the planner considerably more time to focus on value-added tasks, rather than manually correct the routing schedule. Moreover, contrarily to the necessary adaptation time of the planner, the tool is quite flexible in following market changes, such as the introduction of new customers or new products.