Five years of multi-depot vehicle routing problems

dc.contributor.authorJayarathna, N.
dc.contributor.authorLanel, J.
dc.contributor.authorJuman, Z.A.M.S.
dc.date.accessioned2023-03-31T05:27:24Z
dc.date.available2023-03-31T05:27:24Z
dc.date.issued2020
dc.description.abstractWith vast range of applications in real life situations, the Vehicle Routing Problems (VRPs) have been the subject of countless studies since the late 1950s. However, a more realistic version of the classical VRP, where the distribution of goods is done from several depots is the Multi-Depot Vehicle Routing Problem (MDVRP), which has been the central attraction of recent researches. The objective of this problem is to find the routes for vehicles to serve all the customers at a minimal cost in terms of the number of routes and the total distance travelled without violating the capacity and travel time constraints of the vehicles, and it is handled with a variety of assumptions and constraints in the existing literature. This survey reviews the current status of the MDVRP and discuss the future direction regarding this problem.en_US
dc.identifier.citationJayarathna, N., Lanel, J., & Juman, Z. A. M. S. (2020). Five years of multi-depot vehicle routing problems. Journal of Sustainable Development of Transport and Logistics, 5(2), 109-123., 2020en_US
dc.identifier.doi10.14254/jsdtl.2020.5-2.10en_US
dc.identifier.urihttp://dr.lib.sjp.ac.lk/handle/123456789/12645
dc.language.isoenen_US
dc.publisherJournal of Sustainable Development of Transport and Logisticsen_US
dc.subjectmulti-depot vehicle routing problem, exact methods, heuristic, meta-heuristic.en_US
dc.titleFive years of multi-depot vehicle routing problemsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
FIve years VRP.pdf
Size:
1016.78 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: