科研之友
微信
新浪微博
Facebook
分享链接
摘要
We present a new algorithm that uses both local branching and Monte Carlo sampling in a multidescent search strategy for solving 0-1 integer stochastic programming problems. This procedure is applied to the single-vehicle routing problem with stochastic demands. Computational results show the effectiveness of this new approach to solving hard instances of the problem.
- 出版日期2010-2
