A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Journal of Engineering |
| Online Access: | http://dx.doi.org/10.1155/2016/5692792 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550288101212160 |
|---|---|
| author | Majid Yousefikhoshbakht Azam Dolatnejad Farzad Didehvar Farhad Rahmati |
| author_facet | Majid Yousefikhoshbakht Azam Dolatnejad Farzad Didehvar Farhad Rahmati |
| author_sort | Majid Yousefikhoshbakht |
| collection | DOAJ |
| description | In the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the depot after completing a service and the number of vehicles of each type is fixed and limited. Since this problem belongs to NP-hard problems, in this paper a compound heuristic algorithm called SISEC which includes sweep algorithm, insert, swap, and 2-opt moves, modified elite ant system (EAS), and column generation (CG) is applied to solve the HFFOVRP. We report computational results on 22 problems and solve each problem by using our SISEC. The results which were compared to the results of exact algorithms and the classic CG confirm that the proposed algorithm produces high quality solutions within an acceptable computation time. |
| format | Article |
| id | doaj-art-869ec92aeb0f471f98d374add0d4dfaa |
| institution | Kabale University |
| issn | 2314-4904 2314-4912 |
| language | English |
| publishDate | 2016-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Engineering |
| spelling | doaj-art-869ec92aeb0f471f98d374add0d4dfaa2025-02-03T06:07:10ZengWileyJournal of Engineering2314-49042314-49122016-01-01201610.1155/2016/56927925692792A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing ProblemMajid Yousefikhoshbakht0Azam Dolatnejad1Farzad Didehvar2Farhad Rahmati3Young Researchers & Elite Club, Islamic Azad University, Hamedan Branch, Hamedan 65181-15743, IranYoung Researchers & Elite Club, Islamic Azad University, Tehran North Branch, Tehran 19136-74711, IranDepartment of Mathematics and Computer Science, Amirkabir University of Technology, Tehran 15875-4413, IranDepartment of Mathematics and Computer Science, Amirkabir University of Technology, Tehran 15875-4413, IranIn the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), several different types of vehicles can be used to service the customers. The types of vehicles are different in terms of capacity, fixed cost, and variable cost. In this problem, the vehicles are not required to return to the depot after completing a service and the number of vehicles of each type is fixed and limited. Since this problem belongs to NP-hard problems, in this paper a compound heuristic algorithm called SISEC which includes sweep algorithm, insert, swap, and 2-opt moves, modified elite ant system (EAS), and column generation (CG) is applied to solve the HFFOVRP. We report computational results on 22 problems and solve each problem by using our SISEC. The results which were compared to the results of exact algorithms and the classic CG confirm that the proposed algorithm produces high quality solutions within an acceptable computation time.http://dx.doi.org/10.1155/2016/5692792 |
| spellingShingle | Majid Yousefikhoshbakht Azam Dolatnejad Farzad Didehvar Farhad Rahmati A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem Journal of Engineering |
| title | A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem |
| title_full | A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem |
| title_fullStr | A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem |
| title_full_unstemmed | A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem |
| title_short | A Modified Column Generation to Solve the Heterogeneous Fixed Fleet Open Vehicle Routing Problem |
| title_sort | modified column generation to solve the heterogeneous fixed fleet open vehicle routing problem |
| url | http://dx.doi.org/10.1155/2016/5692792 |
| work_keys_str_mv | AT majidyousefikhoshbakht amodifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT azamdolatnejad amodifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT farzaddidehvar amodifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT farhadrahmati amodifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT majidyousefikhoshbakht modifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT azamdolatnejad modifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT farzaddidehvar modifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem AT farhadrahmati modifiedcolumngenerationtosolvetheheterogeneousfixedfleetopenvehicleroutingproblem |