Algorithmic Analysis Based on the Problem Decomposability

  • Filip Covic
Part of the Contributions to Management Science book series (MANAGEMENT SC.)


Based on the considerations about the large-scale model structure and its solvability in the previous chapter, a solution method for the core model is developed, formally described and numerically studied. The aim is to reduce the model size in order to enable an analysis of interaction effects of container handling problems in single yard block operations. By this approach, the solution of lager instances is promoted providing an improved basis for the theoretical examination and numerical evaluation. For this purpose, a Benders decomposition approach is developed where the Master and the Sub-problem are solved as linear programs to reduce computational time. Integrality of the Master is obtained by randomised rounding based on a Fix-and-Relax procedure which enables the algorithm to escape local optima. In this process, feasibility is constructed by calling stacking rules which underlie the specific problem structure. Based on the obtained integer input to the Sub-problem from the Master, integrability of the Sub-problem is supported by a polynomial number of facet-defining valid inequalities. Within the specified runtime limit, CPLEX finds only feasible solutions for the 30% smallest test instances while the proposed algorithm generates feasibility in close to 90% of the cases including the largest ones. Moreover, the benefits of the hybrid algorithmic framework are illustrated by a numerical comparison with the original Benders decomposition and a random draw from the solution space with the help of the heuristic stacking rules. Hence, the research questions about the theoretical foundations are addressed within this chapter.


  1. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238–252CrossRefGoogle Scholar
  2. Benjamini Y, Hochberg Y (1995) Controlling the false discovery rate: a practical and powerful approach to multiple testing. J R Stat Soc B 57(1):289–300Google Scholar
  3. Borgman B, van Asperen E, Dekker R (2010) Online rules for container stacking. OR Spectr 32(3):687–716CrossRefGoogle Scholar
  4. Boschetti M, Maniezzo V, Roffilli M (2009) Decomposition techniques as metaheuristic frameworks. In: Maniezzo V, Stützle T, Voß S (eds) Matheuristics: hybridizing metaheuristics and mathematical programming. Annals of information systems, vol 10. Springer, Boston, pp 135–158CrossRefGoogle Scholar
  5. Caserta M, Voß S (2009) Metaheuristics: intelligent problem solving. In: Maniezzo V, Stützle T, Voß S (eds) Matheuristics: hybridizing metaheuristics and mathematical programming. Annals of information systems, vol 10. Springer, Boston, pp 1–38CrossRefGoogle Scholar
  6. Caserta M, Voß S, Sniedovich M (2011) Applying the corridor method to a blocks relocation problem. OR Spectr 33(4):915–929CrossRefGoogle Scholar
  7. Conjeo AJ, Castillo E, Mínguez R, García-Bertrand R (2006) Decomposition techniques in mathematical programming, 1st edn. Springer, Berlin/HeidelbergGoogle Scholar
  8. Dillenberger C, Escudero LF, Wollensak A, Wu Z (1994) On practical resource allocation for production planning and scheduling with period overlapping setups. Eur J Oper Res 75(2):275–286CrossRefGoogle Scholar
  9. Geoffrion AM (1972) Generalized benders decomposition. J Optim Theory Appl 10(4):237–260CrossRefGoogle Scholar
  10. Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190–206CrossRefGoogle Scholar
  11. Magnanti TL, Wong RT (1981) Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper Res 29(3):464–484CrossRefGoogle Scholar
  12. Montgomery DC (2005) Design and analysis of experiments, 6th edn. Wiley, HobokenGoogle Scholar
  13. Motwani R, Raghavan P (1995) Randomized algorithms, 1st edn. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  14. Padberg M (1988) Total unimodularity and the Euler-subgraph problem. Oper Res Lett 7(4):173–179CrossRefGoogle Scholar
  15. Raghavan P, Tompson CD (1987) Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4):365–374CrossRefGoogle Scholar
  16. Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801–817CrossRefGoogle Scholar
  17. Tukey JW (1949) Comparing individual means in the analysis of variance. Biometrics 5(2):99–114CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Filip Covic
    • 1
  1. 1.Institute for Operations Research, HBS Hamburg Business SchoolUniversity of HamburgHamburgGermany

Personalised recommendations