Memetic algorithm with route decomposing for periodic capacitated arc routing problem

详细信息    查看全文

• 作者：Yuzhou Zhang^a ; Yi Mei^b ; ^{yi.mei@ecs.vuw.ac.nz} ; Ke Tang^c ; Keqin Jiang^a
• 关键词：Periodic capacitated arc routing problem ; Combinatorial optimization ; Metaheuristics ; Memetic algorithms
• 刊名：Applied Soft Computing
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：52
• 期：Complete
• 页码：1130-1142
• 全文大小：795 K
• 卷排序：52

文摘

We solve the Periodic Capacitated Arc Routing Problem (PCARP). We propose a problem-specific Route Decomposition (RD) operator for minimizing the two objectives of PCARP simultaneously. A Memetic Algorithm with RD (MARD) is proposed for solving PCARP. The efficacy of the newly proposed operator and algorithm have been empirically verified by experimental studies.