A Lagrangian-ACO matheuristic for car sequencing

DOI10.1007/s13675-014-0023-6zbMath1305.90288OpenAlexW2028284140MaRDI QIDQ2513756

Yanyan Li

Publication date: 28 January 2015

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-014-0023-6

zbMATH Keywords

Lagrangian relaxationhybrid methodscar sequencingant colony optimisation

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (2)

A hybrid differential evolution algorithm with column generation for resource constrained job scheduling ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem

Uses Software

• Gurobi
• CSPLib
• Beam-ACO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the car sequencing problem.
• Hybrid metaheuristics. An emerging approach to optimization.
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• A beam search approach for the optimization version of the car sequencing problem
• Two ``well-known properties of subgradient optimization
• Constraint satisfaction using constraint logic programming
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• Review and comparison of three methods for the solution of the car sequencing problem
• Matheuristics
• CP with ACO
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: A Lagrangian-ACO matheuristic for car sequencing