Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481723 | European Journal of Operational Research | 2008 | 14 Pages |
Abstract
This paper deals with the determination of seat allocations for a rail booking system. It is assumed that demand for each trip in the network can be divided into two segments, namely a full fare segment and a discounted fare segment. A constrained nonlinear integer programming model is formulated to deal with this problem. The purpose of this paper is to develop an efficient heuristic approach to develop the booking limits for all ticket types in the railway network. The solutions obtained by the heuristic approach are compared with those found by the Lingo software and the DICOPT solver. Numerical results show that the proposed heuristic approach only require a small number of CPU time to obtain superior solutions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Peng-Sheng You,