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,

References

1. Akao, Y., 1966. Development History of Quality Function Deployment. The Customer Driven Approach to Quality Planning and Deployment. Asian Productivity Organization, Minato, Tokyo 107 Japan, pp: 339.
   
2. Akao, Y., 2004. Product quality and work quality. Proceeding of the 9th International Conference on ISO 9000 and TQM, pp: 246-253.
   
3. Bai, H. and C.K. Kwong, 2003. Inexact genetic algorithm approach to target values setting of engineering requirements in QFD. Int. J. Prod. Res., 41: 3861-3881.
   CrossRef    
4. Chan, L.K. and M.L. Wu, 2002. Quality function deployment: A literature review. Eur. J. Oper. Res., 143: 463-497.
   CrossRef    
5. Ching-Hsue, C., 1999. A simple fuzzy group decision making method. Proceeding of IEEE International, Fuzzy Systems Conference (FUZZ-IEEE '99), pp: 910-915.
   CrossRef    
6. Hauser, J.R. and D. Clausing, 1988. The House of Quality. HBR Reprint 88307. Harvard Business School Publishing, Boston.
   
7. Huang, G.Q., X.Y. Zhang and L. Liang, 2005. Towards integrated optimal configuration of platform products, manufacturing processes and supply chains. J. Oper. Manage., 23(3-4): 267-290.
   CrossRef    
8. Jula, A., N.K. Naseri and A.M. Rahmani, 2010. Gravitational Attraction Search with Virtual Mass (GASVM) to solve static grid job scheduling problem. J. Math. Comput. Sci., 1(4): 305-312.
   
9. Kahraman, C., T. Ertay and G. B�y�k�zkan, 2006. A fuzzy optimization model for QFD planning process using analytic network approach. Eur. J. Oper. Res., 171: 390-411.
   CrossRef    
10. Li, R.J., 1999. Fuzzy method in group decision making. Comput. Math. Appl., 38: 91-101.
    CrossRef    
11. Liu, C.H., 2010. A group decision-making method with fuzzy set theory and genetic algorithms in quality function deployment. Qual. Quant., 44: 1175-1189.
    CrossRef    
12. MBAskool-Community, 2013. House of Quality, Business Article, MBA Skool-Study.Learn.Share. [Online].
    Direct Link
13. The-QFD-Institute, 2013. What is QFD? [Online]. QFD Institute. (Accessed on: 6 Aug 2013).
    Direct Link
14. Tian, N. and A.D. Che, 2007. Goal programming in quality function deployment using genetic algorithm. Proceeding of International Conference on Management Science and Engineering (ICMSE, 2007), pp: 482-487.
    
15. Yang, X.S., 2010. Nature-inspired Metaheuristic Algorithms: Second Edition. Luniver Press, Frome.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.