Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation

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...

Full description

Bibliographic Details
Main Authors: Tripathy, Twinkle, Nagavarapu, Sarat Chandra, Azizian, Kaveh, Pandi, Ramesh Ramasamy, Dauwels, Justin
Other Authors: School of Electrical and Electronic Engineering
Format: Conference Paper
Language:English
Published: 2020
Subjects:
Engineering::Electrical and electronic engineering
Dial-a-ride Problem
Fleet Size Minimisation
Online Access:https://hdl.handle.net/10356/140330

Internet

https://hdl.handle.net/10356/140330

Similar Items