Skip to content

An Evolutionary Algorithm with Heuristic Longest Cycle Crossover for Solving the Capacitated Vehicle Routing Problem

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Visutarrom, T., & Chiang, T. C. (2019). An Evolutionary Algorithm with Heuristic Longest Cycle Crossover for Solving the Capacitated Vehicle Routing Problem. In 2019 IEEE Congress on Evolutionary Computation, CEC 2019 - Proceedings (pp. 673–680). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/CEC.2019.8789946

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free