On-Demand Customized Bus Line Optimization in Large-Scale Traffic Networks: A Column Generation Approach

As travel demand becomes more diversified and personalized, traditional bus operation struggles to meet the requirements of high-quality service. The customized bus, with its flexibility, has garnered significant attention. However, optimizing customized bus lines involves multiple decision variables. As the scale of transportation networks continues to expand, traditional methods struggle to find the optimal solution within a limited time. In this paper, we propose an innovative customized bus line optimization model and an efficient solving algorithm. In terms of modeling, we aim to maximize the number of passengers served by jointly optimizing bus routes, stop locations, departure time, and service capacity, while considering various constraints such as tolerance time to ensure the service efficiency of customized buses. Since the problem is intractable by exhaustive search, we design a column generation-based algorithm to acquire the optimal solution efficiently. We compare the proposed algorithm with direct solving using the Gurobi solver in small-scale, medium-scale, and large-scale scenarios. The experimental results show that the proposed algorithm can effectively find the optimal solution, even in the large-scale scenario where the Gurobi solver fails to deliver a solution.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-10-09
DOI
https://doi.org/10.1109/jiot.2025.3619524
Primary Topic
Power Line Communications and Noise
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On-Demand Customized Bus Line Optimization in Large-Scale Traffic Networks: A Column Generation Approach

Hao Huang, Ruimin Song, Hang Li, Xiaohua Xu et al.
IEEE Internet of Things Journal
Power Line Communications and Noise
article

On-Demand Customized Bus Line Optimization in Large-Scale Traffic Networks: A Column Generation Approach

Hao Huang, Ruimin Song, Hang Li, Xiaohua Xu, Xiaofei Hu
article en

Abstract

As travel demand becomes more diversified and personalized, traditional bus operation struggles to meet the requirements of high-quality service. The customized bus, with its flexibility, has garnered significant attention. However, optimizing customized bus lines involves multiple decision variables. As the scale of transportation networks continues to expand, traditional methods struggle to find the optimal solution within a limited time. In this paper, we propose an innovative customized bus line optimization model and an efficient solving algorithm. In terms of modeling, we aim to maximize the number of passengers served by jointly optimizing bus routes, stop locations, departure time, and service capacity, while considering various constraints such as tolerance time to ensure the service efficiency of customized buses. Since the problem is intractable by exhaustive search, we design a column generation-based algorithm to acquire the optimal solution efficiently. We compare the proposed algorithm with direct solving using the Gurobi solver in small-scale, medium-scale, and large-scale scenarios. The experimental results show that the proposed algorithm can effectively find the optimal solution, even in the large-scale scenario where the Gurobi solver fails to deliver a solution.

IEEE Internet of Things JournalVol. 12(24)
Chongqing University of Posts and Telecommunications (CN), Yanbian University (CN), Zhaotong University (CN)
Openalex Percentile: Top 72%
Power Line Communications and Noise
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.