Solving Dial-A-Ride Problems Using Multiple Ant Colony System with Fleet Size Minimisation
This paper proposes an ant colony optimization (ACO) based algorithm to minimise the fleet size required to solve dial-a-ride problem (DARP). In this work, a static multi-vehicle case of DARP is considered where routes of multiple vehicles are designed to serve customer requests which are known a priori. DARP necessitates the need of high quality algorithm to provide optimal feasible solutions. We employ an improved ACO algorithm called ant colony system (ACS) to solve DARP. The fleet minimisation is also achieved by using ACS. In summary, multiple ACS are employed to minimise the fleet size while generating feasible solutions for DARP. Furthermore, the theoretical results are also validated through simulations.
KeywordsDial-a-ride problem Fleet size minimisation Ant colony optimisation
- 1.Wilson, N.H., Sussman, J.M., Wong, H.K., Higonnet, T.: Scheduling algorithms for a dial-a-ride system. Massachusetts Institute of Technology, Urban Systems Laboratory (1971)Google Scholar
- 10.Dorigo, M., Stutzle, T.: Ant Colony Optimization. The MIT Press (2004)Google Scholar
- 11.Dorigo, M.: Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy (1992)Google Scholar
- 13.Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale (1999)Google Scholar
- 17.Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the ant system to the vehicle routing problem. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 285–296. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar