Multi-objective Demand Responsive Transit Scheduling in Smart City: A Multiple Populations Ant Colony System Approach

Full text for this resource is not available from the Research Repository.

Du, Ke-Jing, Yang, Jia-Quan, Wang, Limin, Han, Xuming, Wang, Hua ORCID: 0000-0002-8465-0996 and Zhan, Zhi-Hui ORCID: 0000-0003-0862-0514 (2024) Multi-objective Demand Responsive Transit Scheduling in Smart City: A Multiple Populations Ant Colony System Approach. In: 2024 16th International Conference on Advanced Computational Intelligence (ICACI), 16 May 2024 - 19 May 2024, Zhangjiajie, China.

Abstract

The demand responsive transit (DRT) is a type of bus that does not have a fixed route and provides flexible travel services within a certain area range based on passengers' needs. Due to its service flexibility and cost economy, DRT has become an important component of smart city construction. Essentially, DRT is an NP-hard combinational optimization problem, and traditional deterministic methods are not suitable for solving practical DRT problems. At the same time, most existing studies concern minimizing operational costs as the main optimization objective, with insufficient consideration of passenger demand satisfaction. This article treats minimizing operational costs and minimizing penalty costs as two optimization objectives, so as to model the DRT as a multi-objective optimization problem. To solve the multi-objective DRT scheduling problem efficiently, this article follows the novel and efficient multiple populations for multiple objectives (MPMO) framework and proposes a multiple populations ant colony system (MPACS) approach. Two ant colony populations are used to optimize the two objectives (i.e., minimize operational costs and minimize penalty costs), and an information share mechanism is designed to achieve co-evolution between the two populations, thereby finding Pareto solutions for the multi-objective DRT problem. The proposed MPACS has been tested on five datasets and compared with the first-come-first-served greedy algorithm and the nearest neighbor greedy algorithm, verifying its effectiveness and efficiency in solving the multi-objective DRT problems.

Dimensions Badge

Altmetric Badge

Item type Conference or Workshop Item (Paper)
URI https://vuir.vu.edu.au/id/eprint/48720
DOI 10.1109/ICACI60820.2024.10537015
Official URL http://dx.doi.org/10.1109/icaci60820.2024.10537015
Subjects Current > FOR (2020) Classification > 4602 Artificial intelligence
Current > Division/Research > Institute for Sustainable Industries and Liveable Cities
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login