Solving the wire-harness design problem at a European car manufacturer

DOI10.1016/j.ejor.2018.06.047zbMath1403.90682OpenAlexW2813392314WikidataQ129643415 ScholiaQ129643415MaRDI QIDQ1991185

Marie-Sklaerder Vié, Nicolas Zufferey, Jean-François Cordeau

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.047

zbMATH Keywords

combinatorial optimizationmetaheuristicscomponent commonalitycar wire harness

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG

Uses Software

• J-MEANS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient local search heuristic with row weighting for the unicost set covering problem
• The component commonality problem in a real multidimensional space: an algorithmic approach
• Lagrangian heuristic for a class of the generalized assignment problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• A genetic algorithm for the set covering problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• Tabu search for the multilevel generalized assignment problem
• A class of greedy algorithms for the generalized assignment problem
• Tabu search - wellsprings and challenges
• Greedy randomized adaptive search procedures
• The costs and benefits of commonality in assemble-to-order systems with a \((Q,r)\)-policy for component replenishment
• A genetic algorithm approach to cluster analysis.
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Analysis of an industrial component commonality problem
• A 3-flip neighborhood local search for the set covering problem
• A path relinking approach with ejection chains for the generalized assignment problem
• Using decomposition to improve greedy solutions of the optimal diversity management problem
• A survey on vertex coloring problems
• An efficient heuristic for large set covering problems
• Variable neighborhood search for the p-median
• A genetic algorithm for the generalised assignment problem
• Note: A local-search heuristic for large set-covering problems
• The Optimal Diversity Management Problem
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications
• A tabu search heuristic for the generalized assignment problem
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: Solving the wire-harness design problem at a European car manufacturer