A multi-objective simulated annealing for the multi-criteria dial a ride problem

The paper describes a multi-objective mathematical model for Dial a Ride Problem (DRP) and an application of Multi-Objective Simulated Annealing (MOSA) to solve it. DRP is to take over the passenger from a place of departure to a place of arrival. In the DRP, customers send transportation requests t...

Full description

Saved in:
Bibliographic Details
Published in:Engineering applications of artificial intelligence 2012-09, Vol.25 (6), p.1121-1131
Main Authors: Zidi, Issam, Mesghouni, Khaled, Zidi, Kamel, Ghedira, Khaled
Format: Article
Language:English
Subjects:
Approximation
Arrivals
Dial a ride problem
Dials
Expert systems
Heuristics
Mathematical models
Multi-criteria optimization
Multi-objective simulated annealing algorithm
Passenger transportation
Position (location)
Simulated annealing
Transportation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper describes a multi-objective mathematical model for Dial a Ride Problem (DRP) and an application of Multi-Objective Simulated Annealing (MOSA) to solve it. DRP is to take over the passenger from a place of departure to a place of arrival. In the DRP, customers send transportation requests to an operator. A request consists of a specified pickup location and destination location along with a desired departure or arrival time. The ultimate aim is to offer an alternative to displacement optimized individually and collectively. The DRP is classified as NP-hard problem that's why most research has been concentrated on the use of approximate methods to solve it. Indeed the DRP is a multi-criteria problem, the proposed solution of which aims to reduce both route duration in response to a certain quality of service provided. In this work, we offer our contribution to the study and solving the DRP in the application using the MOSA algorithm. Tests show competitive results on (Cordeau and Laporte, 2003a) benchmark datasets while improving processing times.
ISSN:0952-1976
1873-6769
DOI:10.1016/j.engappai.2012.03.012