Deakin University
Browse
thiruvady-lagrangianaco-2014.pdf (363.39 kB)

A Lagrangian-ACO matheuristic for car sequencing

Download (363.39 kB)
journal contribution
posted on 2014-11-01, 00:00 authored by Dhananjay ThiruvadyDhananjay Thiruvady, A Ernst, M Wallace
In this study, we investigate a hybrid Lagrangian relaxation ant colony optimisation for optimisation version of the car sequencing problem. Several cars are required to be scheduled on an assembly line and each car requires a number of options such as sunroof and/or air conditioning. These cars are required to be sequenced such that sub-sequences of specific sizes may only include a limited number of any option. While this is usually a hard constraint, in this study we treat it as a soft constraint and further require the utilisation of options be modulated across the sequence leading to the optimisation problem. We investigate various Lagrangian heuristics, ant colony optimisation (ACO) and hybrids of these methods. The results show that the Lagrangian-ACO hybrid is the best performing method for up to 300 cars.

History

Journal

EURO journal on computational optimization

Volume

2

Pagination

279-296

Location

Berlin, Germany

ISSN

2192-4406

eISSN

2192-4414

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2014, EURO - The Association of European Operational Research Societies

Issue

4

Publisher

Springer

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC