Deterministic annealing for depot optimization : applications to the dial-a-ride problem
This paper introduces a novel meta-heuristic approach to optimize depot locations for multi-vehicle shared mobility systems. Dial-a-ride problem (DARP) is considered as a case study here, in which routing and scheduling for door to- door passenger transportation are performed while satisfying severa...
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/144433 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Adaptive algorithm for dial-a-ride problem with vehicle breakdown
by: Pandi, Ramesh Ramasamy, et al.
Published: (2020) -
Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation
by: Tripathy, Twinkle, et al.
Published: (2020) -
Real-time adaptive algorithms for dial-a-ride problems
by: Pandi, Ramesh Ramasamy
Published: (2020) -
Depot antipsychotic use in schizophrenia: An East Asian perspective
by: Sim, K., et al.
Published: (2012) -
A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots
by: XU, Zhou, et al.
Published: (2010)