Improved ant colony optimization for solving dial-a-ride-problem
The dial-a-ride problem (DARP) is a combinatorial optimization problem in which passengers claim requests in the form of their departure location, destination and the specific time windows during which they must be picked up and dropped off. A certain number of vehicles are assigned to serve these r...
Saved in:
Main Author: | Peng, Guohao |
---|---|
Other Authors: | Keveh Azizan |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/73130 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Solving dial-a-ride problem using ant colony optimisation
by: Kolumam Anantharamakrishnan Krishnamurthy
Published: (2018) -
Solving time-dependent dial-a-ride problem using modified ant colony optimization
by: Koh, Hong Wei
Published: (2018) -
Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation
by: Tripathy, Twinkle, et al.
Published: (2020) -
Deterministic annealing for depot optimization : applications to the dial-a-ride problem
by: Pandi, Ramesh Ramasamy, et al.
Published: (2020) -
Efficiency analysis of tabu search heuristic for static dial-a-ride problem
by: Ho, Song Guang
Published: (2018)