2019•arXiv (Cornell University)Open access

Tree search algorithms for the Sequential Ordering Problem

Luc Libralesso, Abdel-Malik Bouhassoun, Hadrien Cambazard, Vincent Jost

Abstract

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Beam search, Search tree, Benchmark (surveying), Iterative deepening depth-first search, Tree (set theory), Computer science, Optimal binary search tree, Search algorithm