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 pr...
Saved in:
Main Authors: | Tripathy, Twinkle, Nagavarapu, Sarat Chandra, Azizian, Kaveh, Pandi, Ramesh Ramasamy, Dauwels, Justin |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140330 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
by: Zhixing Luo, et al.
Published: (2020) -
Adaptive algorithm for dial-a-ride problem with vehicle breakdown
by: Pandi, Ramesh Ramasamy, et al.
Published: (2020) -
Deterministic annealing for depot optimization : applications to the dial-a-ride problem
by: Pandi, Ramesh Ramasamy, et al.
Published: (2020) -
Real-time adaptive algorithms for dial-a-ride problems
by: Pandi, Ramesh Ramasamy
Published: (2020) -
Conversion of the computerized fleet tracking system
by: Noriega, Louise, et al.
Published: (2010)