Stochastic Offline Programming

We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment which helps the developer choose heuristic advisors that guide the search for satisfying or optimal solutions. In particular, we consider the case where the developer has several heuristic advisors available. Rather than selecting a single heuristics, we propose that one of the heuristics is chosen randomly whenever the heuristic guidance is sought. The task of SOP is to learn favorable instance-specific distributions of the heuristic advisors in order to boost the average-case performance of the resulting combinatorial algorithm.

• Type: Journal
• Year: 2009
• Where: ICTAI
• Authors: Yuri Malitsky, Meinolf Sellmann
• Keywords: Artificial Intelligence, Combinatorial Algorithm, Heuristic, Heuristic Advisors, ICTAI 2009