Shinmyeong Kim
ABSTRACT
In the past decades, there has been a plenty of researches on multi-objective programming (MOP) problems due to the unreality of single-objective programming problems. However, multi-objective programming problems have also been discussed in terms of information security issues, the preference of people involved in decision-making and so on. A recently developed a decentralized coordination algorithm has the advantage of generating a single Pareto optimal solution under the condition that information of each agent involved in decision making is not shared. Nevertheless, this algorithm does not reflect the preference of each decision maker, and thus can generate a biased Pareto optimal solution.
Therefore, in this study, we developed a mobile application that iteratively searches the Pareto optimal solution through an interactive decentralized coordination algorithm (IDCA) by interactively exchanging agent's preference information in the realm of multi-objective linear assignment problem. An empirical study was conducted to identify factors affecting to the generation of unbiased pareto solutions with 32 human decision makers.
- Okpoti, E. S. and Jeong, I. J. 2017. A decentralized coordination algorithm for multi-objective linear programming with block angular structure. Working paper.Google Scholar
- Yan, Z., Jouandeau, N. and Cherif, A. A. 2013. A Survey and Analysis of Multi-Robot Coordination. International Journal of Advanced Robotic Systems., 10:399--416.Google ScholarCross Ref
- Sun, Y., Zhang, C., Gao, L. and Wang, X. 2011. Multi-objective optimization algorithms for flowshop scheduling problem: a review and prospects. The International Journal of Advanced Manufacturing Technology., 55:723--739Google Scholar
- Wierzbicki, A. P. 1982. A mathematical basis for satisficing decision making. Mathematical Modeling., 5:391--405Google ScholarCross Ref
- Fourman, M. P. 1985. Compaction of symbolic layout using genetic algorithms. In: Grefenstette JJ (ed) Genetic and algorithms and their applications: Proceedings of the First International Conference on Genetic Algorithms. Lawrence Erlbaum, Hillsdale, 14--153 Google ScholarDigital Library
- Lemesre, J., Dhaenens, C. and Talbi, E. G. 2007. An exact parallel method for a biobjective permutation flowshop problem. Eur J Oper Res., 177:1641--1655Google ScholarCross Ref
- Naderi, B., Zandieh, M., Balagh, A. K. G. and Roshanaei, V. 2009. An improved simulated annealing for hybrid flow shops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl., 36:9625--9633 Google ScholarDigital Library
- Gupta, J. N. 1999. Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion, Production Planning & Control, 10:3, 251--265Google ScholarCross Ref
- Coello, C. A. C., Lamont, G. B. and Van Veldhuizen, D. A. 2007. Evolutionary algorithms for solving multi-objective problems, 2nd edn, vol 2. Springer, New York, pp 5--60. Google ScholarDigital Library
- Ishibuchi, H. and Murata, T. 1998. A multi-objective genetic local search algorithm and its application to flow shop scheduling. IEEE Trans Syst Man Cybern C, 28(3):392--403 Google ScholarDigital Library
- Qian, B., Wang, L., Huang, D. X. and Wang, X. 2006. Multi-objective flow shop scheduling using differential evolution. Lect Notes Control Inf, 345:1125--1136Google Scholar
- Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., and Mirzaei, A. H. 2007. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences, 177(22), 5072--5090.Google ScholarCross Ref
- Braklow, J. W., Graham, W. W., Hassler, S. M., Peck, K. E. and Powell, W. B. 1992. Interactive optimization improves service and performance for yellow freight system. Interfaces, 22(1), 147--172. Google ScholarDigital Library
- Branke, J., Kaußler, T., and Schmeck, H. 2001. Guidance in evolutionary multi-objective optimization, Advances in Engineering Software, 32(6), 499--507.Google ScholarCross Ref
- Deb, K. and Sundar, J. 2006. Reference point based multi-objective optimization using evolutionary algorithms, In Proceedings of the 8th annual conference on Genetic and evolutionary computation, 635--642, ACM. Google ScholarDigital Library
- Miettinen, K. 2007. Using interactive multiobjective optimization in continuous casting of steel, Materials and Manufacturing Processes, 22(5), 585--593.Google ScholarCross Ref
- van Vliet, A., Boender, C. G. E. and Rinnooy Kan, A. H. 1992. Interactive optimization of bulk sugar deliveries. Interfaces, 22(3), 4--14. Google ScholarDigital Library
- Mavrotas, G. 2009. Effective implementation of the ε-constraint method in multi-objective mathematical programming problems. Applied mathematics and computation, 213(2), 455--465. Google ScholarDigital Library
- Yang, Y.C.E., Cai, X. and Stipanović, D.M. 2009. A decentralized optimization algorithm for multiagent system--based watershed management, Water resources research, 45(8).Google Scholar
- Gharaei, A., and Jolai, F. 2018. A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain, Applied Soft Computing, 65, 577--589. Google ScholarDigital Library
- Teixeira, A., Ghadimi, E., Shames, I., Sandberg, H. and Johansson, M. 2016. The ADMM algorithm for distributed quadratic problems: Parameter selection and constraint preconditioning. IEEE Transactions on Signal Processing, 64(2), 290--305.Google ScholarDigital Library
- Adhau, S., Mittal, M. L., and Mittal, A. 2012. A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach, Engineering Applications of Artificial Intelligence, 25(8), 1738--1751. Google ScholarDigital Library
Index Terms
- Interactive Multi-Objective Optimization Using Mobile Application: Application to Multi-Objective Linear Assignment Problem
Recommendations
An interactive evolutionary multi-objective optimization and decision making procedure
With the advent of efficient techniques for multi-objective evolutionary optimization (EMO), real-world search and optimization problems are being increasingly solved for multiple conflicting objectives. During the past decade of research and ...
An r-dominance-based preference multi-objective optimization for many-objective optimization
Evolutionary multi-objective optimization (EMO) algorithms have been used in finding a representative set of Pareto-optimal solutions in the past decade and beyond. However, most of Pareto domination-based multi-objective optimization evolutionary ...
Multi-objective optimization using teaching-learning-based optimization algorithm
Two major goals in multi-objective optimization are to obtain a set of nondominated solutions as closely as possible to the true Pareto front (PF) and maintain a well-distributed solution set along the Pareto front. In this paper, we propose a teaching-...
Comments