Work

Tree search algorithms for the Sequential Ordering Problem

Year: 2019

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1911.12427

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

Institution: Laboratoire des Sciences pour la Conception, l'Optimisation et la Production

Language: English

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2989674298

Cites: 34

Cited by: 5

Related to: 20