An advanced approach for vehicle routing problem with time windows

C. Y. Lee, S. W. Lin, K. C. Ying, M. R. Yang

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

Abstract

In this paper, an advanced approach is proposed for vehicle routing problems with time windows (VRPTW). It takes the advantages of fuzzy c-means (FCM), simulated annealing, and tabu search for VRPTW. The Solomon's problem instances are used for verifying the developed approach. Based on the number of vehicles required and the traveling distance, good results are obtained when the number of customers is equal to 25. From simulation results, the developed approach finds the average number of vehicles and route costs are better than or equal to those of previous researches. The proposed approach can be used to solve the VRPTW and its search performance is admirable.

Original languageEnglish
Title of host publicationProceeding - 6th International Conference on Networked Computing and Advanced Information Management, NCM2010
Pages408-411
Number of pages4
StatePublished - 2010
Event6th International Conference on Networked Computing and Advanced Information Management, NCM2010 - Seoul, Korea, Republic of
Duration: 16 08 201018 08 2010

Publication series

NameProceeding - 6th International Conference on Networked Computing and Advanced Information Management, NCM 2010

Conference

Conference6th International Conference on Networked Computing and Advanced Information Management, NCM2010
Country/TerritoryKorea, Republic of
CitySeoul
Period16/08/1018/08/10

Fingerprint

Dive into the research topics of 'An advanced approach for vehicle routing problem with time windows'. Together they form a unique fingerprint.

Cite this