Memetic algorithm with non-smooth penalty for capacitated arc routing problem[Formula presented]

Rui LI, Xinchao ZHAO, Xingquan ZUO, Jianmei YUAN, Xin YAO

Research output: Journal PublicationsJournal Article (refereed)peer-review

12 Citations (Scopus)

Abstract

The capacitated arc routing problem (CARP) has attracted much attention during last decades due to its wide applications. However, the existing research methods still have a little potential to make full use of the characteristics of CARP. This paper aims to mine the essential characteristics of arc routing problem that node routing problem does not have. Based on the observation on characteristics of arc routing instances, smooth condition is proposed and constructed as a rule to divide the link between two tasks into smooth link and non-smooth link. Then smooth degree is defined to measure the influence of non-smooth links on solution and a small smooth degree means the better quality for a solution. The effect of smooth degree is verified through simulation comparison on several instance sets, which indicates that there is a positive correlation between smooth degree and the total cost of a solution. Non-smooth penalty is used to drive the non-smooth solution to smooth and to improve its total cost. Then non-smooth penalty is inserted into path-scanning variants and new construction algorithms are obtained. A partial reconstruction method (PRM) is designed using these construction algorithms as an alternative kernel method. In order to further reduce the routes number, a reinsert method (RiM) is proposed. Combining these two methods with traditional local search algorithms, a memetic algorithm with non-smooth penalty (MANSP) is proposed which is originated from the initial observation on the essential characteristics of arc routing problem. Extensive experiments on smooth degree, penalty factor, and comparison with state-of-the-art algorithms show that the proposed strategies are effective and the proposed algorithm MANSP performs very competitive. © 2021 Elsevier B.V.
Original languageEnglish
Article number106957
JournalKnowledge-Based Systems
Volume220
Early online date18 Mar 2021
DOIs
Publication statusPublished - May 2021
Externally publishedYes

Bibliographical note

This work is supported by National Natural Science Foundation of China (61973042 , 61873040) and Beijing Natural Science Foundation, China (1202020).

Keywords

  • Capacitated arc routing problem (CARP)
  • Memetic algorithm (MA)
  • Non-smooth penalty
  • Reinsertion method
  • Smooth condition
  • Smooth degree

Fingerprint

Dive into the research topics of 'Memetic algorithm with non-smooth penalty for capacitated arc routing problem[Formula presented]'. Together they form a unique fingerprint.

Cite this