A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows
Nowadays, using a rental fleet to transport goods for delivering to customers at a particular time frame is very important in the services and industry. That is why, in this study, we consider the heterogeneous fixed fleet open vehicle routing problem with time windows, which is one version of the v...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-02-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/2/486 |
| _version_ | 1797618055538278400 |
|---|---|
| author | Zakir Hussain Ahmed Majid Yousefikhoshbakht |
| author_facet | Zakir Hussain Ahmed Majid Yousefikhoshbakht |
| author_sort | Zakir Hussain Ahmed |
| collection | DOAJ |
| description | Nowadays, using a rental fleet to transport goods for delivering to customers at a particular time frame is very important in the services and industry. That is why, in this study, we consider the heterogeneous fixed fleet open vehicle routing problem with time windows, which is one version of the vehicle routing problem with time windows. The problem has not attracted attention so much in the operational research literature than the usual vehicle routing problem. The problem consists of determining the minimum cost routes for a fleet of a fixed number of vehicles with various capacities in order to fulfil the demands of the customer population. Moreover, the vehicles start at the headquarters and terminate at one of the customers. In this study, we introduce a mixed integer programming model and then integrate an exact algorithm to solve this model. Furthermore, a hybrid algorithm (HA) based on modified rank-based ant system is developed and then its efficiency is compared with the exact method and some metaheuristic methods on some standard instances in literature. The results proved the effectiveness of our proposed HA. |
| first_indexed | 2024-03-11T08:04:48Z |
| format | Article |
| id | doaj.art-536934d484274d2886a9097fd176c023 |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-11T08:04:48Z |
| publishDate | 2023-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-536934d484274d2886a9097fd176c0232023-11-16T23:33:57ZengMDPI AGSymmetry2073-89942023-02-0115248610.3390/sym15020486A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time WindowsZakir Hussain Ahmed0Majid Yousefikhoshbakht1Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, Saudi ArabiaDepartment of Mathematics, Faculty of Sciences, Bu-Ali Sina University, Hamedan 6517838695, IranNowadays, using a rental fleet to transport goods for delivering to customers at a particular time frame is very important in the services and industry. That is why, in this study, we consider the heterogeneous fixed fleet open vehicle routing problem with time windows, which is one version of the vehicle routing problem with time windows. The problem has not attracted attention so much in the operational research literature than the usual vehicle routing problem. The problem consists of determining the minimum cost routes for a fleet of a fixed number of vehicles with various capacities in order to fulfil the demands of the customer population. Moreover, the vehicles start at the headquarters and terminate at one of the customers. In this study, we introduce a mixed integer programming model and then integrate an exact algorithm to solve this model. Furthermore, a hybrid algorithm (HA) based on modified rank-based ant system is developed and then its efficiency is compared with the exact method and some metaheuristic methods on some standard instances in literature. The results proved the effectiveness of our proposed HA.https://www.mdpi.com/2073-8994/15/2/486open vehicle routing problemheterogeneous fixed fleettime windowsmixed integer linear programmingrank-based ant system |
| spellingShingle | Zakir Hussain Ahmed Majid Yousefikhoshbakht A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows Symmetry open vehicle routing problem heterogeneous fixed fleet time windows mixed integer linear programming rank-based ant system |
| title | A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows |
| title_full | A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows |
| title_fullStr | A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows |
| title_full_unstemmed | A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows |
| title_short | A Hybrid Algorithm for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem with Time Windows |
| title_sort | hybrid algorithm for the heterogeneous fixed fleet open vehicle routing problem with time windows |
| topic | open vehicle routing problem heterogeneous fixed fleet time windows mixed integer linear programming rank-based ant system |
| url | https://www.mdpi.com/2073-8994/15/2/486 |
| work_keys_str_mv | AT zakirhussainahmed ahybridalgorithmfortheheterogeneousfixedfleetopenvehicleroutingproblemwithtimewindows AT majidyousefikhoshbakht ahybridalgorithmfortheheterogeneousfixedfleetopenvehicleroutingproblemwithtimewindows AT zakirhussainahmed hybridalgorithmfortheheterogeneousfixedfleetopenvehicleroutingproblemwithtimewindows AT majidyousefikhoshbakht hybridalgorithmfortheheterogeneousfixedfleetopenvehicleroutingproblemwithtimewindows |