A cost-aware QFD decision-making problem using guided firefly algorithm

Mahdi Jan Baemani, Amin Jula, Elankovan A Sundararajan

Research output: Contribution to journalArticle

Abstract

Satisfaction of customers is one of the ultimate goals of most companies and industries that may lead to increasing the amount of sales and earning revenue. Quality Function Deployment (QFD) as a well-known process for reaching this goal is applied in the literature. To apply QFD, it is necessary to solve QFD Decision-Making Problem (QFDDMP) in which using house of quality; engineers try to find the best solution among all possible solutions that satisfies customer requirements with minimal budget and time. In real problems, because of the abundant number of customers, customer requirements and constraints QFDDMP is known is an NP-hard optimization problem. Hence, it is required to apply efficient heuristic algorithms to solve the problem. In this study, by applying virtual attractiveness an improved version of Firefly Algorithm is proposed for solving QFDDMP. Virtual attractiveness is actually an attractiveness larger than the real amount to be given some fireflies to attract more fireflies and faster, to increase the speed of local search around them. Comparison of the obtained result to genetic algorithm, Particle Swarm Optimization and classic version of firefly algorithm it is proved that Guided Firefly Algorithm (GFA) could reach better solutions for QFDDMP with focus on minimizing the cost of the solutions.

Original languageEnglish
Pages (from-to)3466-3470
Number of pages5
JournalResearch Journal of Applied Sciences, Engineering and Technology
Volume7
Issue number17
Publication statusPublished - 2014

Fingerprint

Quality function deployment
Decision making
Costs
Heuristic algorithms
Particle swarm optimization (PSO)
Industry
Sales
Genetic algorithms
Engineers

Keywords

  • Firefly algorithm
  • NP-hard problem
  • QFD
  • Quality function deployment

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)

Cite this

A cost-aware QFD decision-making problem using guided firefly algorithm. / Baemani, Mahdi Jan; Jula, Amin; A Sundararajan, Elankovan.

In: Research Journal of Applied Sciences, Engineering and Technology, Vol. 7, No. 17, 2014, p. 3466-3470.

Research output: Contribution to journalArticle

@article{95b4921042b84a12998eb831fd6f691a,
title = "A cost-aware QFD decision-making problem using guided firefly algorithm",
abstract = "Satisfaction of customers is one of the ultimate goals of most companies and industries that may lead to increasing the amount of sales and earning revenue. Quality Function Deployment (QFD) as a well-known process for reaching this goal is applied in the literature. To apply QFD, it is necessary to solve QFD Decision-Making Problem (QFDDMP) in which using house of quality; engineers try to find the best solution among all possible solutions that satisfies customer requirements with minimal budget and time. In real problems, because of the abundant number of customers, customer requirements and constraints QFDDMP is known is an NP-hard optimization problem. Hence, it is required to apply efficient heuristic algorithms to solve the problem. In this study, by applying virtual attractiveness an improved version of Firefly Algorithm is proposed for solving QFDDMP. Virtual attractiveness is actually an attractiveness larger than the real amount to be given some fireflies to attract more fireflies and faster, to increase the speed of local search around them. Comparison of the obtained result to genetic algorithm, Particle Swarm Optimization and classic version of firefly algorithm it is proved that Guided Firefly Algorithm (GFA) could reach better solutions for QFDDMP with focus on minimizing the cost of the solutions.",
keywords = "Firefly algorithm, NP-hard problem, QFD, Quality function deployment",
author = "Baemani, {Mahdi Jan} and Amin Jula and {A Sundararajan}, Elankovan",
year = "2014",
language = "English",
volume = "7",
pages = "3466--3470",
journal = "Research Journal of Applied Sciences, Engineering and Technology",
issn = "2040-7459",
publisher = "Maxwell Scientific Publications",
number = "17",

}

TY - JOUR

T1 - A cost-aware QFD decision-making problem using guided firefly algorithm

AU - Baemani, Mahdi Jan

AU - Jula, Amin

AU - A Sundararajan, Elankovan

PY - 2014

Y1 - 2014

N2 - Satisfaction of customers is one of the ultimate goals of most companies and industries that may lead to increasing the amount of sales and earning revenue. Quality Function Deployment (QFD) as a well-known process for reaching this goal is applied in the literature. To apply QFD, it is necessary to solve QFD Decision-Making Problem (QFDDMP) in which using house of quality; engineers try to find the best solution among all possible solutions that satisfies customer requirements with minimal budget and time. In real problems, because of the abundant number of customers, customer requirements and constraints QFDDMP is known is an NP-hard optimization problem. Hence, it is required to apply efficient heuristic algorithms to solve the problem. In this study, by applying virtual attractiveness an improved version of Firefly Algorithm is proposed for solving QFDDMP. Virtual attractiveness is actually an attractiveness larger than the real amount to be given some fireflies to attract more fireflies and faster, to increase the speed of local search around them. Comparison of the obtained result to genetic algorithm, Particle Swarm Optimization and classic version of firefly algorithm it is proved that Guided Firefly Algorithm (GFA) could reach better solutions for QFDDMP with focus on minimizing the cost of the solutions.

AB - Satisfaction of customers is one of the ultimate goals of most companies and industries that may lead to increasing the amount of sales and earning revenue. Quality Function Deployment (QFD) as a well-known process for reaching this goal is applied in the literature. To apply QFD, it is necessary to solve QFD Decision-Making Problem (QFDDMP) in which using house of quality; engineers try to find the best solution among all possible solutions that satisfies customer requirements with minimal budget and time. In real problems, because of the abundant number of customers, customer requirements and constraints QFDDMP is known is an NP-hard optimization problem. Hence, it is required to apply efficient heuristic algorithms to solve the problem. In this study, by applying virtual attractiveness an improved version of Firefly Algorithm is proposed for solving QFDDMP. Virtual attractiveness is actually an attractiveness larger than the real amount to be given some fireflies to attract more fireflies and faster, to increase the speed of local search around them. Comparison of the obtained result to genetic algorithm, Particle Swarm Optimization and classic version of firefly algorithm it is proved that Guided Firefly Algorithm (GFA) could reach better solutions for QFDDMP with focus on minimizing the cost of the solutions.

KW - Firefly algorithm

KW - NP-hard problem

KW - QFD

KW - Quality function deployment

UR - http://www.scopus.com/inward/record.url?scp=84901334745&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901334745&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84901334745

VL - 7

SP - 3466

EP - 3470

JO - Research Journal of Applied Sciences, Engineering and Technology

JF - Research Journal of Applied Sciences, Engineering and Technology

SN - 2040-7459

IS - 17

ER -