Our paper on the "The maximum length car sequencing problem", co-authored with my outstanding undergrad students Lara Pontes and Carlos Vinícius Costa Neves, and with Prof. Maria Battarra (University of Bath), has just been published in the European Journal of Operational Research!
In this paper:
- We introduce a new variant of the car sequencing problem motivated by a real-life application, and describe how the problem can be positioned in the literature.
- We present valid combinatorial lower and upper bounds, which can be calculated in less than 0.01 s.
- We devise exact algorithms based on binary and iterative searches that yield good results when good primal bounds are not readily available.
- We implement an effective iterated local search (ILS) heuristic, with efficient intensification and diversification procedures, capable of finding high-quality solutions in a matter of seconds.
Congratulations, Lara and Carlos! You guys have worked so hard to achieve this fantastic result and I am really proud of you.
We would like to warmly thank Prof. Artur Pessoa for his valuable suggestions regarding the mathematical formulations, as well as Dr. Yuan Sun for kindly providing the set of instances used in his study, and the anonymous reviewers for the relevant insights that considerably helped to improve the quality of the paper. This research was partially supported by CNPq, Brazil, grants 406245/2021-5 and 309580/2021-8, and by the Paraíba State Research Foundation (FAPESQ), Brazil, grant 041/2023. The work reported in this paper was undertaken as part of the Made Smarter Innovation: Centre for People-Led Digitalisation, at the University of Bath, University of Nottingham, and Loughborough University. The project is funded by the Engineering and Physical Sciences Research Council (EPSRC), United Kingdom Grant EP/V062042/1.
Link for the paper: https://lnkd.in/dDpG6aay
Cadance MC
1moCongrats!