A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks

With a greater awareness of the challenges regarding environmental, societal, political, and economic factors, where reverse logistics has become a significant part of supply chain networks, this paper presents an integrated forward and reverse logistics network, named the Heterogeneous Fleet Vehicl...

Full description

Saved in:
Bibliographic Details
Main Authors: YU, Vincent F., ANH, Pham Tuan, GUNAWAN, Aldy, HAN, Hsun
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2024
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/8223
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-9226
record_format dspace
spelling sg-smu-ink.sis_research-92262023-10-13T09:18:03Z A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks YU, Vincent F. ANH, Pham Tuan GUNAWAN, Aldy HAN, Hsun With a greater awareness of the challenges regarding environmental, societal, political, and economic factors, where reverse logistics has become a significant part of supply chain networks, this paper presents an integrated forward and reverse logistics network, named the Heterogeneous Fleet Vehicle Routing Problem with Multiple Forward/Reverse Cross-Docks (HF-VRPMFRCD). We consider a heterogeneous fleet of vehicles with different loading capacities and transportation costs. We also consider multiple cross-docks with two different operations: forward and reverse processes. The former focuses on delivering the demand from suppliers to customers, while the latter aims at returning unsold products from customers to suppliers. We propose a Simulated Annealing with Variable Neighborhood Descent (SAVND) algorithm for solving HF-VRPMFRCD, where Variable Neighborhood Descent (VND) is a local search heuristic embedded in the framework of Simulated Annealing (SA). SAVND outperforms the state-of-the-art algorithm in solving the Heterogeneous Fleet Vehicle Routing Problem with Multiple Cross-Docks (HF-VRPMCD), where the VND heuristic significantly improves the quality of solutions. For HF-VRPMFRCD benchmark instances, SAVND provides optimal solutions for small-scale instances and better solutions than those of the GUROBI solver for remaining larger instances. Lastly, we present and discuss the benefits of integrating the forward and reverse processes. 2024-03-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/8223 info:doi/10.1016/j.eswa.2023.121631 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Forward/reverse logistics Heterogeneous fleet Multiple cross-docks Simulated annealing Variable neighborhood descent Artificial Intelligence and Robotics
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Forward/reverse logistics
Heterogeneous fleet
Multiple cross-docks
Simulated annealing
Variable neighborhood descent
Artificial Intelligence and Robotics
spellingShingle Forward/reverse logistics
Heterogeneous fleet
Multiple cross-docks
Simulated annealing
Variable neighborhood descent
Artificial Intelligence and Robotics
YU, Vincent F.
ANH, Pham Tuan
GUNAWAN, Aldy
HAN, Hsun
A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
description With a greater awareness of the challenges regarding environmental, societal, political, and economic factors, where reverse logistics has become a significant part of supply chain networks, this paper presents an integrated forward and reverse logistics network, named the Heterogeneous Fleet Vehicle Routing Problem with Multiple Forward/Reverse Cross-Docks (HF-VRPMFRCD). We consider a heterogeneous fleet of vehicles with different loading capacities and transportation costs. We also consider multiple cross-docks with two different operations: forward and reverse processes. The former focuses on delivering the demand from suppliers to customers, while the latter aims at returning unsold products from customers to suppliers. We propose a Simulated Annealing with Variable Neighborhood Descent (SAVND) algorithm for solving HF-VRPMFRCD, where Variable Neighborhood Descent (VND) is a local search heuristic embedded in the framework of Simulated Annealing (SA). SAVND outperforms the state-of-the-art algorithm in solving the Heterogeneous Fleet Vehicle Routing Problem with Multiple Cross-Docks (HF-VRPMCD), where the VND heuristic significantly improves the quality of solutions. For HF-VRPMFRCD benchmark instances, SAVND provides optimal solutions for small-scale instances and better solutions than those of the GUROBI solver for remaining larger instances. Lastly, we present and discuss the benefits of integrating the forward and reverse processes.
format text
author YU, Vincent F.
ANH, Pham Tuan
GUNAWAN, Aldy
HAN, Hsun
author_facet YU, Vincent F.
ANH, Pham Tuan
GUNAWAN, Aldy
HAN, Hsun
author_sort YU, Vincent F.
title A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
title_short A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
title_full A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
title_fullStr A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
title_full_unstemmed A simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
title_sort simulated annealing with variable neighborhood descent approach for the heterogeneous fleet vehicle routing problem with multiple forward/reverse cross-docks
publisher Institutional Knowledge at Singapore Management University
publishDate 2024
url https://ink.library.smu.edu.sg/sis_research/8223
_version_ 1781793936583426048