Abstract
The aim of this paper is to study the problem of sequencing a set of vehicles within an industrial environment considering the assembly shop objectives, but also the objectives of the paint shop. The first approach is to solve the problem with a mono-objective function. One heuristic (a progressive, construction-sequence algorithm) and three meta-heuristics (simulated annealing, variable neighbourhood search and an evolutionary algorithm) are described and compared. As the mono-objective approach has limited possibilities, a multi-objective heuristic is finally presented and tested. Because of the industrial context of this research, the computation time is a decisive factor to select the appropriate heuristic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
