Please use this identifier to cite or link to this item:
Title: Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation
Authors: Tripathy, Twinkle
Nagavarapu, Sarat Chandra
Azizian, Kaveh
Pandi, Ramesh Ramasamy
Dauwels, Justin
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2017
Source: Tripathy, T., Nagavarapu, S. C., Azizian, K., Pandi, R. R., & Dauwels, J. (2018). Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation. Proceedings of 17th UK Workshop on Computational Intelligence, 325-336. doi:10.1007/978-3-319-66939-7_28
Abstract: 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.
ISBN: 9783319669380
DOI: 10.1007/978-3-319-66939-7_28
Rights: © 2018 Springer International Publishing AG. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Conference Papers

Citations 50

Updated on Jan 24, 2023

Web of ScienceTM
Citations 50

Updated on Jan 21, 2023

Page view(s)

Updated on Jan 27, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.