A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations

Driven by the new laws and regulations concerning the emission of greenhouse gases, it is becoming more and more popular for enterprises to adopt cleaner energy. This research proposes a novel two-echelon vehicle routing problem consisting of mixed vehicles considering battery swapping stations, whi...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Dan Wang, Hong Zhou
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	two-echelon vehicle routing problems electric vehicles time windows variable neighborhood search Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999
Acceso en línea:	https://doaj.org/article/eee6e888945546909e8c7362aead2e5b
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:eee6e888945546909e8c7362aead2e5b
record_format	dspace
spelling	oai:doaj.org-article:eee6e888945546909e8c7362aead2e5b2021-11-25T16:37:52ZA Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations10.3390/app1122107792076-3417https://doaj.org/article/eee6e888945546909e8c7362aead2e5b2021-11-01T00:00:00Zhttps://www.mdpi.com/2076-3417/11/22/10779https://doaj.org/toc/2076-3417Driven by the new laws and regulations concerning the emission of greenhouse gases, it is becoming more and more popular for enterprises to adopt cleaner energy. This research proposes a novel two-echelon vehicle routing problem consisting of mixed vehicles considering battery swapping stations, which includes one depot, multiple satellites with unilateral time windows, and customers with given demands. The fossil fuel-based internal combustion vehicles are employed in the first echelon, while the electric vehicles are used in the second echelon. A mixed integer programming model for this proposed problem is established in which the total cost, including transportation cost, handling cost, fixed cost of two kinds of vehicles, and recharging cost, is minimized. Moreover, based on the variable neighborhood search, a metaheuristic procedure is developed to solve the problem. To validate its effectiveness, extensive numerical experiments are conducted over the randomly generated instances of different sizes. The computational results show that the proposed metaheuristic can produce a good logistics scheme with high efficiency.Dan WangHong ZhouMDPI AGarticletwo-echelon vehicle routing problemselectric vehiclestime windowsvariable neighborhood searchTechnologyTEngineering (General). Civil engineering (General)TA1-2040Biology (General)QH301-705.5PhysicsQC1-999ChemistryQD1-999ENApplied Sciences, Vol 11, Iss 10779, p 10779 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	two-echelon vehicle routing problems electric vehicles time windows variable neighborhood search Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999
spellingShingle	two-echelon vehicle routing problems electric vehicles time windows variable neighborhood search Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999 Dan Wang Hong Zhou A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations
description	Driven by the new laws and regulations concerning the emission of greenhouse gases, it is becoming more and more popular for enterprises to adopt cleaner energy. This research proposes a novel two-echelon vehicle routing problem consisting of mixed vehicles considering battery swapping stations, which includes one depot, multiple satellites with unilateral time windows, and customers with given demands. The fossil fuel-based internal combustion vehicles are employed in the first echelon, while the electric vehicles are used in the second echelon. A mixed integer programming model for this proposed problem is established in which the total cost, including transportation cost, handling cost, fixed cost of two kinds of vehicles, and recharging cost, is minimized. Moreover, based on the variable neighborhood search, a metaheuristic procedure is developed to solve the problem. To validate its effectiveness, extensive numerical experiments are conducted over the randomly generated instances of different sizes. The computational results show that the proposed metaheuristic can produce a good logistics scheme with high efficiency.
format	article
author	Dan Wang Hong Zhou
author_facet	Dan Wang Hong Zhou
author_sort	Dan Wang
title	A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations
title_short	A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations
title_full	A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations
title_fullStr	A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations
title_full_unstemmed	A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations
title_sort	two-echelon electric vehicle routing problem with time windows and battery swapping stations
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/eee6e888945546909e8c7362aead2e5b
work_keys_str_mv	AT danwang atwoechelonelectricvehicleroutingproblemwithtimewindowsandbatteryswappingstations AT hongzhou atwoechelonelectricvehicleroutingproblemwithtimewindowsandbatteryswappingstations AT danwang twoechelonelectricvehicleroutingproblemwithtimewindowsandbatteryswappingstations AT hongzhou twoechelonelectricvehicleroutingproblemwithtimewindowsandbatteryswappingstations
_version_	1718413112765317120

A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations

Ejemplares similares