Skip to main content
SpringerLink
Log in

A proposal for a hybrid meta-strategy for combinatorial optimization problems

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this paper, we propose an algorithm named BDS (Bound-Driven Search) that combines features of exact and approximate methods. The proposed procedure may be seen as a local search algorithm that systematically explores (in a branch-and bound sense) the most promising nodes, thus preventing solutions from being reevaluated. Additionally, it can be regarded as an exact method as it may be able to guarantee that the solution found is optimal. We present the application of this new algorithm to a specific problem domain: the permutation flow shop scheduling problem with makespan objective. The subsequent computational experiments are encouraging, as the algorithm is able to yield exact or near exact solutions to most instances of the problem. Furthermore, the algorithm outperforms one of the best state-of-the-art algorithms for the problem.

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

Similar content being viewed by others

References

  • Beasley, J.: OR library, http://mscmga.ms.ic.ac.uk/info.html (2002)

  • Framinan, J.M., Schuster, C.: An enhanced timetabling procedure for the no-wait job shop problem: a complete local search with memory approach. Comput. Oper. Res. 99, 28–40 (2006)

    Google Scholar 

  • Framinan, J.M., Leisten, R., Rajendran, C.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, flowtime and idletime in the static permutation flowshop sequencing problem. Int. J. Prod. Res. 41, 121–148 (2003)

    Article  MATH  Google Scholar 

  • French, A.P., Robinson, A.C., Wilson, J.M.: Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems. J. Heuristics 7, 551–564 (2001)

    Article  MATH  Google Scholar 

  • Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  • Ghosh, D., Sierksma, G.: Complete local search with memory. J. Heuristics 8, 571–584 (2002)

    Article  Google Scholar 

  • Glover, F., Parker, M., Ryan, J.: Coloring by tabu branch & bound. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 26, 285–307 (1996)

    MathSciNet  Google Scholar 

  • Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31, 1891–1909 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimisation and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  • Haouari, M., Ladhari, T.: A branch-and-bound based local search method for the flow shop problem. J. Oper. Res. Soc. 54, 1076–1084 (2003)

    Article  MATH  Google Scholar 

  • Ladhari, T., Haouari, M.: A computational study of the permutation flow shop problem based on a tight lower bound. Comput. Oper. Res. 32, 1831–1847 (2005)

    Article  MATH  Google Scholar 

  • Nagar, A., Heragu, S.S., Haddock, J.: A combined branch and bound and genetic algorithm based for a flowshop scheduling algorithm. Ann. Oper. Res. 63, 397–414 (1996)

    Article  MATH  Google Scholar 

  • Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the n-job, m-machine flow shop sequencing problem. Omega 11, 91–95 (1983)

    Article  Google Scholar 

  • Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 35–62 (1988)

    Article  Google Scholar 

  • Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization–Algorithms and Complexity. Dover, New York (1982)

    MATH  Google Scholar 

  • Pastor, R., Corominas, A.: Strategies of node selection in search procedures for solving combinatorial optimization problems: a survey and a general formalization. TOP 8, 111–134 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, New York (2002)

    Google Scholar 

  • Reeves, C.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22, 5–13 (1995)

    Article  MATH  Google Scholar 

  • Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165, 479–494 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Taillard, E.: Benchmarks for basic scheduling-problems. Eur. J. Oper. Res. 64, 278–285 (1993)

    Article  MATH  Google Scholar 

  • Woodcock, A.J., Wilson, J.M.: A hybrid tabu search/branch and bound approach to solving the generalised assignment problem. MIC2005. The 6th Metaheuristics International Conference, Vienna, Austria, 922–928 (2005)

Download references

Author information

Authors and Affiliations

  1. Industrial Management, School of Engineering, University of Seville, Ave. Descubrimientos, 41092, Seville, Spain

    Jose M. Framinan

  2. Institute of Industrial and Control Engineering, Technical University of Catalonia, Barcelona, Spain

    Rafael Pastor

Authors
  1. Jose M. Framinan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafael Pastor
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jose M. Framinan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Framinan, J.M., Pastor, R. A proposal for a hybrid meta-strategy for combinatorial optimization problems. J Heuristics 14, 375–390 (2008). https://doi.org/10.1007/s10732-007-9056-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9056-9

Keywords

Search

Navigation