Solving Multiple Depot Vehicle Routing Problem (MDVRP) using Genetic Algorithm

Simple item page
dc.contributor.authorMahmud, Nafiz
dc.contributor.authorHaque, Md. Mokammel
dc.date.accessioned2026-07-06T21:14:19Z
dc.date.available2026-07-06T21:14:19Z
dc.date.issued7-Feb-2019
dc.description.abstractVehicle Routing Problem is a NP-Hard classical
dc.description.abstractcomplex combinatorial problem described as task of
dc.description.abstractdetermining efficient and shortest delivery or pickup routes
dc.description.abstractto service several customers scattered in different
dc.description.abstractgeographical regions with a fleet of vehicles with additional
dc.description.abstractpredefined constraints to satisfy real-life scenarios. Vehicle
dc.description.abstractRouting Problem has wide applications in Logistics and
dc.description.abstractTransportation with growing economic importance. In
dc.description.abstractSolutions of Vehicle Routing Problem maintaining the
dc.description.abstractdefined restrictions is of high Interest. Exact solutions of
dc.description.abstractVehicle Routing Problem can’t be obtained due
dc.description.abstractrequirement of high computation time. Due to Genetic
dc.description.abstractAlgorithm’s stochastic characteristics and efficiency in
dc.description.abstractsolving combinatorial problems it is used to find true and
dc.description.abstractapproximate solutions of Vehicle Routing Problem. For
dc.description.abstractconstrained variants of Vehicle Routing Problem feasible
dc.description.abstractspace is smaller than whole search space and Genetic
dc.description.abstractAlgorithm finds a solution with high precision that doesn’t
dc.description.abstractviolate any of the constraints.
dc.identifier.otherhttp://103.99.128.19:8080/jspui/handle/123456789/318
dc.identifier.urihttp://103.99.128.19:8080/xmlui/handle/123456789/318
dc.publisherFaculty of Electrical and Computer Engineering, CUET
dc.sourceCUET Digital Repository
dc.subjectGenetic Algorithms
dc.subjectLocal Heuristics
dc.subjectMultiple Depot VRP
dc.subjectMBCRC Crossover
dc.subjectInter-Depot Mutation
dc.titleSolving Multiple Depot Vehicle Routing Problem (MDVRP) using Genetic Algorithm
dc.title.alternativeInternational Conference on Electrical, Computer and Communication Engineering (ECCE-2019)

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Solving Multiple Depot Vehicle Routing Problem.pdf
Size:
798.04 KB
Format:
Adobe Portable Document Format
Download

Collections

proceedings in CSE