File(s) under permanent embargo
Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing
journal contribution
posted on 2020-05-02, 00:00 authored by Dhananjay ThiruvadyDhananjay Thiruvady, Kerri Morgan, A Amir, A T Ernst© 2019, © 2019 Informa UK Limited, trading as Taylor & Francis Group. We investigate the problem of scheduling a sequence of cars to be placed on an assembly line. Stations, along the assembly line install options (e.g. air conditioning), but have limited capacities, and hence cars requiring the same options need to be distributed far enough apart. The desired separation is not always feasible, leading to an optimisation problem that minimises the violation of the ideal separation requirements. In order to solve the problem, we use a large neighbourhood search (LNS) based on mixed integer programming (MIP). The search is implemented as a sliding window, by selecting overlapping subsequences of manageable sizes, which can be solved efficiently. Our experiments show that, with LNS, substantial improvements in solution quality can be found.
History
Journal
International journal of production researchPublisher
Taylor & FrancisLocation
Abingdon, Eng.Publisher DOI
ISSN
0020-7543eISSN
1366-588XLanguage
engNotes
In pressPublication classification
C1 Refereed article in a scholarly journalCopyright notice
2019, Informa UK LimitedUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC