DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/10722
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, Satyendra Kumar-
dc.contributor.authorRoutroy, Srikanta-
dc.date.accessioned2023-05-09T09:16:53Z-
dc.date.available2023-05-09T09:16:53Z-
dc.date.issued2018-
dc.identifier.urihttps://www.inderscience.com/info/inarticle.php?artid=94229-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10722-
dc.description.abstractThe vehicle routing problem is the most studied combinatorial optimisation problem. The purpose of this study is to provide an overview of the research to date in vehicle routing problem variants. The literature is reviewed with a focus on research in three major variants of the vehicle routing problem, namely capacitated vehicle routing problem, mixed depot vehicle routing problem and vehicle routing problem with pickup and delivery. Journal articles from three academic databases, namely Taylor and Francis, Elsevier and Emerald, are selected and reviewed. Ample literature is available on this problem so to restrict the scope, we screened the journal articles using the above mentioned variants precisely, excluding those that are in combination with other variants. This review takes a closer look at 117 research articles selected from various journals. By presenting the past literature, we hope to motivate further research in the field.en_US
dc.language.isoenen_US
dc.publisherInder Scienceen_US
dc.subjectManagementen_US
dc.subjectVehicle routing problemsen_US
dc.subjectVRPsen_US
dc.subjectLiterature reviewen_US
dc.titleVehicle routing problem: recent literature review of its variantsen_US
dc.typeArticleen_US
Appears in Collections:Department of Management

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.