作者: Keunho Choi , Gunwoo Kim , Yongmoo Suh , Donghee Yoo
DOI: 10.1007/S10257-016-0328-5
关键词: Genetic algorithm 、 Branch and bound 、 Optimization problem 、 Computer science 、 Mathematical optimization 、 Business environment 、 Artificial intelligence 、 Information Systems
摘要: As firms encounter new problems in the fast-changing business environment, they have to find collaborators with problem-solving expertise. Since this optimization problem takes place a firm as environment changes, genetic algorithm (GA), which has shown outstanding performance obtaining sub-optimal solution relatively quickly, seems be right solution, one that is superior goal-programming, multi-attribute decision making, and branch bound. We therefore propose GA-based approach solving of assigning multiple problems. Our worked well several experiments.