In this paper, we consider the train-fleet assignment problem to determine fleet assignment and seat allocation synchronously. An integer programming model of the problem and a decomposition-based solution approach are developed to handle short-term period deterministic orgin-destination demands. The primary objective used in the developed model is to maximize the total number of passengers transported during peak load periods, such as Chuseok national holiday period. Thus, in developing the model we choose to profit-pursuing system. We also show how the proposed model can be readily modified to incorporate profit-maximization. Using the empirical data sets provided by a Korean railroad company, we have tested the proposed solution approach and carried out various comparison analyses by varying traffic demand patterns and train schedules. The computational experiments reveal that the proposed solutions approach produces high quality solutions in reasonable computation time.