Associate Professor Tsung-Che Chiang

Department of Computer Science and Information Engineering
National Taiwan Normal University

Tel: +886-2-77346692    Fax: +886-2-29322378    Email

Thammarsat Visutarrom and Tsung-Che Chiang, An evolutionary algorithm with heuristic longest cycle crossover for solving the capacitated vehicle routing problem, Proc. of IEEE Congress on Evolutionary Computation (CEC), pp. 658-665, Willington, New Zealand, Jun. 11-13, 2019.

Full text: Official version; Unedited version / Presentation slides

Abstract

Crossover is one of the most important parts of an evolutionary algorithm (EA) for solving optimization problems. Many crossover operators have been proposed for solving the capacitated vehicle routing problem (CVRP), a classical NP-hard problem in the field of operations research. This paper aims to improve the search ability of the cycle crossover (CX). The longest cycle selection and the nearest neighbor heuristic are utilized to improve the performance. Experimental results show that the proposed heuristic longest cycle crossover (HLCX) outperforms the original CX and four other operators. Additionally, we apply a search reduction strategy in the local refinement procedure to reduce the computation time at a little cost of solution quality.

Problem instances are from CVRPLIB.