An Improved Genetic Algorithm for Solving Multi Depot Vehicle Routing Problems

Varimna Singh, L. Ganapathy and Ashok K. Pundir
Additional contact information
Varimna Singh: Som Lalit Institute of Management Studies, Ahmedabad, India
L. Ganapathy: National Institute of Industrial Engineering, Mumbai, India
Ashok K. Pundir: National Institute of Industrial Engineering, Mumbai, India

International Journal of Information Systems and Supply Chain Management (IJISSCM), 2019, vol. 12, issue 4, 1-26

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.

Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 8/IJISSCM.2019100101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jisscm:v:12:y:2019:i:4:p:1-26

Access Statistics for this article

International Journal of Information Systems and Supply Chain Management (IJISSCM) is currently edited by John Wang

More articles in International Journal of Information Systems and Supply Chain Management (IJISSCM) from IGI Global
Bibliographic data for series maintained by Journal Editor ().