Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Advances in Computational Intelligence SystemsSolving Dial-A-Ride Problems Using Multiple Ant Colony System with Fleet Size Minimisation

Advances in Computational Intelligence Systems: Solving Dial-A-Ride Problems Using Multiple Ant... [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Advances in Computational Intelligence SystemsSolving Dial-A-Ride Problems Using Multiple Ant Colony System with Fleet Size Minimisation

Loading next page...
 
/lp/springer-journals/advances-in-computational-intelligence-systems-solving-dial-a-ride-eEs0d9i8Y6

References (16)

Publisher
Springer International Publishing
Copyright
© Springer International Publishing AG 2018
ISBN
978-3-319-66938-0
Pages
325 –336
DOI
10.1007/978-3-319-66939-7_28
Publisher site
See Chapter on Publisher Site

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.]

Published: Sep 5, 2017

Keywords: Dial-a-ride problem; Fleet size minimisation; Ant colony optimisation

There are no references for this article.