Tree search algorithms for the Sequential Ordering Problem

11/25/2019

∙

We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algorithm. It consists of an iterative Beam Search algorithm that favors search over inference and integrates dynamic programming inspired cuts. It proves optimality on half of the SOPLIB instances and finds new best known solutions on 6 among 7 open instances of the benchmark in a small amount of time.

READ FULL TEXT

Tree search algorithms for the Sequential Ordering Problem

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

The Bounded Beam Search algorithm for the Block Relocation Problem

Iterative beam search algorithms for the permutation flowshop

A UCB-based Tree Search Approach to Joint Verification-Correction Strategy for Large Scale Systems

Better Sample -- Random Subset Sum in 2^0.255n and its Impact on Decoding Random Linear Codes

Ethane: A Heterogeneous Parallel Search Algorithm for Heterogeneous Platforms

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs

Tree search algorithms for the Sequential Ordering Problem

Related Research

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

The Bounded Beam Search algorithm for the Block Relocation Problem

Iterative beam search algorithms for the permutation flowshop

A UCB-based Tree Search Approach to Joint Verification-Correction Strategy for Large Scale Systems

Better Sample -- Random Subset Sum in 2^0.255n and its Impact on Decoding Random Linear Codes

Ethane: A Heterogeneous Parallel Search Algorithm for Heterogeneous Platforms

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs