An efficient imperialist competitive algorithm for solving the QFD decision problem

DOI10.1155/2016/2601561zbMath1400.90310OpenAlexW2556308876WikidataQ59131170 ScholiaQ59131170MaRDI QIDQ1792871

Xue Ji, Fupeng Yin, Qi Gao, Hengdong Guo

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/2601561

Mathematics Subject Classification ID

Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Review on nature-inspired algorithms

Cites Work

• On the optimal design of water distribution networks: a practical MINLP approach
• Extended ant colony optimization for non-convex mixed integer nonlinear programming
• A real coded genetic algorithm for solving integer and mixed integer optimization problems
• Global optimization by controlled random search
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• Managing product design quality under resource constraints
• Product design resources optimization using a non-linear fuzzy quality function deployment model
• Innovative product development process by integrating QFD and TRIZ

This page was built for publication: An efficient imperialist competitive algorithm for solving the QFD decision problem