Pickup and delivery problem using metaheuristics techniques

Simple item page
dc.contributor.authorD'Souza, C.
dc.contributor.authorOmkar, S.N.
dc.contributor.authorSenthilnath, J.
dc.date.accessioned2026-02-05T09:35:33Z
dc.date.issued2012
dc.description.abstractDial-a-ride problem (DARP) is an optimization problem which deals with the minimization of the cost of the provided service where the customers are provided a door-to-door service based on their requests. This optimization model presented in earlier studies, is considered in this study. Due to the non-linear nature of the objective function the traditional optimization methods are plagued with the problem of converging to a local minima. To overcome this pitfall we use metaheuristics namely Simulated Annealing (SA), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Artificial Immune System (AIS). From the results obtained, we conclude that Artificial Immune System method effectively tackles this optimization problem by providing us with optimal solutions. © 2011 Published by Elsevier Ltd. All rights reserved.
dc.identifier.citationExpert Systems with Applications, 2012, 39, 1, pp. 328-334
dc.identifier.issn9574174
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2011.07.022
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/27112
dc.subjectArtificial Immune System
dc.subjectDial-a-ride problem
dc.subjectLocal minimums
dc.subjectMeta heuristics
dc.subjectMetaheuristic
dc.subjectObjective functions
dc.subjectOptimal solutions
dc.subjectOptimization method
dc.subjectOptimization models
dc.subjectOptimization problems
dc.subjectParticle swarm
dc.subjectPickup and delivery problems
dc.subjectService-based
dc.subjectGenetic algorithms
dc.subjectHeuristic algorithms
dc.subjectImmunology
dc.subjectSimulated annealing
dc.subjectParticle swarm optimization (PSO)
dc.titlePickup and delivery problem using metaheuristics techniques

Files

Collections

Journal Articles