The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
An Improved Genetic Algorithm for Solving Multi Depot Vehicle Routing Problems
Abstract
The classical Vehicle Routing Problem (VRP) tries to minimise the cost of dispatching goods from depots to customers using vehicles with limited carrying capacity. As a generalisation of the TSP, the problem is known to be NP-hard and several authors have proposed heuristics and meta-heuristics for obtaining good solutions. The authors present genetic algorithm-based approaches for solving the problem and compare the results with available results from other papers, in particular, the hybrid clustering based genetic algorithm. The authors find that the proposed methods give encouraging results on all these instances. The approach can be extended to solve multi depot VRPs with heterogeneous fleet of vehicles.
Related Content
|
Shailendra Aote, Mukesh M. Raghuwanshi.
© 2021.
34 pages.
|
|
Anjana Mishra, Bighnaraj Naik, Suresh Kumar Srichandan.
© 2021.
15 pages.
|
|
Thendral Puyalnithi, Madhuviswanatham Vankadara.
© 2021.
15 pages.
|
|
Geng Zhang, Xiansheng Gong, Xirui Chen.
© 2021.
13 pages.
|
|
Jhuma Ray, Siddhartha Bhattacharyya, N. Bhupendro Singh.
© 2021.
19 pages.
|
|
Pijush Samui, Viswanathan R., Jagan J., Pradeep U. Kurup.
© 2021.
18 pages.
|
|
Ravinesh C. Deo, Sujan Ghimire, Nathan J. Downs, Nawin Raj.
© 2021.
32 pages.
|
|
|