In recent years, reducing emissions has been important for mitigating global warming and the effects of traffic congestion. As a variant of the green vehicle routing problem (GVRP), the time-dependent GVRP with time windows (TDGVRPTW) accounts for both time-dependent travel times and time window constraints and integrates the minimization of carbon emissions. Therefore, the TDGVRPTW is of great practical interest. In this paper, we design an effective adaptive large neighborhood search (ALNS) algorithm for solving the TDGVRPTW. The proposed algorithm uses a time discretization search (TDS) method to determine the departure time from each customer node, together with efficient feasibility checking procedures. The ALNS algorithm has been extensively tested on benchmark instances derived from the literature. The results show that, for small-size instances for which optimal solutions are known, the proposed algorithm can solve several instances to optimality and that high-quality solutions can be obtained for the instances that are not solved to optimality. For large-size instances involving up to 1000 customers, ALNS is particularly effective in computing solutions using a very limited amount of computing time.

Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows / Liu Y.; Roberto Baldacci; Zhou J.; Yu Y.; Zhang Y.; Sun W.. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - ELETTRONICO. - 310:1(2023), pp. 133-155. [10.1016/j.ejor.2023.02.028]

Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows

Roberto Baldacci;
2023

Abstract

In recent years, reducing emissions has been important for mitigating global warming and the effects of traffic congestion. As a variant of the green vehicle routing problem (GVRP), the time-dependent GVRP with time windows (TDGVRPTW) accounts for both time-dependent travel times and time window constraints and integrates the minimization of carbon emissions. Therefore, the TDGVRPTW is of great practical interest. In this paper, we design an effective adaptive large neighborhood search (ALNS) algorithm for solving the TDGVRPTW. The proposed algorithm uses a time discretization search (TDS) method to determine the departure time from each customer node, together with efficient feasibility checking procedures. The ALNS algorithm has been extensively tested on benchmark instances derived from the literature. The results show that, for small-size instances for which optimal solutions are known, the proposed algorithm can solve several instances to optimality and that high-quality solutions can be obtained for the instances that are not solved to optimality. For large-size instances involving up to 1000 customers, ALNS is particularly effective in computing solutions using a very limited amount of computing time.
2023
Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows / Liu Y.; Roberto Baldacci; Zhou J.; Yu Y.; Zhang Y.; Sun W.. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - ELETTRONICO. - 310:1(2023), pp. 133-155. [10.1016/j.ejor.2023.02.028]
Liu Y.; Roberto Baldacci; Zhou J.; Yu Y.; Zhang Y.; Sun W.
File in questo prodotto:
File Dimensione Formato  
ALNS-TDGVRPTW.pdf

embargo fino al 09/05/2025

Tipo: Postprint
Licenza: Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione 612.35 kB
Formato Adobe PDF
612.35 kB Adobe PDF   Visualizza/Apri   Contatta l'autore

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/11585/954741
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 6
social impact