MATEC Web Conf.
Volume 308, 20202019 8th International Conference on Transportation and Traffic Engineering (ICTTE 2019)
|Number of page(s)||5|
|Section||Traffic Data Analysis and Traffic Dispatching|
|Published online||12 February 2020|
Improved Memetic Algorithm for Multi-depot Multi-objective Capacitated Arc Routing Problem
Hebei University of Technology, School of Economics and Management, 300401 Tianjin, China
a Corresponding author: firstname.lastname@example.org
The capacitated arc routing problem (CARP) is a challenging vehicle routing problem with numerous real-world applications. In this paper, an extended version of CARP, the multi-depot multi-objective capacitated arc routing problem (MDMOCARP) is proposed to tackle practical requirements. Firstly, the critical edge decision mechanism and the critical edge random allocation mechanism are proposed to optimize edges between depots. Secondly, a novel adaptive probability of local search with fitness is proposed to improve the Decomposition-Based Memetic Algorithm for Multi-Objective CARP (D-MAENS). Compared with the D-MAENS algorithm, experimental results on MD-CARP instances show that the improved memetic algorithm (IMA) has performed significantly better than D-MAENS on convergence and diversity in the metric IGD and the metric HV.
© The Authors, published by EDP Sciences, 2020
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.