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!
|