Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem
High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, t...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2014/767429 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832546517648408576 |
---|---|
author | Yu Zhou Leishan Zhou Yun Wang |
author_facet | Yu Zhou Leishan Zhou Yun Wang |
author_sort | Yu Zhou |
collection | DOAJ |
description | High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained. |
format | Article |
id | doaj-art-319deb41944d482eba10a7bf6b01a17d |
institution | Kabale University |
issn | 1026-0226 1607-887X |
language | English |
publishDate | 2014-01-01 |
publisher | Wiley |
record_format | Article |
series | Discrete Dynamics in Nature and Society |
spelling | doaj-art-319deb41944d482eba10a7bf6b01a17d2025-02-03T06:48:28ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2014-01-01201410.1155/2014/767429767429Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling ProblemYu Zhou0Leishan Zhou1Yun Wang2State Key Lab of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, ChinaState Key Lab of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, ChinaMOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, ChinaHigh-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained.http://dx.doi.org/10.1155/2014/767429 |
spellingShingle | Yu Zhou Leishan Zhou Yun Wang Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem Discrete Dynamics in Nature and Society |
title | Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem |
title_full | Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem |
title_fullStr | Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem |
title_full_unstemmed | Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem |
title_short | Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem |
title_sort | using improved ant colony algorithm to investigate emu circulation scheduling problem |
url | http://dx.doi.org/10.1155/2014/767429 |
work_keys_str_mv | AT yuzhou usingimprovedantcolonyalgorithmtoinvestigateemucirculationschedulingproblem AT leishanzhou usingimprovedantcolonyalgorithmtoinvestigateemucirculationschedulingproblem AT yunwang usingimprovedantcolonyalgorithmtoinvestigateemucirculationschedulingproblem |