Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/12552
Full metadata record
DC FieldValueLanguage
dc.contributor.authorD'Souza, C.-
dc.contributor.authorOmkar, S.N.-
dc.contributor.authorSenthilnath, J.-
dc.date.accessioned2020-03-31T08:41:49Z-
dc.date.available2020-03-31T08:41:49Z-
dc.date.issued2012-
dc.identifier.citationExpert Systems with Applications, 2012, Vol.39, 1, pp.328-334en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12552-
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.en_US
dc.titlePickup and delivery problem using metaheuristics techniquesen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
12552.pdf559.82 kBAdobe PDFThumbnail
View/Open


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