Skip to main content
SpringerLink
Log in

Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem

  • Conference paper
Advances in Swarm Intelligence (ICSI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8794))

Included in the following conference series:

Abstract

The 3-flip neighborhood local search (3FNLS) is an excellent heuristic algorithm for the set covering problem which has dominating performance on the most challenging crew scheduling instances from Italy railways. We introduce a method to further improve the effectiveness of 3FNLS by incorporating random flat move to its search process. Empirical studies show that this can obviously improve the solution qualities of 3FNLS on the benchmark instances. Moreover, it updates two best known solutions within reasonable time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research 44(6), 875–890 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beasley, J.E.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 1069–1072 (1990)

    Google Scholar 

  3. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)

    Article  MATH  Google Scholar 

  4. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47(5), 730–743 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Annals of Operations Research 98(1-4), 353–371 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ceria, S., Nobili, P., Sassano, A.: A lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81(2), 215–228 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Feo, T.A., Resende, M.G.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8(2), 67–71 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Management Science 27(1), 1–18 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)

    Google Scholar 

  11. Jacobs, L.W., Brusco, M.J.: Note: A local-search heuristic for large set-covering problems. Naval Research Logistics 42(7), 1129–1140 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lan, G., De Puy, G.W., Whitehouse, G.E.: An effective and simple heuristic for the set covering problem. European Journal of Operational Research 176(3), 1387–1403 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lessing, L., Dumitrescu, I., Stützle, T.: A comparison between aco algorithms for the set covering problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 1–12. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Ren, Z.G., Feng, Z.R., Ke, L.J., Zhang, Z.J.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering 58(4), 774–784 (2010)

    Article  Google Scholar 

  15. Smith, B.M., Wren, A.: A bus crew scheduling system using a set covering formulation. Transportation Research Part A: General 22(2), 97–108 (1988)

    Article  Google Scholar 

  16. Sundar, S., Singh, A.: A hybrid heuristic for the set covering problem. Operational Research 12(3), 345–365 (2012)

    Article  MATH  Google Scholar 

  17. Vasko, F.J.: An efficient heuristic for large set covering problems. Naval Research Logistics Quarterly 31(1), 163–171 (1984)

    Article  MATH  Google Scholar 

  18. Yagiura, M., Kishida, M., Ibaraki, T.: A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research 172(2), 472–499 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, China

    Chao Gao, Thomas Weise & Jinlong Li

Authors
  1. Chao Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Weise
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jinlong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Key Laboratory of Machine Perception (MOE), Peking University, 100871, Beijing, China

    Ying Tan

  2. Department of Electrical & Electronic Engineering, Xi’an Jiaotong-Liverpool University, Suzhou, China

    Yuhui Shi

  3. Computer Science Department, CINVESTAV-IPN, Mexico

    Carlos A. Coello Coello

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gao, C., Weise, T., Li, J. (2014). Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11857-4_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11856-7

  • Online ISBN: 978-3-319-11857-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation