2008 4th International Conference on Wireless Communications, Networking and Mobile Computing 2008
DOI: 10.1109/wicom.2008.1951
|View full text |Cite
|
Sign up to set email alerts
|

Research on Bus Scheduling Based on Artificial Immune Algorithm

Abstract: After analysis of the data from Dalian bus IC card database, the paper propose an optimization algorithm for bus scheduling. By introducing an artificial immune algorithm based on information entropy, the optimal or the quasi-optimal solution to this multi-variable and non-linear problem of bus scheduling can be found efficiently. The experiment results demonstrate that the optimal bus departure intervals under different time periods can be obtained to adjust bus timetable conveniently, which help to adjust bu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…It is to find an optimal solution that satisfies the proposed objective function in the solution space that satisfies the scheduling constraints. Many algorithms have been used for the dispatching system of public transit vehicles, such as ACO [53], GA [54,55], and Immune Algorithms (IA) [56].…”
Section: Dispatching System Of Public Transit Vehiclesmentioning
confidence: 99%
“…It is to find an optimal solution that satisfies the proposed objective function in the solution space that satisfies the scheduling constraints. Many algorithms have been used for the dispatching system of public transit vehicles, such as ACO [53], GA [54,55], and Immune Algorithms (IA) [56].…”
Section: Dispatching System Of Public Transit Vehiclesmentioning
confidence: 99%
“…So, it is suitable for solving this kind of large-scale optimization problem. In recent years, more and more researchers have applied metaheuristic algorithms to bus scheduling [36][37][38], which proves their effectiveness in solving such problems.…”
Section: Introductionmentioning
confidence: 99%
“…So me [1] treated it as single objective optimization problem while others [2][3][4][5] treated it as mu ltip le object ives problem. So me made research on single depot scheduling [6] and others focused on mult idepot problem [7].…”
Section: Introductionmentioning
confidence: 99%
“…So me made research on single depot scheduling [6] and others focused on mult idepot problem [7]. Zh iwei Yang, Shengchuan Zhao and Qian Zhao [2] considered both profit of both passengers and bus carriers and converted the problem into a single objective one by linear co mbination of d ifferent objectives as a weighted sum. M ing Wei, Wenzhou Jin, Weiwei FU and Xiaoni Hao [3] proposed the multi-depot bus scheduling problem with route time constraints, which goal is to minimize the number of vehicles, deadhead and wait ing time.…”
Section: Introductionmentioning
confidence: 99%