Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem

DOI10.3138/infor.48.1.023OpenAlexW2104642814MaRDI QIDQ6160231

Arnaud Zinflou, Caroline Gagné, Marc Gravel

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.48.1.023

zbMATH Keywords

genetic algorithmcrossoverhybrid metaheuristicinteger linear programming modelcar-sequencing problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Iterative beam search for car sequencing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• On the complexity of the car sequencing problem.
• Two local search approaches for solving real-life car sequencing problems
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• On the solution of traveling salesman problems
• Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
• Embedding branch and bound within evolutionary algorithms
• Local branching
• Variable neighborhood decomposition search
• A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
• Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
• Review and comparison of three methods for the solution of the car sequencing problem
• An Introduction to Metaheuristic Techniques
• Large neighborhood improvements for solving car sequencing problems
• Rank Transformations as a Bridge Between Parametric and Nonparametric Statistics

This page was built for publication: Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem