Solving the wire-harness design problem at a European car manufacturer
type: Item
instance of: scholarly article
title: Solving the wire-harness design problem at a European car manufacturer
zbMATH Open document ID: 1403.90682
author: Marie-Sklaerder Vié
author: Nicolas Zufferey
author: Jean-François Cordeau
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6968091
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: component commonality
zbMATH Keywords: car wire harness
describes a project that uses: J-MEANS
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.06.047
OpenAlex ID: W2813392314
cites work: Using decomposition to improve greedy solutions of the optimal diversity management problem
cites work: Q4735035
cites work: A genetic algorithm for the set covering problem
cites work: A genetic algorithm for the generalised assignment problem
cites work: The Optimal Diversity Management Problem
cites work: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
cites work: A genetic algorithm approach to cluster analysis.
cites work: A tabu search heuristic for the generalized assignment problem
cites work: Greedy randomized adaptive search procedures
cites work: An efficient local search heuristic with row weighting for the unicost set covering problem
cites work: Q4198056
cites work: Handbook of metaheuristics
cites work: Tabu search - wellsprings and challenges
cites work: Variable neighborhood search for the p-median
cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering
cites work: Variable neighborhood search: Principles and applications
cites work: The costs and benefits of commonality in assemble-to-order systems with a \((Q,r)\)-policy for component replenishment
cites work: Note: A local-search heuristic for large set-covering problems
cites work: A cooperative parallel tabu search algorithm for the quadratic assignment problem
cites work: Analysis of an industrial component commonality problem
cites work: Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
cites work: Tabu search for the multilevel generalized assignment problem
cites work: Lagrangian heuristic for a class of the generalized assignment problems
cites work: A survey on vertex coloring problems
cites work: The component commonality problem in a real multidimensional space: an algorithmic approach
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: A class of greedy algorithms for the generalized assignment problem
cites work: An efficient heuristic for large set covering problems
cites work: A path relinking approach with ejection chains for the generalized assignment problem
cites work: A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
cites work: A 3-flip neighborhood local search for the set covering problem
Wikidata QID: Q129643415
DOI: 10.1016/J.EJOR.2018.06.047
description: scientific article; zbMATH DE number 6968091