Some metaheuristic algorithms for solving multiple cross-functional team selection problems
We can find solutions to the team selection problem in many different areas. The problem solver needs to scan across a large array of available solutions during their search. This problem belongs to a class of combinatorial and NP-Hard problems that requires an efficient search algorithm to maintain...
Saved in:
Main Authors: | Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N. |
---|---|
Format: | Article |
Published: |
PeerJ Inc.
2022
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85136665747&doi=10.7717%2fPEERJ-CS.1063&partnerID=40&md5=6a40d5e781d6b8785eba9ff692cb75b5 http://eprints.utp.edu.my/33783/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some metaheuristic algorithms for solving multiple cross-functional team selection problems
by: Ngo, Son Tung, et al.
Published: (2022) -
Some Metaheuristics for Tourist Trip Design Problem
by: Son, Ngo Tung, et al.
Published: (2023) -
Metaheuristic algorithms based on compromise programming for the multi-objective urban shipment problem
by: Ngo, Tung Son, et al.
Published: (2022) -
Some Metaheuristics for Tourist Trip Design Problem
by: Son, N.T., et al.
Published: (2023) -
Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem
by: Ngo, T.S., et al.
Published: (2022)