Skip to main content
SpringerLink
Log in

A set covering approach for multi-depot train driver scheduling

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The set covering problem (SCP), which has many practical applications, is one of the fundamental combinatorial problems. In this paper, a new neighborhood structure is proposed for solving this problem. In this structure, a linear programming (LP) model is generated by relaxing binary constraints, removing a selected column, and adding some inequalities. Then, a sub integer programming model, by joining the LP model solution and the incumbent solution, is created and its solution is considered as a neighbourhood solution. The neighbourhood structure can be implemented in various metaheuristics. This paper presents a matheuristic by combining a tabu search metaheuristic and the proposed neighbourhood structure. The matheuristic begins with an initial feasible solution. The initial solution is generated using a proposed heuristic method. The parameters of the matheuristic are tuned by a three-step method based on design of experiments. To evaluate the efficiency and effectiveness of the proposed algorithm, several standard test problems are used. The experimental results show the high performance of the proposed algorithm. Finally, a mathematical model based on the SCP is used to formulate the train driver scheduling (TDS) in Iranian railways. The TDS is performed in two phases, i.e., duty generation to build all feasible duties, and duty optimization to assign the best possible duty to each train. The breadth-first algorithm is applied to make duties. The generated duty optimization problem has about one million duties. For solving this huge model, the proposed matheuristic is used. The algorithm is successfully applied to solve the TDS in Iranian railways and the results are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Abbink E, Fischetti M, Kroon L, Timmer G, Vromans M (2005) Reinventing crew scheduling at Netherlands Railways. Interfaces 35:393–401

    Article  Google Scholar 

  • Ablanedo-Rosas JH, Rego C (2010) Surrogate constraint normalization for the set covering problem. Eur J Oper Res 205:540–551

    Article  MATH  MathSciNet  Google Scholar 

  • Ahuja RK, Liu L, Orlin JB, Sharma D, Shughart L (2002) Solving real-life locomotive scheduling problems. Networks 39:43–52

    Article  MathSciNet  Google Scholar 

  • Ahuja RK, Magnanti TL, Orlin JB (1998) Network flows. Sloan School of Management, Massachusetts Institute of Technology, Cambridge

    Google Scholar 

  • Andersson E, Housos E, Kohl N, Wedelin D (1998) Crew pairing optimization. In: G. Yu (ed) Operations Research in the Airline Industry. Kluwer Academic Publishers, US. pp 228–258

  • Avella P, Boccia M, Vasilyev I (2009) Computational experience with general cutting planes for the Set Covering problem. Oper Res Lett 37:16–20

    Article  MATH  MathSciNet  Google Scholar 

  • Avis D (1980) A note on some computationally difficult set covering problems. Math Program 18:138–145

    Article  MATH  MathSciNet  Google Scholar 

  • Baker EK (1981) Efficient heuristic algorithms for the weighted set covering problem. Comput Oper Res 8:303–310

    Article  Google Scholar 

  • Balas E, Carrera MC (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44:875–890

    Article  MATH  MathSciNet  Google Scholar 

  • Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Math Program 12:37–60

    MATH  MathSciNet  Google Scholar 

  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch and price: column generation for solving huge integer programs. Oper Res 46:316–329

    Article  MATH  MathSciNet  Google Scholar 

  • Barnhart C, Shenoi RG (1998) An approximate model and solution approach for the long-haul crew pairing problem. Transport Sci 32:221–231

    Article  MATH  Google Scholar 

  • Beasely JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94:392–404

    Article  Google Scholar 

  • Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Appl Soft Comput 11:4135–4151

    Article  Google Scholar 

  • Boschetti M, Maniezzo V, Roffilli M, Rohler AB (2009) Matheuristics: Optimization, Simulation and Control. Proceedings of the 6th International Workshop on Hybrid Metaheuristics: 171–177, HM’09

  • Brusco MJ, Jacobs LW, Thompson GM (1999) A morphing procedure to supplement a simulated annealing heuristic for cost and coverage-correlated set-covering problems. Ann Oper Res 86:611–627

    Article  MATH  MathSciNet  Google Scholar 

  • Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47:730–743

    Article  MATH  MathSciNet  Google Scholar 

  • Caprara A, Fischetti M, Toth P (2000) Algorithms for the set covering problem. Ann Oper Res 98:353–371

    Article  MATH  MathSciNet  Google Scholar 

  • Caprara A, Fischetti M, Toth P, Vigo D (1997) Algorithms for railway crew management. Math Program 79:125–141

    MATH  MathSciNet  Google Scholar 

  • Caprara A, Fischetti M, Toth P, Vigo D (1998) Modeling and solving the crew rostering problem. Oper Res 46:820–830

    Article  MATH  Google Scholar 

  • Caprara A, Kroon L, Monaci M, Peeters M, Toth P (2007) Passenger railway optimization. In: Barnhart C, Laporte G (eds) Handbooks in operations research and management science: transportation. Elsevier, Amsterdam, pp 129–187

    Google Scholar 

  • Caserta M (2007) Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Metaheuristics: progress in complex systems optimization. Springer, New York, pp 43–63

    Chapter  Google Scholar 

  • Caserta M, Voß S (2009) Metaheuristics: intelligent problem solving. In: Maniezzo V, Stützle T, Voß S (eds) Matheuristics: hybridizing metaheuristics and mathematical programming. Springer, Berlin, pp 1–38

    Chapter  Google Scholar 

  • Chatterjee S, Carrera C, Lynch LA (1996) Genetic algorithms and traveling salesman problems. Eur J Oper Res 93:490–510

    Article  MATH  Google Scholar 

  • Chu HD, Gelman E, Johnson EL (1997) Solving large scale crew scheduling problems. Eur J Oper Res 97:260–268

    Article  MATH  Google Scholar 

  • Chvátal V (1979) A greedy heuristic for the set covering problem. Math Oper Res 4:233–235

    Article  MATH  MathSciNet  Google Scholar 

  • Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighbourhoods to improve MIP solutions. Math Program 102:71–90

    Article  MATH  MathSciNet  Google Scholar 

  • Deng G, Lin W (2011) Ant colony optimization-based algorithm for airline crew scheduling problem. Expert Syst Appl 38:5787–5793

    Article  MathSciNet  Google Scholar 

  • Desaulniers G, Desrosiers J, Dumas Y, Marc S, Rioux B, Solomon M, Soumis F (1997) Crew pairing at Air France. Eur J Oper Res 97:245–259

    Article  MATH  Google Scholar 

  • Ernst AT, Jiang H, Krishnamoorthy M, Owens B, Sier D (2004a) An annotated bibliography of personnel scheduling and rostering. Ann Oper Res 127:21–144

    Article  MATH  MathSciNet  Google Scholar 

  • Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004b) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3–27

    Article  MATH  MathSciNet  Google Scholar 

  • Fischetti M, Lodi A (2003) Local branching. Math Program 98:23–47

    Article  MATH  MathSciNet  Google Scholar 

  • Fisher M, Kedia P (1990) Optimal solution of set covering/partitioning problems using dual heuristics. Manag Sci 36:674–688

    Article  MATH  MathSciNet  Google Scholar 

  • Fisher ML, Rinnooy Kan AHG (1988) The design, analysis and implementation of heuristics. Manag Sci 34:263–265

    Article  MathSciNet  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman WH, San Francisco

    MATH  Google Scholar 

  • Glover F (1989) Tabu search–Part I. ORSA J Comput 1(3):190–206

    Article  MATH  Google Scholar 

  • Glover F (1990) Tabu search–Part II. ORSA J Comput 2(1):4–32

    Article  MATH  Google Scholar 

  • Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston

  • Glover F, Laguna M (2002) Tabu search. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 194–208

  • Glover F, Laguna M, Martí F (2000) Fundamentals of scatter search and path relinking. Control Cybern 29:653–684

    MATH  Google Scholar 

  • Goossens JWHM (2004) Models and algorithms for railway line planning models. PhD Thesis, University of Maastricht, Netherlands

  • Hoffman KL, Padberg M (1993) Solving airline crew scheduling problems by branch-and-cut. Manag Sci 39:657–682

    Article  MATH  Google Scholar 

  • Huisman D (2007) A column generation approach to solve the crew re-scheduling problem. Eur J Oper Res 180:163–173

    Article  MATH  Google Scholar 

  • Kroon LG, Fischetti M (2001) Crew scheduling for Netherlands Railways “destination: customer”. In: Voß S, Daduna JR (eds) Computer-aided scheduling of public transport. Springer, Berlin, pp 181–201

    Chapter  Google Scholar 

  • Kwan A (1999) Train Driver Scheduling. PhD Thesis, School of Computer Studies, University of Leeds, Leeds, UK

  • Kwan RSK, Kwan A (2007) Effective search space control for large and/or complex driver scheduling problems. Ann Oper Res 155:417–435

    Article  MATH  Google Scholar 

  • Lan G, DePuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176:1387–1403

    Article  MATH  MathSciNet  Google Scholar 

  • Lee CK, Chen CH (2003) Scheduling of train driver for Taiwan railway administration. J East Asia Soc Trans Sci 5:292–306

    Google Scholar 

  • Lessing L, Dumitrescu I, Stützle T (2004) A comparison between ACO algorithms for the set covering problem. Lect Notes Comput Sc 3172:1–12

    Article  Google Scholar 

  • Levine D (1996) Application of a hybrid genetic algorithm to airline crew scheduling. Comput Oper Res 23:547–558

    Article  MATH  Google Scholar 

  • Mesquita M, Paias A (2008) Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput Oper Res 35:1562–1575

    Article  MATH  Google Scholar 

  • Montgomery DC (2009) Design and analysis of experiments. Wiley, New York

    Google Scholar 

  • Parker ME, Smith BM (1991) Two approaches to computer crew scheduling. In: Wren A (ed) Proceedings of Second International Workshop on Computer-Aided Scheduling of Public Transport, North-Holland, Amsterdam, pp 193–221

  • Raja Balachandar S, Kannan K (2010) A meta-heuristic algorithm for set covering problem based on gravity. Int J Math Comput Sci 4:223–228

    MathSciNet  Google Scholar 

  • Ren Z, Feng Z, Ke L, Zhang Z (2010) New ideas for applying ant colony optimization to the set covering problem. Comput Ind Eng 58:774–784

    Article  Google Scholar 

  • Umetani S, Yagiura M (2007) Relaxation heuristics for the set covering problem. J Oper Res Soc Japan 50:350–375

    MATH  MathSciNet  Google Scholar 

  • Vasko FJ, Wilson GR (1984a) An efficient heuristic for large set covering problems. Nav Res Logist Q 31:163–171

    Article  MATH  Google Scholar 

  • Vasko FJ, Wilson GR (1984b) Using a facility location algorithm to solve large set covering problems. Oper Res Lett 3:85–90

    Article  MATH  Google Scholar 

  • Wren A (1981) General review of the use of computers in scheduling buses and their crews. In: Wren A (ed) Computer scheduling of public transport, North-Holland, Amsterdam, pp 3–16

  • Wren A, Rousseau JM (1995) Bus driver scheduling—an overview. In: Daduna JR, Branco I, Paixao JMP (eds) Computer-aided transit scheduling. Springer, Berlin, pp 173–187

    Chapter  Google Scholar 

  • Yaghini M, Ghannadpour SF (2009) Railway crew scheduling using heuristic model. J Trans Res 6:381–395 (In Persian)

    Google Scholar 

  • Yagiura M, Kishida M, Ibaraki T (2006) A 3-flip neighborhood local search for the set covering problem. Eur J Oper Res 172:472–499

    Article  MATH  MathSciNet  Google Scholar 

  • Yan S, Chang JC (2002) Airline cockpit crew scheduling. Eur J Oper Res 136:501–511

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rail Transportation Department, School of Railway Engineering, Iran University of Science and Technology, Tehran, Iran

    Masoud Yaghini, Mohammad Karimi & Mohadeseh Rahbar

Authors
  1. Masoud Yaghini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohadeseh Rahbar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masoud Yaghini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yaghini, M., Karimi, M. & Rahbar, M. A set covering approach for multi-depot train driver scheduling. J Comb Optim 29, 636–654 (2015). https://doi.org/10.1007/s10878-013-9612-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-013-9612-1

Keywords

Search

Navigation