论文信息 - A bilevel model for railway train set organizing optimization

A bilevel model for railway train set organizing optimization

Train Set Organization (TSO) is to arrange the train set in railway freight transportation. Bilevel programming techniques were proposed to solve the Stackelberg game in which play is sequential and cooperation is not permitted. In this paper, an optimizing model for TSO is developed by the bilevel techniques. First, we analyzed the multiple level nature of management on TSO and simplified it into two levels. Then, a bilevel model for TSO was develop. Finally, this model was further illustrated by applying it on a railway station.

[1] Eitaro Aiyoshi,et al. HIERARCHICAL DECENTRALIZED SYSTEM AND ITS NEW SOLUTION BY A BARRIER METHOD. , 1980 .

[2] José Fortuny-Amat,et al. A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .

[3] Wilfred Candler,et al. A linear two-level programming problem, , 1982, Comput. Oper. Res..

[4] George Papavassilopoulos. Algorithms for static stackelberg games with linear costs and polyhedra constraints , 1982, 1982 21st IEEE Conference on Decision and Control.

[5] P. Marcotte. Network Optimization with Continuous Control Parameters , 1983 .

[6] David E. Boyce,et al. A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[7] M. Berezinski,et al. Multilevel models for railway traffic control , 1994 .

[8] René M. Stulz,et al. Risk management & derivatives , 2003 .

[9] Wang Ci-guang. Research on the Model and Algorithm of Dynamic Wagon-Flow Allocating in a Marshalling Station , 2004 .

[10] Cheng-Min Feng,et al. A fuzzy bi-level and multi-objective model to control traffic flow into the disaster area post earthquake , 2005 .

[11] Zhao Qiang,et al. Optimal Model and Algorithm of Stage Plan of Intelligent Dispathing System for Marshalling Stations , 2005 .

[12] Tan. HEURISTIC ALGORITHMS FOR DELIVERED PRICE SPATIALLY COMPETITIVE NETWORK FACILITY LOCATION PROBLEMS , .