Solving a multi-objective train makeup model with locomotive limitation by using a firefly algorithm: A case study

Abstract

A train makeup problem specifies the frequency of freight trains and allocates the shipment to trains based on the desired shipment-to-train allocation scheme. In this study, a multi-objective model is presented for train makeup, taking into account the locomotive limitations on a railway network. The objective functions include maximization of the total profit and the customers' satisfaction level as well as minimization of the total number of shunting operations in yards, the unused capacity of trains, the total lost demand, the transfer time of trains and the total fuel consumed. The main constraints of the model are the establishment of flow balance for each yard and each demand, the upper and lower limits of the train length, and the upper limit of the following: train makeup in each yard, shunting operations in each yard, capacity of each train and locomotive utilization in each period. Goal programming and L_p metric methods are used for the multi-objective problem considered. For solving this problem, a hybrid firefly algorithm is also proposed. A number of test problems based on the simulation are generated and solved by using the proposed algorithm. Furthermore, a real-time case study based on the Iranian Railway Network is used. The results show the potential of the presented model and the efficiency of the hybrid algorithm, which can be used for real-time railway problems.

Keywords

Train makeup multi-objective model goal programming firefly algorithm

Get full access to this article

View all access options for this article.

References

Huddleston

Pangotra

. Regional and local economic impacts of transportation investments. Transp Q 1990; 44(4): 579–594.

Berechman

. Urban and regional economic impacts of transportation investment: a critical assessment and proposed methodology. Transp Res A: Policy Pract 1994; 28: 351–362.

Yaghini

Momeni

Sarmadi

. A hybrid solution method for fuzzy train formation planning. Appl Soft Comput 2015; 31: 257–265.

Yaghini

Momeni

Sarmadi

. Solving train formation problem using simulated annealing algorithm in a simplex framework. J Adv Transp 2014; 48: 402–416.

Assad

. Modelling of rail networks: toward a routing/makeup model. Transp Res B: Methodol 1980; 14: 101–114.

Crainic

Ferland

Rousseau

. A tactical planning model for rail freight transportation. Transp Sci 1984; 18: 165–184.

Haghani

. Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transp Res B: Methodol 1989; 23: 433–452.

Keaton

. Designing railroad operating plans: a dual adjustment method for implementing Lagrangian relaxation. Transp Sci 1992; 26: 263–279.

Martinelli

Teng

. Optimization of railway operations using neural networks. Transp Res C: Emerg Technol 1996; 4: 33–49.

10.

Yaghini

. Compound optimization of train routing, makeup, and scheduling: dynamic service network design modeling, China: PhD Disertation, Northern Jiaotong University, 2003.

11.

Shafia

Sadjadi

Jamili

. Robust train formation planning. Proc IMechE, Part F: J Rail and Rapid Transit 2010; 224: 75–90.

12.

Verma

Verter

Gendreau

. A tactical planning model for railroad transportation of dangerous goods. Transp Sci 2011; 45: 163–174.

13.

Marinov

Viegas

. A mesoscopic simulation modelling methodology for analyzing and evaluating freight train operations in a rail network. Simul Model Pract Theor 2011; 19: 516–539.

14.

Yaghini

Akhavan

. Multicommodity network design problem in rail freight transportation planning. Proc – Soc Behav Sci 2012; 43: 728–739.

15.

Crevier

Cordeau

Savard

. Integrated operations planning and revenue management for rail freight transportation. Transp Res B: Methodol 2012; 46: 100–119.

16.

Bagheri

Saccomanno

. Modeling hazardous materials risks for different train make-up plans. Transp Res E: Logistics Transp Rev 2012; 48: 907–918.

17.

Yaghini

Momeni

Sarmadi

. An improved local branching approach for train formation planning. Appl Math Model 2013; 37: 2300–2307.

18.

Hanczar

Peternek

. The short-term car flow planning model in rail freight company – case study. Transp Res Proc 2015; 10: 605–614.

19.

Masek

Camaj

Nedeliakova

. Innovative methods of improving train formation in freight transport. World Acad Sci Eng Technol Int J Mech Aerosp Ind Mech Manuf Eng 2015; 9: 1865–1868.

20.

Khaled

Jin

Clarke

et al.

Train design and routing optimization for evaluating criticality of freight railroad infrastructures. Transp Res B: Methodol 2015; 71: 71–84.

21.

Borndörfer

Klug

Schlechte

et al.

The freight train routing problem for congested railway networks with mixed traffic. Transp Sci 2016; 50: 408–423.

22.

Coello Coello

Christiansen

. MOSES: a multiobjective optimization tool for engineering design. Eng Optim 1999; 31: 337–368.

23.

Evans

. An overview of techniques for solving multiobjective mathematical programs. Manage Sci 1984; 30: 1268–1282.

24.

Homma

Saltelli

. Importance measures in global sensitivity analysis of nonlinear models. Reliab Eng Syst Saf 1996; 52: 1–17.

25.

Saltelli

Chan

Scott

(eds) . Sensitivity analysis 2000; (Vol. 1), New York: Wiley.

26.

Schniederjans MJ. Goal Programming Solution Methodology. In: Schniederjans MJ (ed.) Goal programming: methodology and applications. Boston, MA: Springer US, 1995, pp. 45–72.

27.

Talbi

. Metaheuristics: from design to implementation 2009; (Vol. 74), Hoboken, NJ: John Wiley & Sons.

28.

Adenso-Diaz

Laguna

. Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 2006; 54: 99–114.

29.

Yaghini

Karimi

Rahbar

. A hybrid metaheuristic approach for the capacitated p-median problem. Appl Soft Comput 2013; 13: 3922–3930.

30.

Montgomery

. Design and analysis of experiments, Hoboken, NJ: John Wiley & Sons, 2008.

31.

Gershon

. The role of weights and scales in the application of multiobjective decision making. Eur J Oper Res 1984; 15: 244–250.

32.

Yang

. Nature-inspired metaheuristic algorithms, Frome: Luniver Press, 2010.

33.

Fister

Yang

Brest

. A comprehensive review of firefly algorithms. Swarm Evolution Comput 2013; 13: 34–46.

34.

Fister

Yang

Fister

et al.

Firefly algorithm: a brief review of the expanding literature. In: Yang

(ed). Cuckoo search and firefly algorithm, Heidelberg: Springer, 2014, pp. 347–360.