Graph based twin cost matrices for unbalanced assignment problem with improved ant colony algorithm
In this paper, we are interested in the unbalanced assignment problem with constraints to agents. The modified Hungarian algorithm with dummy tasks and agents are most common methods to solve the unbalanced problem. However, it is impractical in the real scenarios sometimes since some tasks are unas...
Guardado en:
Autores principales: | Liuyi Wang, Zongtao He, Chengju Liu, Qijun Chen |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/1a1efaa1d7f541828267e57d6647c521 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
por: Bib Paruhum Silalahi, et al.
Publicado: (2019) -
MULTIPLE ANT COLONY SYSTEM FOR A VRP WITH TIME WINDOWS AND SCHEDULED LOADING
por: Ortega,Pablo, et al.
Publicado: (2009) -
Lyapunov Spectrum Local Assignability of Linear Discrete Time-Varying Systems by Static Output Feedback
por: Adam Czornik, et al.
Publicado: (2021) -
Relationship between radio k-chromatic number of graphs and square graphs
por: Laxman Saha
Publicado: (2021) -
A decision making approach for assignment of ecosystem services to forest management units: A case study in northwest Turkey
por: İnci Caglayan, et al.
Publicado: (2021)