Please use this identifier to cite or link to this item:
Title: Improved ant colony optimization for solving dial-a-ride-problem
Authors: Peng, Guohao
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2018
Abstract: 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 requests while ensuring that the maximum capacities of vehicles are not exceeded and the maximum ride time constraints of passengers, if any, are not violated. In this thesis, an improved ant colony optimization (IACO) algorithm is proposed to address the dial-a-ride-problem. The proposed algorithm works by pre-processing the requests to eliminate the ones that are infeasible from the beginning. In order to select the requests, the algorithm considers factors like time windows, local heuristics and vehicle load. Also, an adjust function is introduced to improve the quality of solutions and chaotic perturbation is used to prevent premature convergence. Numerous simulations have been carried out to demonstrate the efficiency of the proposed algorithm.
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
PENG GUOHAO_2017.pdf
  Restricted Access
2.53 MBAdobe PDFView/Open

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.