Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks

This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Dengkai Hou, Houming Fan, Xiaoxue Ren
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	time-dependent networks multi-depot joint distribution asymmetric graph hybrid genetic algorithm with variable neighborhood search Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/f25f66c533a343c1ab4e659ab927e207
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:f25f66c533a343c1ab4e659ab927e207
record_format	dspace
spelling	oai:doaj.org-article:f25f66c533a343c1ab4e659ab927e2072021-11-25T19:06:35ZMulti-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks10.3390/sym131120822073-8994https://doaj.org/article/f25f66c533a343c1ab4e659ab927e2072021-11-01T00:00:00Zhttps://www.mdpi.com/2073-8994/13/11/2082https://doaj.org/toc/2073-8994This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the road network speed in the distribution area, considering the influence of the road network on the vehicle speed and the relationship between vehicle load and fuel consumption, a multi-depot joint distribution vehicle routing optimization model is established to minimize the sum of vehicle fixed cost, fuel consumption cost and time window penalty cost. Traditional vehicle routing problems are modeled based on symmetric graphs. In this paper, considering the influence of time-dependent networks on routes optimization, modeling is based on asymmetric graphs, which increases the complexity of the problem. A hybrid genetic algorithm with variable neighborhood search (HGAVNS) is designed to solve the model, in which the nearest neighbor insertion method and Logistic mapping equation are used to generate the initial solution firstly, and then five neighborhood structures are designed to improve the algorithm. An adaptive neighborhood search times strategy is used to balance the diversification and depth search of the population. The effectiveness of the designed algorithm is verified through several groups of numerical instances with different scales. The research can enrich the relevant theoretical research of multi-depot vehicle routing problems and provide the theoretical basis for transportation enterprises to formulate reasonable distribution schemes.Dengkai HouHouming FanXiaoxue RenMDPI AGarticletime-dependent networksmulti-depot joint distributionasymmetric graphhybrid genetic algorithm with variable neighborhood searchMathematicsQA1-939ENSymmetry, Vol 13, Iss 2082, p 2082 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	time-dependent networks multi-depot joint distribution asymmetric graph hybrid genetic algorithm with variable neighborhood search Mathematics QA1-939
spellingShingle	time-dependent networks multi-depot joint distribution asymmetric graph hybrid genetic algorithm with variable neighborhood search Mathematics QA1-939 Dengkai Hou Houming Fan Xiaoxue Ren Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks
description	This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at the multi-depot joint distribution vehicle routing problem where the vehicle travel time depends on the variation characteristics of the road network speed in the distribution area, considering the influence of the road network on the vehicle speed and the relationship between vehicle load and fuel consumption, a multi-depot joint distribution vehicle routing optimization model is established to minimize the sum of vehicle fixed cost, fuel consumption cost and time window penalty cost. Traditional vehicle routing problems are modeled based on symmetric graphs. In this paper, considering the influence of time-dependent networks on routes optimization, modeling is based on asymmetric graphs, which increases the complexity of the problem. A hybrid genetic algorithm with variable neighborhood search (HGAVNS) is designed to solve the model, in which the nearest neighbor insertion method and Logistic mapping equation are used to generate the initial solution firstly, and then five neighborhood structures are designed to improve the algorithm. An adaptive neighborhood search times strategy is used to balance the diversification and depth search of the population. The effectiveness of the designed algorithm is verified through several groups of numerical instances with different scales. The research can enrich the relevant theoretical research of multi-depot vehicle routing problems and provide the theoretical basis for transportation enterprises to formulate reasonable distribution schemes.
format	article
author	Dengkai Hou Houming Fan Xiaoxue Ren
author_facet	Dengkai Hou Houming Fan Xiaoxue Ren
author_sort	Dengkai Hou
title	Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks
title_short	Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks
title_full	Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks
title_fullStr	Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks
title_full_unstemmed	Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks
title_sort	multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/f25f66c533a343c1ab4e659ab927e207
work_keys_str_mv	AT dengkaihou multidepotjointdistributionvehicleroutingproblemconsideringenergyconsumptionwithtimedependentnetworks AT houmingfan multidepotjointdistributionvehicleroutingproblemconsideringenergyconsumptionwithtimedependentnetworks AT xiaoxueren multidepotjointdistributionvehicleroutingproblemconsideringenergyconsumptionwithtimedependentnetworks
_version_	1718410316040110080

Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks

Ejemplares similares