Dispatching of multiple Autonomous Intelligent Vehicles considering stochastic travel times by Genetic Algorithm

An assumption on deterministic travel times of the vehicles might not be realistic for the dispatching problem of multiple Autonomous Intelligent Vehicles (AIVs). Thus, this paper presents a more accurate approach to solve this problem by considering stochastic travel times of the vehicles. The prob...

Full description

Saved in:
Bibliographic Details
Published in2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV) pp. 454 - 459
Main Authors Nguyen, Minh Sang, Lee, Kee Jin, Hong, Jihoon
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2018
Online AccessGet full text

Cover

More Information
Summary:An assumption on deterministic travel times of the vehicles might not be realistic for the dispatching problem of multiple Autonomous Intelligent Vehicles (AIVs). Thus, this paper presents a more accurate approach to solve this problem by considering stochastic travel times of the vehicles. The problem is modeled as a stochastic combinatorial optimization (SCO) problem that aims to minimize the total travel time and balance the utilization time of AIVs. Genetic Algorithm (GA) is then used to provide near-optimal solutions for the SCO. The obtained near-optimal results are then compared with the ones using conventional ruled-based approaches. The results showed that the GA solver could outperform the conventional ruled-based approaches in both deterministic and stochastic testing scenarios.
DOI:10.1109/ICARCV.2018.8581260