Solving a Multi-objective Vehicle Routing Problem with Synchronization Constraints

Karl Franz Dörner, Briseida Sarasola

Publications: Contribution to bookContribution to proceedingsPeer Reviewed

Abstract

In this paper, we solve a multi-objective vehicle routing problem with synchronization constraints at the delivery location. Our work is motivated by the delivery of parcels and consumer goods in urban areas, where customers may await deliveries from more than one service provider on the same day. In addition to minimizing travel costs, we also consider a second objective to address customer preferences for a compact schedule at the delivery location, so that all deliveries to a customer happen within a non-predefined time interval. To determine the Pareto fronts, three metaheuristic methods based on large neighborhood search are developed. The results on small instances are compared with an ϵ-constraint method using an exact solver. Results for large real-world instances are also presented.
Original languageEnglish
Title of host publicationComputational Logistics - 12th International Conference, ICCL 2021, Proceedings
EditorsMartijn Mes, Eduardo Lalla-Ruiz, Stefan Voß
PublisherSpringer
Pages532-546
Number of pages15
Volume13004
ISBN (Electronic)978-3-030-87672-2
ISBN (Print)978-3-030-87671-5
DOIs
Publication statusPublished - 22 Sept 2021

Publication series

SeriesLecture Notes in Computer Science
Volume13004
ISSN0302-9743

Austrian Fields of Science 2012

  • 502017 Logistics

Keywords

  • Vehicle Routing Problem
  • Synchronization
  • Multi-objective optimization
  • Vehicle routing problem

Fingerprint

Dive into the research topics of 'Solving a Multi-objective Vehicle Routing Problem with Synchronization Constraints'. Together they form a unique fingerprint.

Cite this