Instance space analysis for the car sequencing problem

DOI10.1007/S10479-022-04860-8MaRDI QIDQ6638878zbMATH OpenFDO

Authors Yu-An Sun, Samuel Esler, Dhananjay Thiruvady, Andreas T. Ernst, Xiaodong Li, Kerri Morgan

Publication date 14 November 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-022-04860-8

zbMATH Keywords

machine learningcombinatorial optimizationalgorithm selectioncar sequencinginstance space analysis

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Artificial intelligence (68Txx) Mathematical programming (90Cxx)

Recommendations

• Instance space analysis and algorithm selection for the job shop scheduling problem
• Review and comparison of three methods for the solution of the car sequencing problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• scientific article; zbMATH DE number 2079896

Cites work

• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 1961994 (Why is no real title available?)
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• A Lagrangian-ACO matheuristic for car sequencing
• A beam search approach for the optimization version of the car sequencing problem
• A self-adaptive multi-engine solver for quantified Boolean formulas
• ASlib: a benchmark library for algorithm selection
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Ant colony optimization.
• CP with ACO
• Instance spaces for machine learning classification
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Iterative beam search for car sequencing
• On the complexity of the car sequencing problem.
• Review and comparison of three methods for the solution of the car sequencing problem
• SATzilla: portfolio-based algorithm selection for SAT
• Scikit-learn: machine learning in Python
• Solving a cutting-stock problem with the constraint logic programming language CHIP
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Towards objective measures of algorithm performance across instance space
• Visualizing data using t-SNE

Cited in

(1)

• Machine scheduling instance generation by reverse engineering from instance space analysis

This page was built for publication: Instance space analysis for the car sequencing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638878)