Skip to main navigation Skip to search Skip to main content

A hybrid genetic algorithm for vehicle routing problems with dynamic requests

  • University of Science and Technology of China

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

Abstract

In this paper, a hybrid Genetic Algorithm (GA) is proposed to solve the Vehicle Routing Problems with Dynamic Requests (VRPDR). The proposed hybrid GA primarily involves the following parts. First, a greedy split is introduced, which is fit for the VRPDR. Second, the adjacent-exchange-based local search is proposed. Third, a novel mutation operator, named the insert mutation, is proposed. The experimental results show that the proposed hybrid GA is effective.

Original languageEnglish
Title of host publication2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-8
Number of pages8
ISBN (Electronic)9781538627259
DOIs
StatePublished - 1 Jul 2017
Externally publishedYes
Event2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Honolulu, United States
Duration: 27 Nov 20171 Dec 2017

Publication series

Name2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings
Volume2018-January

Conference

Conference2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017
Country/TerritoryUnited States
CityHonolulu
Period27/11/171/12/17

Keywords

  • Dynamic Vehicle Routing
  • Genetic Algorithm
  • Local Search
  • Split Algorithm

Fingerprint

Dive into the research topics of 'A hybrid genetic algorithm for vehicle routing problems with dynamic requests'. Together they form a unique fingerprint.

Cite this