Problem definition: The car resequencing problem involves rearranging the sequence of cars between two adjacent production shops via an intermediate buffer. This study explores a new variant that aims to minimize the resequencing makespan when the buffer features several forward lanes and a return lane (RL). Both types...
This paper analyses the Stochastic Team Orienteering Problem (STOP), a stochastic variant of the Team Orienteering Problem (TOP). In the STOP, travel times are represented by random variables. The objective is to determine a set of routes that maximises the expected collected profit. We model the problem as a two-stage...
Alberto Guastalla, Jean-François Côté, R. Aringhieri· 0 citations
This work proposes an exact algorithm for the SSP, namely the Combinatorial Branch-and-Bound (C-B\&B) algorithm, which combines two distinct branch-and-bound algorithms, each introducing novel features compared with the existing literature.
Alberto Locatelli, Jean-François Côté, Leandro C. Coelho· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.