By Topic

Optimization Plan of Using the Arrival and Departure Track in District Station Based on Hybrid Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Feng Tian ; Sch. of Comput. Sci., ShenYang Aerosp. Univ., Shenyang, China ; Haiyang Wang ; Xiaoping Sun ; Jia Liu
more authors

Reasonably arranging the occupation plan of arrival and departure track is the key of compiling stage plan. In order to arrange arrival and departure track rationally and effectively, building utilization's mathematical model is needed. The model of the occupation plan of arrival and departure track in this paper is a nonlinear integer programming model, so it is difficult to be solved directly. For this reason, one hybrid algorithm is proposed that is based on the combination of genetic algorithm and ant algorithm. First, hybrid algorithm built chromosome function and fitmess function of utilization of arrival and departure track, and then executed the operation of cross, variation and selection. Second, the hybrid algorithm used the optimal solution offered by genetic algorithm to initialize ant algorithm's pheromone concentration. An application example shows hybrid algorithm can improves 6% in accuracy of solution, reduces 52% in iteration number compare with genetic algorithm and ant algorithm respectively.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011