2018
DOI: 10.1088/1757-899x/332/1/012020
|View full text |Cite
|
Sign up to set email alerts
|

Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(18 citation statements)
references
References 0 publications
0
18
0
Order By: Relevance
“…The experimental results use different data, have different performance times according to the number of data input. The time performance generated for processing in 3 cases of data according to the study [15] can be seen in Table 5. From the table it appears that relatively long time is needed to work on the problem of big-scale outlier detection.…”
Section: Results and Analysismentioning
confidence: 99%
“…The experimental results use different data, have different performance times according to the number of data input. The time performance generated for processing in 3 cases of data according to the study [15] can be seen in Table 5. From the table it appears that relatively long time is needed to work on the problem of big-scale outlier detection.…”
Section: Results and Analysismentioning
confidence: 99%
“…It is difficult to determine the dynamic response in between two dynamic friction coefficients without the use of metaheuristic methods such as genetic algorithm and PSO. ere is no significant difference between these two methods in small scale; however, differences are seen in medium and large scale where genetic algorithms can only produce feasible solutions that are nearly optimal, while the PSO algorithm has ease of implementation and also has high calculation accuracy [44]. erefore, system identification using the PSO method was proposed for model parameter identification of the extracted hysteresis model.…”
Section: Model Parameter Identificationmentioning
confidence: 99%
“…The timetable Model (1) cannot be solved directly using the branch and bound algorithm because the constraint (1.6) is a conditional constraint in which a value of Nevertheless, the genetic algorithm is only capable of providing a solution that is near optimal [1]. On one side of the study [11] shows that the branch and bound algorithm still shows the best performance for the case of bus time tabling problem.…”
Section: B Problem Solutionmentioning
confidence: 99%
“…Constraint (10) assures that the resulting solution is an integer of 1 to the number of set members of that number (|Y|). Model Eqs (7)- (11) have not produced a bus departure time table. The bus departure schedule of the optimal number of trips / headways can be made based on the following algorithm:…”
Section: B Problem Solutionmentioning
confidence: 99%