A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

Abstract The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. W...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Bohong Wang, Yongtu Liang, Meng Yuan, Haoran Zhang, Qi Liao
Formato:	article
Lenguaje:	EN
Publicado:	KeAi Communications Co., Ltd. 2019
Materias:	Petrol truck routing problem Heuristic algorithm Valid inequalities Time windows Science Q Petrology QE420-499
Acceso en línea:	https://doaj.org/article/3b7fd4c29bfd4a20aa13b431f21b4e41
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:3b7fd4c29bfd4a20aa13b431f21b4e41
record_format	dspace
spelling	oai:doaj.org-article:3b7fd4c29bfd4a20aa13b431f21b4e412021-12-02T09:54:43ZA metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows10.1007/s12182-019-0316-81672-51071995-8226https://doaj.org/article/3b7fd4c29bfd4a20aa13b431f21b4e412019-04-01T00:00:00Zhttp://link.springer.com/article/10.1007/s12182-019-0316-8https://doaj.org/toc/1672-5107https://doaj.org/toc/1995-8226Abstract The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion. In addition, an approach that accelerates the solution process by adding several valid inequalities is presented. In this study, the trucks are homogeneous and have two compartments, and each truck can execute at most three tasks daily. The sales company arranges the transfer amount and the time windows for each station. The performance of the proposed algorithm is evaluated by comparing its results with the optimal results. In addition, a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.Bohong WangYongtu LiangMeng YuanHaoran ZhangQi LiaoKeAi Communications Co., Ltd.articlePetrol truck routing problemHeuristic algorithmValid inequalitiesTime windowsScienceQPetrologyQE420-499ENPetroleum Science, Vol 16, Iss 3, Pp 701-712 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	Petrol truck routing problem Heuristic algorithm Valid inequalities Time windows Science Q Petrology QE420-499
spellingShingle	Petrol truck routing problem Heuristic algorithm Valid inequalities Time windows Science Q Petrology QE420-499 Bohong Wang Yongtu Liang Meng Yuan Haoran Zhang Qi Liao A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
description	Abstract The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion. In addition, an approach that accelerates the solution process by adding several valid inequalities is presented. In this study, the trucks are homogeneous and have two compartments, and each truck can execute at most three tasks daily. The sales company arranges the transfer amount and the time windows for each station. The performance of the proposed algorithm is evaluated by comparing its results with the optimal results. In addition, a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.
format	article
author	Bohong Wang Yongtu Liang Meng Yuan Haoran Zhang Qi Liao
author_facet	Bohong Wang Yongtu Liang Meng Yuan Haoran Zhang Qi Liao
author_sort	Bohong Wang
title	A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
title_short	A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
title_full	A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
title_fullStr	A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
title_full_unstemmed	A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
title_sort	metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
publisher	KeAi Communications Co., Ltd.
publishDate	2019
url	https://doaj.org/article/3b7fd4c29bfd4a20aa13b431f21b4e41
work_keys_str_mv	AT bohongwang ametaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT yongtuliang ametaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT mengyuan ametaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT haoranzhang ametaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT qiliao ametaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT bohongwang metaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT yongtuliang metaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT mengyuan metaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT haoranzhang metaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows AT qiliao metaheuristicmethodforthemultireturntodepotpetroltruckroutingproblemwithtimewindows
_version_	1718397877140586496

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

Ejemplares similares