Genetic-based algorithms for cash-in-transit multi depot vehicle routing problems: economic and environmental optimization

With the gradual increase of commercial banks and the expansion of their branches, the demand for cash transportation inflates sharply, bringing opportunities to the business development of Cash-In-Transit (CIT) sectors. However, the branches are often distributed in densely populated areas where tr...

Full description

Saved in:
Bibliographic Details
Published inEnvironment, development and sustainability Vol. 25; no. 1; pp. 557 - 586
Main Authors Ge, Xianlong, Jin, Yuanzhi, Zhang, Long
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Netherlands 01.01.2023
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1387-585X
1573-2975
DOI10.1007/s10668-021-02066-9

Cover

More Information
Summary:With the gradual increase of commercial banks and the expansion of their branches, the demand for cash transportation inflates sharply, bringing opportunities to the business development of Cash-In-Transit (CIT) sectors. However, the branches are often distributed in densely populated areas where traffic jams occur from time to time, which poses a severe challenge to the route planning of CIT vehicles. In addition, risk factors need to be considered during the optimization process because the goods transported belong to valuables. In order to effectively deal with the routing problem of CIT sectors, this paper established a bi-objective model and a goal programming model of Risk-Constrained Multi Depot Vehicle Routing Problems (RCMDVRPs) using real-time traffic data. Based on the traditional genetic algorithm, a Hybrid Genetic Algorithm with Intensification procedures (HGAI) is proposed to solve the goal programming model by using a three-level linked list structure to express chromosomes visually. Then, a new Self-constrained Hybrid Genetic Algorithm (SHGA) is designed for the bi-objective model. Besides, an online path updating strategy is developed to guide remote vehicles against time-dependent traffic flows. Finally, the HGAI is performed on benchmark instances to verify its accuracy. Experimental results of performance test show that the algorithm can achieve a gap of about 3% compared with the Best Known Result (BKR). The results of a case study also show that the two models and the corresponding algorithms are feasible and can be used to solve large-scale problems according to the special preferences and goals of decision-makers.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1387-585X
1573-2975
DOI:10.1007/s10668-021-02066-9