A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem
In the real world, the vehicle routing problem (VRP) is dynamic and variable, so dynamic vehicle routing problem (DVRP) has obtained more and more attentions among researchers. Meanwhile, due to actual constraints of service hours and service distances, logistics companies usually build multiple dep...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2018/3624728 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832565589568126976 |
|---|---|
| author | Haitao Xu Pan Pu Feng Duan |
| author_facet | Haitao Xu Pan Pu Feng Duan |
| author_sort | Haitao Xu |
| collection | DOAJ |
| description | In the real world, the vehicle routing problem (VRP) is dynamic and variable, so dynamic vehicle routing problem (DVRP) has obtained more and more attentions among researchers. Meanwhile, due to actual constraints of service hours and service distances, logistics companies usually build multiple depots to serve a great number of dispersed customers. Thus, the research of dynamic multidepot vehicle routing problem (DMDVRP) is significant and essential. However, it has not attracted much attention. In this paper, firstly, a clustering approach based on the nearest distance is proposed to allocate all customers to the depots. Then a hybrid ant colony optimization (HACO) with mutation operation and local interchange is introduced to optimize vehicle routes. In addition, in order to deal with dynamic problem of DMDVRP quickly, a real-time addition and optimization approach is designed to handle the new customer requests. Finally, the t-test is applied to evaluate the proposed algorithm; meanwhile the relations between degrees of dynamism (dod) and HACO are discussed minutely. Experimental results show that the HACO algorithm is feasible and efficient to solve DMDVRP. |
| format | Article |
| id | doaj-art-77af8e887518418db5a93bed32e04783 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-77af8e887518418db5a93bed32e047832025-02-03T01:07:12ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2018-01-01201810.1155/2018/36247283624728A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing ProblemHaitao Xu0Pan Pu1Feng Duan2School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaSchool of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, ChinaIn the real world, the vehicle routing problem (VRP) is dynamic and variable, so dynamic vehicle routing problem (DVRP) has obtained more and more attentions among researchers. Meanwhile, due to actual constraints of service hours and service distances, logistics companies usually build multiple depots to serve a great number of dispersed customers. Thus, the research of dynamic multidepot vehicle routing problem (DMDVRP) is significant and essential. However, it has not attracted much attention. In this paper, firstly, a clustering approach based on the nearest distance is proposed to allocate all customers to the depots. Then a hybrid ant colony optimization (HACO) with mutation operation and local interchange is introduced to optimize vehicle routes. In addition, in order to deal with dynamic problem of DMDVRP quickly, a real-time addition and optimization approach is designed to handle the new customer requests. Finally, the t-test is applied to evaluate the proposed algorithm; meanwhile the relations between degrees of dynamism (dod) and HACO are discussed minutely. Experimental results show that the HACO algorithm is feasible and efficient to solve DMDVRP.http://dx.doi.org/10.1155/2018/3624728 |
| spellingShingle | Haitao Xu Pan Pu Feng Duan A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem Discrete Dynamics in Nature and Society |
| title | A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem |
| title_full | A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem |
| title_fullStr | A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem |
| title_full_unstemmed | A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem |
| title_short | A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem |
| title_sort | hybrid ant colony optimization for dynamic multidepot vehicle routing problem |
| url | http://dx.doi.org/10.1155/2018/3624728 |
| work_keys_str_mv | AT haitaoxu ahybridantcolonyoptimizationfordynamicmultidepotvehicleroutingproblem AT panpu ahybridantcolonyoptimizationfordynamicmultidepotvehicleroutingproblem AT fengduan ahybridantcolonyoptimizationfordynamicmultidepotvehicleroutingproblem AT haitaoxu hybridantcolonyoptimizationfordynamicmultidepotvehicleroutingproblem AT panpu hybridantcolonyoptimizationfordynamicmultidepotvehicleroutingproblem AT fengduan hybridantcolonyoptimizationfordynamicmultidepotvehicleroutingproblem |