A Cellular Genetic Algorithm for solving the vehicle routing problem with time windows

Iman Kamkar, Mahdieh Poostchi, Mohammad Reza Akbarzadeh Totonchi

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Researchpeer-review

12 Citations (Scopus)

Abstract

Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overlapped neighborhoods. Such kind of structured algorithms is well suited for complex problems. In this paper, a cGA for solving the vehicle routing problem with time windows (VRPTW) is proposed. The benchmark of Solomon is selected for testing the proposed cGAs, and compares them with some other heuristics in the literature. The results demonstrate that the proposed cGA has a good potential for solving this kind of problems.

Original languageEnglish
Title of host publicationAdvances in Intelligent and Soft Computing
Pages263-270
Number of pages8
DOIs
Publication statusPublished - 2010
EventOnline World Conference on Soft Computing in Industrial Applications 2009 - Online, Japan
Duration: 17 Nov 200929 Nov 2009
Conference number: 14th

Publication series

NameAdvances in Intelligent and Soft Computing
Volume75
ISSN (Print)1867-5662
ISSN (Electronic)1860-0794

Conference

ConferenceOnline World Conference on Soft Computing in Industrial Applications 2009
Abbreviated titleWSC 2009
Country/TerritoryJapan
CityOnline
Period17/11/0929/11/09

Cite this