 |
[email protected] |
 |
3275638434 |
 |
 |
| Paper Publishing WeChat |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Tetsuroh Watanabe, Taro Kanno and Kazuo Furuta
Full-Text PDF
XML 1093 Views
DOI:10.17265/2159-5291/2018.02.001
Department of Technology Management for Innovation, School of Engineering, The University of Tokyo, Tokyo, Japan Department of Systems Innovation, School of Engineering, The University of Tokyo, Tokyo, Japan Department of Technology Management for Innovation, School of Engineering, The University of Tokyo, Tokyo, Japan
In recent years, accidents and product recalls caused by product defects have become important problems in numerous industries worldwide. Nevertheless, most existing studies have examined product recalls using empirical approaches. To improve product recall systems, we studied social simulation using a multi-agent system with a co-evolution model. This research is important because empirical approaches are no longer adequate for complex and diverse modern societies. Discussions using quantitative and predictive approaches, including agent-based simulation, are therefore expected. For this study, we used a Layered Co-evolution Model to reflect situations of the real society using producer agents and consumer agents. Additionally, we applied multi-objective optimization techniques to introduce price competition situations into an artificial society. We conducted a simulation experiment, from which we discovered the possibilities that cost reduction for huge-scale product recalls is efficient, and that punishment of producers that conduct no product recalls can benefit consumers. We believe this work can contribute to supporting not only government staff for improving product recall systems, but also executive officers of product companies for deliberating their strategies of recall decisions.
Multi-agent simulation, artificial society, multi-objective optimization, evolutionary computation, genetic programming.
Watanabe, T. 2018. Social Simulation for Analyzing Product Recall Systems Using Co-Evolution Model with Price Competition, Journal of Mathematics and System Science 8 (2018), 25-43.
[2] Abbott, H. 1991. Managing Product Recall. Pitman Publishing.
[3] Berman, B. 1999. “Planning for the Inevitable Product Recall.” Business Horizons 42 (2): 69-78.
[4] Laufer, D., and Jung, J. M. 2010. “Incorporating Regulatory Focus Theory in Product Recall Communications to Increase Compliance with a Product Recall.” Public Relations Review 36 (2): 147-51.
[5] Davidson, W. N., and Worrell, D. L. 1992. “Research Notes and Communications: The Effect of Product Recall Announcements on Shareholder Wealth.” Strategic Management Journal 13 (6): 467-73.
[6] Chen, Y., Ganesan, S., and Liu, Y. 2009. “Does a Firm’s Product-Recall Strategy Affect Its Financial Value? An Examination of Strategic Alternatives during Product-Harm Crises.” Journal of Marketing 73 (6): 214-26.
[7] Watanabe, T.,Kanno, T., and Furuta, K. 2017. “Social Simulation for Improving Product Recall Systems by Layered Co-evolution Model and Logic Value Typed Genetic Programming (in Japanese).” Transaction of the Japanese Society for Evolutionary Computation 8 (2): 36-51.
[8] Koza, J. R. 1990. Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems. Dept. of Computer Science, Stanford Univ., no. STAN-CS-90-1314.
[9] Hillis, W. D. 1990. “Co-evolving Parasites Improve Simulated Evolution as an Optimization Procedure.” Physica D: Nonlinear Phenomena 42: 228-34.
[10] Klos, T. B., and Nooteboom, B. 2001. “Agent-Based Computational Transaction Cost Economics.” Journal of Economic Dynamics and Control.
[11] Baiman, S., Fischer, P. E., and Rajan, M. V. 2001. “Performance Measurement and Design in Supply Chains.” Management Science.
[12] Mizuno, M., and Nishiyama, N. 2003. “Interacting TV Viewers: A Case of Empirical Agent-Based Modeling and Simulation for Business Applications.” Advances in Complex Systems 6 (3): 361-73.
[13] Eggermont, J., Eiben, A., and van Hemert, J. 1999. “A Comparison of Genetic Programming Variants for Data Classification.” In Proceedings of 3rd International Symposium on Advances in Intelligent Data Analysis (IDA 99), 281-90.
[14] Bojarczuka, C. C.,Lopesa, H. S., Freitasb, A. A., and Michalkiewicz, E. L. 2004. “A Constrained-Syntax Genetic Programming System for Discovering Classification Rules: Application to Medical Data Sets.” Artificial Intelligence in Medicine 30 (1): 27-48.
[15] Sakprasat, S., and Sinclair, M. C. 2007. “Classification Rule Mining for Automatic Credit Approval Using Genetic Programming.” In Proceedings of 2007 IEEE Congress on Evolutionary Computation (CEC 2007), 548-55.
[16] Łukasiewicz, J. 1920. “On Three-Valued Logic.” Ruch Filozoficzny 5: 170-1.
[17] Kleene, S. C. 1938. “On a Notation for Ordinal Numbers.” Journal of Symbolic Logic 3: 150-5.
[18] Kleene, S. C. 1952. Introduction to Metamathematics. North-Holland Publishing Co.
[19] Sobociński, B. 1952. “Axiomatization of a Partial System of Three-Valued Calculus of Propositions.” Journal of Computing Systems 1: 23-55.
[20] Ciucci, D., and Dubois, D. 2013. “A Map of Dependencies among Three-Valued Logics.” Information Sciences 250: 162-77.
[21] Deb, K. 2012. Innovization: Innovative Solution Principles Using Multiobjective Optimization. Springer-Verlag.
[22] Zitzler, E.,Laumanns, M., and Thiele, L. 2001. “SPEA2: Improving the Performance of the Strength Pareto Evolutionary Algorithm.” Technical Report 103.
[23] Deb, K., Agrawal, S.,Pratab, A., and Meyarivan, T. 2002. “A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II.” IEEE Transaction on Evolutionary Computation 2 (6): 182-97.
[24] Zhang, Q., and Li, H. 2007. “MOEA/D: A MultiobjectiveEvolutionary Algorithm Based on Decomposition.” IEEE Transactions on Evolutionary Computation 11 (6): 712-31.
[25] Deb, K., and Jain, H. 2014. “An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems with Box Constraints.” IEEE Transaction on Evolutionary Computation 18 (4): 577-601.
[26] Silverman, B. W. 1986. “Density Estimation for Statistics and Data Analysis.” In London: Chapman and Hall.
[27] MacQueen, J. 1967. “Some Methods for Classification and Analysis of Multivariate Observations.” In Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1. University of California Press, 281-97.
[28] Xu, R., and II, D. C. W. 2005. “Survey of Clustering Algorithms.” IEEE Transactions on Neural Networks 16 (3): 645–78.
[29] Thorndike, R. L. 1953. “Who Belongs in the Family?” Psychometrika 18 (4): 267-76.
[30] Ketchen, D. J., and Shook, C. L. 1996. “The Application of Cluster Analysis in Strategic Management Research: An Analysis and Critique.” Strategic Management Journal 17(60): 441-58.
[31] Goutte, C.,Toft, P.,Rostrup, E., Nielsen, F. Å., and Hansen, L. K. 1999. “On Clustering fMRI Time Series.” NeuroImage 9 (3): 298-310.
[32] Nordin, P., Francone, F., and Banzhaf, W. 1995. “Explicitly Defined Introns and Destructive Crossover in Genetic Programming.” In Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, 6-22.