Volume 8 Number 9 (Sep. 2013)
Home > Archive > 2013 > Volume 8 Number 9 (Sep. 2013) >
JCP 2013 Vol.8(9): 2256-2261 ISSN: 1796-203X
doi: 10.4304/jcp.8.9.2256-2261

Research on the Vehicle Routing Problem with Time Windows Using Firefly Algorithm

Fengshan Pan1, Chunming Ye1, Kefeng Wang2, and Jiangbo Cao1
1 Business School , University of Shanghai for Science and Technology, Shanghai, China.
2 School of Energy Science and Engineering, Henan Polytechnic University, Jiaozuo, China.


Abstract—As a key factor of logistics distribution, vehicle routing problem (VRP) is a hot research topic in management and computation science. In this paper the principle and algorithm process of firefly algorithm are introduced in detail. Then the algorithm process and solving steps are designed for vehicle routing problem with time windows (VRPTW), including the coding and design of disturbance mechanism of elicit fireflies. In the end, the testing examples from benchmark and other literatures are conducted with good outputs, which prove the validity of the firefly algorithm for VRP.

Index Terms—vehicle routing problem; time windows; firefly algorithm; optimization

[PDF]

Cite: Fengshan Pan, Chunming Ye, Kefeng Wang, and Jiangbo Cao, " Research on the Vehicle Routing Problem with Time Windows Using Firefly Algorithm," Journal of Computers vol. 8, no. 9, pp. 2256-2261, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>