Beam search heuristic to solve stochastic integer problems under probabilistic constraints

Abstract This paper proposes a Beam Search heuristic strategy to solve stochastic integer programming problems under probabilistic constraints. Beam Search is an adaptation of the classical Branch and Bound method in which at any level of the search tree only the most promising nodes are kept for further exploration, whereas the remaining are pruned out permanently. The proposed algorithm has been compared with the Branch and Bound method. The numerical results collected on the probabilistic set covering problem show that the Beam Search technique is very efficient and appears to be a promising tool to solve difficult stochastic integer problems under probabilistic constraints.

[1]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[2]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3]  B. L. Miller,et al.  Chance Constrained Programming with Joint Constraints , 1965 .

[4]  András Prékopa.  Static Stochastic Programming Models , 1995 .

[5]  Suvrajeet Sen.  Relaxations for probabilistically constrained programs with discrete random variables , 1992, Oper. Res. Lett..

[6]  Wlodzimierz Ogryczak,et al.  On consistency of stochastic dominance and mean–semideviation models , 2001, Math. Program..

[7]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[8]  Wiesław Danielak,et al.  Instytucjonalne formy wspierania przedsiębiorczości , 2001 .

[9]  Tamás Rapcsák,et al.  New Trends in Mathematical Programming , 1998 .

[10]  András Prékopa,et al.  Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution , 1990, ZOR Methods Model. Oper. Res..

[11]  András Prékopa,et al.  ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .

[12]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[13]  A. Charnes,et al.  Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .

[14]  A. Prékopa,et al.  Programming Under Probabilistic Constraint with Discrete Random Variable , 1998 .

[15]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..

[16]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[17]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[18]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[19]  Patrizia Beraldi,et al.  A branch and bound method for stochastic integer problems under probabilistic constraints , 2002, Optim. Methods Softw..

[20]  András Prékopa,et al.  Contributions to the theory of stochastic programming , 1973, Math. Program..

[21]  Darinka Dentcheva,et al.  Bounds for probabilistic integer programming problems , 2002, Discret. Appl. Math..

[22]  Patrizia Beraldi,et al.  The Probabilistic Set-Covering Problem , 2002, Oper. Res..