A column generation approach and new bounds for the car sequencing problem

DOI10.1007/S10479-017-2663-4MaRDI QIDQ1639282zbMATH OpenOpenAlexFDO

Authors Eivind Jahren, Roberto Asín Achá

Publication date 12 June 2018

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

Full work available at URL https://doi.org/10.1007/s10479-017-2663-4

zbMATH Keywords

column generationcombinatorial optimizationindustrial car sequencinginteger linear programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Two local search approaches for solving real-life car sequencing problems
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Soft car sequencing with colors: lower bounds and optimality proofs

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Branch-and-price: Column generation for solving huge integer programs
• Greedy approach and multi-criteria simulated annealing for the car sequencing problem
• scientific article; zbMATH DE number 1961994 (Why is no real title available?)
• Soft car sequencing with colors: lower bounds and optimality proofs
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Two local search approaches for solving real-life car sequencing problems

Cited in

(6)

• A solution method for a car fleet management problem with maintenance constraints
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
• A Lagrangian-ACO matheuristic for car sequencing
• 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
• Analysis and design of sequencing rules for car sequencing

This page was built for publication: A column generation approach and new bounds for the car sequencing problem

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