Adaptive algorithm for dial-a-ride problem with vehicle breakdown
Vehicle breakdown in a centralized fleet operation can inflict large recovery costs and may damage service provider's reputation. We consider the disrupted dial-a-ride problem (DARP), where vehicle breakdown can occur at any point of time during the transportation service. The conventional meth...
Saved in:
Main Authors: | Pandi, Ramesh Ramasamy, Ho, Song Guang, Nagavarapu, Sarat Chandra, 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/142297 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
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) -
Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation
by: Tripathy, Twinkle, et al.
Published: (2020) -
Efficiency analysis of tabu search heuristic for static dial-a-ride problem
by: Ho, Song Guang
Published: (2018) -
Solving dial-a-ride problem using ant colony optimisation
by: Kolumam Anantharamakrishnan Krishnamurthy
Published: (2018)