Pickup and delivery problem using metaheuristics techniques

Authors:
Craig D'souza;S. N. Omkar;J. Senthilnath
Affiliations:
Department of Computer Engineering, NITK, Surathkal, India;Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 2
Cited 0

The immune system, adaptation, and machine learning

Physica D
A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

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.