Pickup and delivery problem using metaheuristics techniques
No Thumbnail Available
Date
2012
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Artificial Immune System, Dial-a-ride problem, Local minimums, Meta heuristics, Metaheuristic, Objective functions, Optimal solutions, Optimization method, Optimization models, Optimization problems, Particle swarm, Pickup and delivery problems, Service-based, Genetic algorithms, Heuristic algorithms, Immunology, Simulated annealing, Particle swarm optimization (PSO)
Citation
Expert Systems with Applications, 2012, 39, 1, pp. 328-334