In this paper we study the Multi-period Vehicle Routing Problem with Due dates (MVRPD), where customers have to be served between a release and a due date. Customers with due dates exceeding the planning period may be postponed at a cost. A fleet of capacitated vehicles is available to perform the distribution in each day of the planning period. The objective of the problem is to find vehicle routes for each day such that the overall cost of the distribution, including transportation costs, inventory costs and penalty costs for postponed service, is minimized. We present alternative formulations for the MVRPD and enhance the formulations with valid inequalities. The formulations are solved with a branch-and-cut algorithm and computationally compared. Furthermore, we present a computational analysis aimed at highlighting managerial insights. We study the potential benefit that can be achieved by incorporating flexibility in the due dates and the number of vehicles. Finally, we highlight the effect of reducing vehicle capacity.

Multi-period Vehicle Routing Problem with Due dates

JABALI, OLA;
2015-01-01

Abstract

In this paper we study the Multi-period Vehicle Routing Problem with Due dates (MVRPD), where customers have to be served between a release and a due date. Customers with due dates exceeding the planning period may be postponed at a cost. A fleet of capacitated vehicles is available to perform the distribution in each day of the planning period. The objective of the problem is to find vehicle routes for each day such that the overall cost of the distribution, including transportation costs, inventory costs and penalty costs for postponed service, is minimized. We present alternative formulations for the MVRPD and enhance the formulations with valid inequalities. The formulations are solved with a branch-and-cut algorithm and computationally compared. Furthermore, we present a computational analysis aimed at highlighting managerial insights. We study the potential benefit that can be achieved by incorporating flexibility in the due dates and the number of vehicles. Finally, we highlight the effect of reducing vehicle capacity.
2015
City distribution, Experimental analysis, Inventory routing problem, Periodic vehicle routing problem, Computer Science, Management Science and Operations Research, Modeling and Simulation
File in questo prodotto:
File Dimensione Formato  
2015 - Multi-Period Vehicle Routing Problem .pdf

Accesso riservato

Descrizione: Articolo principale
: Publisher’s version
Dimensione 297.35 kB
Formato Adobe PDF
297.35 kB Adobe PDF   Visualizza/Apri
Multi-period Vehicle Routing Problem with Due dates_11311-1003004_Jabali.pdf

accesso aperto

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 207.78 kB
Formato Adobe PDF
207.78 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1003004
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 70
  • ???jsp.display-item.citation.isi??? 64
social impact