762
Views
17
CrossRef citations to date
0
Altmetric
Articles

An optimization based decision support system for integrated planning and scheduling on dedicated freight corridors

&
Pages 7416-7435 | Received 18 Dec 2013, Accepted 31 May 2014, Published online: 16 Jul 2014

References

  • Ahuja, R. K., Claudio. B. Cunha, and Guvenc Sahin. 2005. “Network Models in Railroad Planning and Scheduling.” Tutorials in Operations Research: Emerging Theory, Methods, and Applications. INFORMS 1: 54–105.
  • Ahuja, R. K., P. Dewan, M. Jaradat, K. C. Jha, and A. Kumar. 2006. “An Optimization-based Decision Support System for Train Scheduling.” White Paper, Innovative Scheduling, USA.
  • Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. 1993. “Network Flows: Theory, Algorithms, and Applications”, 649–652. New Jersey, NJ: Prentice hall, ISBN 0-13-617549-X.
  • Bandeira, D. L., J. L. Becker, and D. Borenstein. 2009. “A DSS for Integrated Distribution of Empty and Full Containers.” Decision Support Systems 47 (4): 383–397.10.1016/j.dss.2009.04.003
  • Beaujon, G. J., and M. A. Turnquist. 1991. “A Model for Fleet Sizing and Vehicle Allocation.” Transportation Science 25 (1): 19–45.10.1287/trsc.25.1.19
  • Bektaş, T., T. G. Crainic, and V. Morency. 2009. “Improving the Performance of Rail Yards through Dynamic Reassignments of Empty Cars.” Transportation Research Part C: Emerging Technologies 17 (3): 259–273.10.1016/j.trc.2008.11.003
  • Burdett, R. L., and E. Kozan. 2009. “Scheduling Trains on Parallel Lines with Crossover Points.” Journal of Intelligent Transportation Systems 13 (4): 171–187.10.1080/15472450903297608
  • Caramia, M., and F. Guerriero. 2009. “A Heuristic Approach to Long-Haul Freight Transportation with Multiple Objective Functions.” Omega 37 (3): 600–614.10.1016/j.omega.2008.02.001
  • Carey, M., and I. Crawford. 2007. “Scheduling Trains on a Network of Busy Complex Stations.” Transportation Research Part B: Methodological 41 (2): 159–178.10.1016/j.trb.2006.02.002
  • Chen, S., T. Ho, and B. Mao. 2013. “Maintenance Schedule Optimisation for a Railway Power Supply System.” International Journal of Production Research 51 (16): 4896–4910.10.1080/00207543.2013.774501
  • Cordeau, J. F., P. Toth, and D. Vigo. 1998. “A Survey of Optimization Models for Train Routing and Scheduling.” Transportation Science 32 (4): 380–404.10.1287/trsc.32.4.380
  • Corman, F., A. D’Ariano, and I. A. Hansen. 2014. “Evaluating Disturbance Robustness of Railway Schedules.” Journal of Intelligent Transportation Systems: Technology, Planning, and Operations 18 (1): 106–120. doi:10.1080/15472450.2013.801714.
  • D’Ariano, A., D. Pacciarelli, and M. Pranzo. 2007. “A Branch and Bound Algorithm for Scheduling Trains in a Railway Network.” European Journal of Operational Research 183 (2): 643–657.10.1016/j.ejor.2006.10.034
  • DFCCIL (Dedicated Freight Corridor Corporation of India Ltd.). 2013. Accessed February 2. http://www.dfccil.org
  • Dorfman, M., and J. Medanic. 2004. “Scheduling Trains on a Railway Network Using a Discrete Event Model of Railway Traffic.” Transportation Research Part B: Methodological 38 (1): 81–98.10.1016/S0191-2615(03)00006-7
  • Erera, A. L., J. C. Morales, and M. Savelsbergh. 2009. “Robust Optimization for Empty Repositioning Problems.” Operations Research 57 (2): 468–483.10.1287/opre.1080.0650
  • Fleischer, L., and M. Skutella. 2003. “Minimum Cost Flows over time without Intermediate Storage.” Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Baltimore, Maryland, Society for Industrial and Applied Mathematics : 66–75.
  • Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to NP-Completeness. New York: WH Freeman, p. 216
  • Giacco, G. L., A. D’Ariano, and D. Pacciarelli. 2013. “Rolling-stock Rostering Optimization under Maintenance Constraints.” Journal of Intelligent Transportation Systems 18 (1): 95–105.
  • Godwin, T., R. Gopalan, and T. Narendran. 2007. “A Heuristic for Routing and Scheduling Freight Trains in a Passenger Rail Network.” International Journal of Logistics Systems and Management 3 (1): 101–133.10.1504/IJLSM.2007.012072
  • Gorman, M. F., D. Acharya, and D. Sellers. 2010. “CSX Railway Uses oR to Cash in on Optimized Equipment Distribution.” Interfaces 40 (1): 5–16.10.1287/inte.1090.0465
  • Gorman, M. F., K. Crook, and D. Sellers. 2011. “North American Freight Rail Industry Real-time Optimized Equipment Distribution Systems: State of the Practice.” Transportation Research Part C: Emerging Technologies 19 (1): 103–114.10.1016/j.trc.2010.03.012
  • Haghani, A. E. 1987. “Rail Freight Transportation: A Review of Recent Optimization Models for Train Routing and Empty Car Distribution.” Journal of Advanced Transportation 21 (2): 147–172.10.1002/atr.v21:2
  • Hall, A., S. Hippler, and M. Skutella. 2007. “Multicommodity Flows over Time: Efficient Algorithms and Complexity.” Theoretical Computer Science 379 (3): 387–404.10.1016/j.tcs.2007.02.046
  • Harrod, S. S. 2012. “A Tutorial on Fundamental Model Structures for Railway Timetable Optimization.” Surveys in Operations Research and Management Science 17 (2): 85–96.10.1016/j.sorms.2012.08.002
  • Holmberg, K., M. Joborn, and J. T. Lundgren. 1998. “Improved Empty Freight Car Distribution.” Transportation Science 32 (2): 163–173.10.1287/trsc.32.2.163
  • Hughes, R. E., and W. B. Powell. 1988. “Mitigating End Effects in the Dynamic Vehicle Allocation Model.” Management Science 34 (7): 859–879.10.1287/mnsc.34.7.859
  • IR Reports 2012. Indian Railways Annual Report and Accounts 2010-11. Ministry of Railways, Govt. of India: 8–134.
  • JICA (Japan International Cooperation Agency) report. 2007. “The Feasibility Study on the Development of Dedicated Freight Corridor for Delhi-Mumbai and Ludhiana-Sonnagar in India.” 3 (2): 1–188.
  • Joborn, M., T. G. Crainic, M. Gendreau, K. Holmberg, and J. T. Lundgren. 2004. “Economies of Scale in Empty Freight Car Distribution in Scheduled Railways.” Transportation Science 38 (2): 121–134.10.1287/trsc.1030.0061
  • Kim, B. S., and C. M. Joo. 2011. “Ant Colony Optimisation with Random Selection for Block Transportation Scheduling with Heterogeneous Transporters in a Shipyard.” International Journal of Production Research 50 (24): 7229–7241.
  • King, G. J., and H. Topaloglu. 2006. “Incorporating the Pricing Decisions into the Dynamic Fleet Management Problem.” Journal of the Operational Research Society 58 (8): 1065–1074.
  • Klinz, B., and G. J. Woeginger. 2004. “Minimum-cost Dynamic Flows: The Series-parallel Case.” Networks 43 (3): 153–162.10.1002/(ISSN)1097-0037
  • Klotz, E., and A. M. Newman. 2013. “Practical Guidelines for Solving Difficult Mixed Integer Linear Programs.” Surveys in Operations Research and Management Science 18 (1–2): 18–32.10.1016/j.sorms.2012.12.001
  • Li, M. K., and T. L. Yip. 2013. “Joint Planning for Yard Storage Space and Home Berths in Container Terminals.” International Journal of Production Research 51 (10): 3143–3155.10.1080/00207543.2012.760852
  • Meng, L., and X. Zhou. 2011. “Robust Single-track Train Dispatching Model under a Dynamic and Stochastic Environment: A Scenario-Based Rolling Horizon Solution Approach.” Transportation Research Part B: Methodological 45 (7): 1080–1102.10.1016/j.trb.2011.05.001
  • Milenković, M., and N. Bojović. 2013. “A Fuzzy Random Model for Rail Freight Car Fleet Sizing Problem.” Transportation Research Part C: Emerging Technologies 33: 107–133.10.1016/j.trc.2013.05.003
  • Mu, S., and M. Dessouky. 2011. “Scheduling Freight Trains Traveling on Complex Networks.” Transportation Research Part B: Methodological 45 (7): 1103–1123.10.1016/j.trb.2011.05.021
  • Narisetty, A. K., J. P. Richard, David Ramcharan, Deby Murphy, Gayle Minks, and Jim Fuller. 2008. “An Optimization Model for Empty Freight Car Assignment at Union Pacific Railroad.” Interfaces 38 (2): 89–102.10.1287/inte.1070.0330
  • PIB (Press Information Bureau). 2013. Indian Railways Carry Passengers Equivalent to Almost the Population of Entire World, 14 August, Ministry of Railways, Govt. of India: SS-67/SF-67/14-08-2013.
  • Powell, W. B. 2003. “Dynamic Models of Transportation Operations.” In Handbooks in Operations Research and Management Science. Vol. 11, edited by S. C. Graves and A. G. d. Kok, 677–756. Princeton: Elsevier.
  • PTO (Preferential Traffic Order). 2013. GO No. 86, Railway Board, Ministry of Railways. Govt. of India: 2008/TT-III/1/1, dated 21-03-2013.
  • Şahin, Güvenç, Ravindra K. Ahuja, and Claudio B. Cunha. 2010. Integer Programming Based Solution Approaches for the Train Dispatching Problem. Technical Report, Sabanci University ID:SU_FENS_2011/0002.
  • Song, D. P. 2006. “Characterizing Optimal Empty Container Reposition Policy in Periodic-review Shuttle Service Systems.” Journal of the Operational Research Society 58 (1): 122–133.
  • Song, D. P., J. Dinwoodie, and M. Roe. 2007. “Integrated Vehicle Fleet-sizing, Leasing and Dispatching Policy in a Shuttle Service System.” International Journal of Logistics Research and Applications 10 (1): 29–40.10.1080/13675560601081482
  • Thomas, A., G. Singh, M. Krishnamoorthy, and J. Venkateswaran. 2013. “Distributed Optimisation Method for Multi-resource Constrained Scheduling in Coal Supply Chains.” International Journal of Production Research 51 (9): 2740–2759.10.1080/00207543.2012.737955
  • Yang, L., K. Li, and X. Li. 2012. “Optimizing Trains Movement on a Railway Network.” Omega 40 (5): 619–633.10.1016/j.omega.2011.12.001
  • Zhen, L. 2013. “Storage Allocation in Transhipment Hubs under Uncertainties.” International Journal of Production Research 52 (1): 72–88.
  • Zwaneveld, P. J., L. G. Kroon, and S. P. M. Van Hoesel. 2001. “Routing Trains through a Railway Station Based on a Node Packing Model.” European Journal of Operational Research 128 (1): 14–33.10.1016/S0377-2217(00)00087-4

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.