A Lagrangian-ACO matheuristic for car sequencing

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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Dhananjay Thiruvady, Andreas Ernst, Mark Wallace
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2014
Materias:	90B99 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/4a020af042ab480596db7c7205bce765
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:4a020af042ab480596db7c7205bce765
record_format	dspace
spelling	oai:doaj.org-article:4a020af042ab480596db7c7205bce7652021-12-02T05:00:41ZA Lagrangian-ACO matheuristic for car sequencing2192-440610.1007/s13675-014-0023-6https://doaj.org/article/4a020af042ab480596db7c7205bce7652014-11-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000368https://doaj.org/toc/2192-4406In 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.Dhananjay ThiruvadyAndreas ErnstMark WallaceElsevierarticle90B99Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 2, Iss 4, Pp 279-296 (2014)
institution	DOAJ
collection	DOAJ
language	EN
topic	90B99 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90B99 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Dhananjay Thiruvady Andreas Ernst Mark Wallace A Lagrangian-ACO matheuristic for car sequencing
description	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.
format	article
author	Dhananjay Thiruvady Andreas Ernst Mark Wallace
author_facet	Dhananjay Thiruvady Andreas Ernst Mark Wallace
author_sort	Dhananjay Thiruvady
title	A Lagrangian-ACO matheuristic for car sequencing
title_short	A Lagrangian-ACO matheuristic for car sequencing
title_full	A Lagrangian-ACO matheuristic for car sequencing
title_fullStr	A Lagrangian-ACO matheuristic for car sequencing
title_full_unstemmed	A Lagrangian-ACO matheuristic for car sequencing
title_sort	lagrangian-aco matheuristic for car sequencing
publisher	Elsevier
publishDate	2014
url	https://doaj.org/article/4a020af042ab480596db7c7205bce765
work_keys_str_mv	AT dhananjaythiruvady alagrangianacomatheuristicforcarsequencing AT andreasernst alagrangianacomatheuristicforcarsequencing AT markwallace alagrangianacomatheuristicforcarsequencing AT dhananjaythiruvady lagrangianacomatheuristicforcarsequencing AT andreasernst lagrangianacomatheuristicforcarsequencing AT markwallace lagrangianacomatheuristicforcarsequencing
_version_	1718400826596130816

A Lagrangian-ACO matheuristic for car sequencing

Ejemplares similares