Please use this identifier to cite or link to this item:
https://idr.l1.nitk.ac.in/jspui/handle/123456789/12552
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | D'Souza, C. | - |
dc.contributor.author | Omkar, S.N. | - |
dc.contributor.author | Senthilnath, J. | - |
dc.date.accessioned | 2020-03-31T08:41:49Z | - |
dc.date.available | 2020-03-31T08:41:49Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Expert Systems with Applications, 2012, Vol.39, 1, pp.328-334 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/12552 | - |
dc.description.abstract | Dial-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.title | Pickup and delivery problem using metaheuristics techniques | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Journal Articles |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.