Pickup and delivery problem using metaheuristics techniques

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.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.identifier.citation	Expert Systems with Applications, 2012, Vol.39, 1, pp.328-334	en_US
dc.identifier.uri	https://idr.nitk.ac.in/handle/123456789/12552
dc.title	Pickup and delivery problem using metaheuristics techniques	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1