A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem

24Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The capacitated vehicle routing problem (CVRP) is the most classical vehicle routing problem (VRP); many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA) with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given. © 2013 Ligang Cui et al.

Cite

CITATION STYLE

APA

Cui, L., Wang, L., Deng, J., & Zhang, J. (2013). A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/159495

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