Abstract




 
   

IJE TRANSACTIONS A: Basics Vol. 22, No. 1 (February 2009) 33-46   

downloaded Downloaded: 207   viewed Viewed: 2387

  SOLVING A NEW MULTI-PERIOD MATHEMATICAL MODEL OF THE RAIL-CAR FLEET SIZE AND CAR UTILIZATION BY SIMULATED ANNEALING
 
 
R. Tavakkoli-Moghaddam*

Department of Industrial Engineering and Department of Engineering Science
College of Engineering, University of Tehran
P.O. Box 11155/4563, Tehran, Iran
tavakoli@ut.ac.ir

H. R. Sayarshad

Department of Industrial Engineering, Mazandaran University of Science and Technology
P.O. Box 734, Bobol, Iran
hamsayar@yahoo.com

T. Y. ElMekkawy

Department of Mechanical and Manufacturing Engineering, University of Manitoba
Winnipeg, MB, R3T 2N2, Canada
tmekkawy@cc.umanitoba.ca

* Corresponding Author
 
 
( Received: December 28, 2007 – Accepted in Revised Form: September 25, 2008 )
 
 

Abstract    There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other words, the traditional exact optimization approaches cannot solve a real-life size problem of this kind in a reasonable time. To tackle this problem, an efficient meta-heuristic algorithm based on simulated annealing (SA) is proposed. This algorithm works efficiently on a neighborhood search within solution space and probable acceptance of inferior solutions to escape from being trapped in local optima. A number of numerical examples are solved to check for efficiency and validity of the proposed SA algorithm. We conclude that the proposed model and algorithm are useful to identify good strategies for the sizing of rail car fleets and allocation of related cars.

 

Keywords    Multi-period model, Fleet sizing, Freight car allocation, Railroad transportation, Simulated Annealing

 

References   

1. Crainic, T. G., “Service Network Design in Freight Transportation”, European Journal of Operation Research, Vol. 122, No. 2, (2000), 272-288.

2. Hall, R. W. and Racer, M., “Transportation with Common Carrier and Private Fleets: System Assignment and Shipment Frequency Optimization”,IIEE Transportations, Vol. 27, (1995), 217-225.

3. Du, Y. and Hall, R., “Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation Networks”, Management Science, Vol. 43, No. 2, (1997), 145-157.

4. Ozdamar, L. and Yazgac, T., “Hierarchical Planning Approach for a Production-Distribution System”, International Journal of Production Research, Vol. 37, No. 16, (1999), 3759-3772.

5. Barnhart, C. and Schneur, R. R., “Air network Design for Express Shipment Service”, Operation Research, Vol. 44, No. 6, (1966), 852-863.

6. Beamon, B. M. and Deshpande, A. N., “Mathematical Programming Approach to Simultaneous Unit-Load and Fleet-Size Optimization in Material Handling Systems Design”, International Journal of Advanced Manufacturing Technology, Vol. 14, No. 11, (1998), 858-863.

7. Beamon, B. M. and Chen, V. C. P., “Performability-Based Fleet Sizing in a Material Handling System”,International Journal of Advanced Manufacturing Technology, Vol. 14, No. 6, (1998), 441-449.

8. Feeney, G., “Controlling the Distribution of Empty Freight Cars”, Proceedings of the Tenth National Meeting, Operations Research Society of America, Baltimore, (1957).

9. Leddon, D. C. and Wrathall, E., “Scheduling Empty Freight Car Fleets on the Louisville and Nashville Railroad”, Cybernetic Electronics Railways, Vol. 3, (1968), 411-439.

10. Dejax, P. J. and Grainic, T. G., “A Review of Empty Flows and Fleet Management Models in Freight Transportation”, Transportation Science, Vol. 21, (1987), 227-247.

11. White, W., “Dynamic Transshipment Networks: an Algorithm and its Application to the Distribution of Empty Containers”, Networks, Vol. 2, (1972), 211-236.

12. White, W. W. and Bomberault, A. M., “A Network Algorithm for Empty Freight Car Allocation”, IBM System Journal, Vol. 8, (1969), 147-169.

13. Shan, Y., “A Dynamic Multi Commodity Network flow Model for Real-Time Optimal Rail Freight Car Management”,PhD Dissertation, Department of Civil Engineering and Operations Research, Princeton University, Princeton, N.J., U.S.A., (1985).

14. Chin, K. C., “A Real Time Dynamic Optimal Freight Car Management Simulation Model of Multiple Railroad, Multi Commodity, Temporal Spatial Network flow Problem”, PhD Dissertation, Department of Civil Engineering and Operations Research, Princeton University, Princeton, N.J., U.S.A., (1986).

15. Glickman, S. T. and Sherali, D. H., “Large-Scale Network Distribution of Pooled Empty Freight Cars Over Time with Limited Substitution and Equitable Benefits”, Transportation Research, Vol. 19, (1985), 58-94.

16. Powell, W. B., “A Comparative Review of Alternative Algorithms for the Dynamic Vehicle Allocation Problem”, In: Golden, B. I. and Assad, A. A., (Eds.), Vehicle Routing: Methods and Studies, Amsterdam, North-Holland, (1988), 217-232.

17. Mendiratta, V. B., “A Dynamic Optimization Model of the Empty Car Distribution Process”, PhD Dissertation, Northwestern University, Evanston, IL, (1981).

18. Mendiratta, V. B. and Turnquist, M. A., “A Model for Management of Empty Freight Cars”, Transportation Research Record, No. 838, (1982), 50-55.

19. Frantzeskakis, L. F. and Powell, W. B., “A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems”, TransportationScience, Vol. 24, (1990), 40-57.

20. Turnquist, M. A., “Research Opportunities in Transportation System Characteristics and Operations”, Transportation Research, Vol. 19, (1988), 357-366.

21. Turnquist, M. A. and Jordan, W. C., “Fleet sizing under Production Cycles and Uncertain Travel Times”, Transportation Science, Vol. 20, No. 4, (1986), 227-236.

22. List, F., Wood, B., Nozick, L. K., Turnquist, M. A., Jones, D. A., Kjeldgaard, E. A. and Lawton, C. R., “Robust Optimization for Fleet Planning under Uncertainty”, Transportation Research, Vol. 39, (2003), 209-227.

23. Powell, W. B. and Carvallho, T. A., “Dynamic Control of Logistics Queuing Networks for Large-Scale Fleet Management”, Transportation Science, Vol. 32, (1998), 90-109.

24. Jordan, W. C., “The Impact of Uncertain Demand and Supply on Empty Rail Car Distribution”,PhD Dissertation, Cornell University Ithaka, NY, (1982).

25. Jordan, W. C. and Turnquist, M. A., “A Stochastic, Dynamic Network Model for Railroad Car Distribution”, Transportation Science, Vol. 17, (1983), 124-145.

26. Carvallho, T. and Powell, W. B., “A Multiplier Adjustment Method for Dynamic Resource Allocation Problems”, Transportation Science, Vol. 34, (2000), 150-164.

27. Beaujon, G. J. and Turnquist, M. A., “A Model for Fleet Sizing and Vehicle Allocation”, TransportationScience, Vol. 25, No. 1, (1991), 19-45.

28. Sherali, H. D. and Tuncbilek, C. H., “Static and Dynamic Time-Space Strategic Models and Algorithms for Multilevel Rail-Car Fleet Management”, Management Science, Vol. 43, No. 2, (1997), 235-250.

29. Sherali, H. D. and Maguire, L. W., “Determining Rail Fleet Sizes for Shipping Automobiles”, Interfaces, Vol. 30, No. 6, (2000), 80-90.

30. Bojovic, N., “A General System Theory Approach to Rail Freight Car Fleet Size”, European Journal of Operational Research, Vol. 136, No. 1, (2002), 136-172.

31. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P., “Optimization by Simulated Annealing”, Science, Vol. 220, (1983), 671-680

32. Malhotra, A., Oliver, J. H. and Tu, W., “Synthesis of Spatially and Intrinsically Constrained Curves using Simulated Annealing”, ASME Journal of Mechanical Design, Vol. 118, (1996), 53-61.





International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir