A discrete Jaya algorithm for vehicle routing problems with uncertain demands
Vehicle Routing Problem with Uncertain Demands (VRPUD) is one of the research hotspots in the field of logistics scheduling. In this paper, a Discrete Jaya (DJaya) algorithm is presented for the VRPUD to minimize the total cost. A novel dividing-point-based coding scheme is designed to represent sol...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-12-01
|
| Series: | Systems Science & Control Engineering |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/21642583.2024.2350165 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850251172151033856 |
|---|---|
| author | Jing Zhang Jing-Xuan Ye Jian Lin Hong-Bo Song |
| author_facet | Jing Zhang Jing-Xuan Ye Jian Lin Hong-Bo Song |
| author_sort | Jing Zhang |
| collection | DOAJ |
| description | Vehicle Routing Problem with Uncertain Demands (VRPUD) is one of the research hotspots in the field of logistics scheduling. In this paper, a Discrete Jaya (DJaya) algorithm is presented for the VRPUD to minimize the total cost. A novel dividing-point-based coding scheme is designed to represent solutions with higher robustness. In addition, an efficient repair strategy is embedded into the decoding process to avoid the failure of producing feasible solutions. The best and worst solutions are employed to generate offspring solutions in DJaya. Several efficient local search methods are also presented to enhance the exploitation ability and increase the diversity of solutions. Based on the benchmark data sets of the VRPUD, numerical simulations are carried out for the proposed DJaya algorithm with uncertain demands. Computational results and comparisons with the state-of-the-art algorithms demonstrate the superiority of the proposed algorithm in solving VRPUD. |
| format | Article |
| id | doaj-art-34d4c3732517454ab95cacff95093f04 |
| institution | OA Journals |
| issn | 2164-2583 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Systems Science & Control Engineering |
| spelling | doaj-art-34d4c3732517454ab95cacff95093f042025-08-20T01:57:59ZengTaylor & Francis GroupSystems Science & Control Engineering2164-25832024-12-0112110.1080/21642583.2024.2350165A discrete Jaya algorithm for vehicle routing problems with uncertain demandsJing Zhang0Jing-Xuan Ye1Jian Lin2Hong-Bo Song3Department of Computer and Information Security, Zhejiang Police College, Hangzhou, People’s Republic of ChinaSchool of Information Technology and Artificial Intelligence, Zhejiang University of Finance and Economics, Hangzhou, People’s Republic of ChinaSchool of Information Technology and Artificial Intelligence, Zhejiang University of Finance and Economics, Hangzhou, People’s Republic of ChinaCollege of Information Science and Technology, Zhejiang Shuren University, Hangzhou, People’s Republic of ChinaVehicle Routing Problem with Uncertain Demands (VRPUD) is one of the research hotspots in the field of logistics scheduling. In this paper, a Discrete Jaya (DJaya) algorithm is presented for the VRPUD to minimize the total cost. A novel dividing-point-based coding scheme is designed to represent solutions with higher robustness. In addition, an efficient repair strategy is embedded into the decoding process to avoid the failure of producing feasible solutions. The best and worst solutions are employed to generate offspring solutions in DJaya. Several efficient local search methods are also presented to enhance the exploitation ability and increase the diversity of solutions. Based on the benchmark data sets of the VRPUD, numerical simulations are carried out for the proposed DJaya algorithm with uncertain demands. Computational results and comparisons with the state-of-the-art algorithms demonstrate the superiority of the proposed algorithm in solving VRPUD.https://www.tandfonline.com/doi/10.1080/21642583.2024.2350165Jaya algorithmvehicle routing problemuncertain demandlocal search |
| spellingShingle | Jing Zhang Jing-Xuan Ye Jian Lin Hong-Bo Song A discrete Jaya algorithm for vehicle routing problems with uncertain demands Systems Science & Control Engineering Jaya algorithm vehicle routing problem uncertain demand local search |
| title | A discrete Jaya algorithm for vehicle routing problems with uncertain demands |
| title_full | A discrete Jaya algorithm for vehicle routing problems with uncertain demands |
| title_fullStr | A discrete Jaya algorithm for vehicle routing problems with uncertain demands |
| title_full_unstemmed | A discrete Jaya algorithm for vehicle routing problems with uncertain demands |
| title_short | A discrete Jaya algorithm for vehicle routing problems with uncertain demands |
| title_sort | discrete jaya algorithm for vehicle routing problems with uncertain demands |
| topic | Jaya algorithm vehicle routing problem uncertain demand local search |
| url | https://www.tandfonline.com/doi/10.1080/21642583.2024.2350165 |
| work_keys_str_mv | AT jingzhang adiscretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT jingxuanye adiscretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT jianlin adiscretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT hongbosong adiscretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT jingzhang discretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT jingxuanye discretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT jianlin discretejayaalgorithmforvehicleroutingproblemswithuncertaindemands AT hongbosong discretejayaalgorithmforvehicleroutingproblemswithuncertaindemands |