Skip to main navigation Skip to search Skip to main content

Solving dynamic vehicle routing problem with soft time window by iLNS and hPSO

  • Harbin Institute of Technology Shenzhen
  • Shenzhen Key Laboratory of Internet Information Collaboration

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

Abstract

Vehicle Routing Problem (VRP) is widely studied under the real logistics environments. For the reason that customers’ demands could appear dynamically and need to be served within fuzzy time windows, the dynamic vehicle routing problem with soft time windows (DVRPSTW) is studied in this paper. We use the improved large neighborhood search algorithm(iLNS) and the hybrid Particle Swarm Optimization(hPSO) to solve the problem. The performance of both algorithms comparing with benchmarks shows that our methods can solve DVRPSTW efficiently with more customers.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings
EditorsMinming Li, Lusheng Wang, T-H. Hubert Chan
PublisherSpringer Verlag
Pages702-709
Number of pages8
ISBN (Print)9783319487489
DOIs
StatePublished - 2016
Externally publishedYes
Event10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016 - Hong Kong, China
Duration: 16 Dec 201618 Dec 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10043 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016
Country/TerritoryChina
CityHong Kong
Period16/12/1618/12/16

Keywords

  • DVRPSTW
  • hPSO
  • iLNS

Fingerprint

Dive into the research topics of 'Solving dynamic vehicle routing problem with soft time window by iLNS and hPSO'. Together they form a unique fingerprint.

Cite this