A contribution to the modelling and the resolution of a multi-objective dial a ride problem Online publication date: Wed, 15-Apr-2015
by Issam Zidi; Kamel Zidi; Khaled Mesghouni; Khaled Ghedira
International Journal of Engineering Management and Economics (IJEME), Vol. 3, No. 1/2, 2012
Abstract: The paper describes a system for the solution of dial a ride problem (DRP). Dial a ride problem (DRP) is to take over the passenger from a place of departure to a place of arrival. It is characterised by a set of transport demands and a number of vehicles available. The ultimate aim is to offer an alternative to displacement optimised individually and collectively. The DRP is classified as NP-hard problem that is why most research has been concentrated on the use of approximate methods to solve it. Indeed, it is a multi-criteria problem, the proposed solution of which aims to reduce both route duration, and cost 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 simulated annealing algorithm. Tests show competitive results on Cordeau and Laporte (2003) benchmark datasets while improving processing times.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Engineering Management and Economics (IJEME):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook