Skip to main navigation Skip to search Skip to main content

Application of a novel discrete differential evolution algorithm to SVRP

  • Lingjuan Hou*
  • , Zhijiang Hou
  • , Hong Zhou
  • *Corresponding author for this work
  • Tianjin Normal University
  • Baidu Inc

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In order to propose a novel discrete differential evolution algorithm for stochastic vehicle routing problems (SVRP), the two bitwise operators of the computer language are introduced. In the algorithm, the individuals are represented as natural numbers, and new mutation and revised operators are developed for this representation. Computational simulations and comparisons based on Benchmark Problem of VRP and a larger-sized problem of SVRP. Results demonstrate that not only the proposed algorithm obtains better results than the basic differential evolution algorithm (DE) and the existing genetic algorithm (GA), but also it converges much faster.

Original languageEnglish
Title of host publicationProceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
Pages141-145
Number of pages5
DOIs
StatePublished - 2012
Event2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012 - Harbin, Heilongjiang, China
Duration: 23 Jun 201226 Jun 2012

Publication series

NameProceedings of the 2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012

Conference

Conference2012 5th International Joint Conference on Computational Sciences and Optimization, CSO 2012
Country/TerritoryChina
CityHarbin, Heilongjiang
Period23/06/1226/06/12

Keywords

  • Bitwise operator
  • Combinatorial optimization problems
  • Discrete differential evolution algorithm
  • Vehicle routing problems

Fingerprint

Dive into the research topics of 'Application of a novel discrete differential evolution algorithm to SVRP'. Together they form a unique fingerprint.

Cite this