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...
Guardado en:
Autores principales: | Dhananjay Thiruvady, Andreas Ernst, Mark Wallace |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/4a020af042ab480596db7c7205bce765 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Special issue on: “matheuristics”
por: Claudia Archetti, et al.
Publicado: (2014) -
A survey on matheuristics for routing problems
por: Claudia Archetti, et al.
Publicado: (2014) -
Lagrangian decompositions for the two-level FTTx network design problem
por: Andreas Bley, et al.
Publicado: (2013) -
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
por: Rahma Lahyani, et al.
Publicado: (2017) -
Portfolio optimization with pw-robustness
por: Virginie Gabrel, et al.
Publicado: (2018)