A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise

2013-09-22 · Tkatek Said, Abdoun Otman, Abouchabaka Jaafar, Rafalia Najat

The aim of this work is to present a meta-heuristically approach of the spatial assignment problem of human resources in multi-sites enterprise. Usually, this problem consists to move employees from one site to another based on one or more criteria. Our goal in this new approach is to improve the quality of service and performance of all sites with maximizing an objective function under some managers imposed constraints. The formulation presented here of this problem coincides perfectly with a Combinatorial Optimization Problem (COP) which is in the most cases NP-hard to solve optimally. To avoid this difficulty, we have opted to use a meta-heuristic popular method, which is the genetic algorithm, to solve this problem in concrete cases. The results obtained have shown the effectiveness of our approach, which remains until now very costly in time. But the reduction of the time can be obtained by different ways that we plan to do in the next work.

📄 PDF Abstract BibTeX arXiv:1310.8588

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial Optimization

Lightweight Embeddings for Graph Collaborative Filtering

2024-03-27 · Xurong Liang, Tong Chen, Lizhen Cui, Yang Wang 외

Graph neural networks (GNNs) are currently one of the most performant collaborative filtering methods. Meanwhile, owing to the use of an embedding table to represent each user/item as a distinct vector, GNN-based recomme…

Collaborative Filtering Semantic Similarity Semantic Textual Similarity

Anytime Metaheuristic Framework for Global Route Optimization in Expected-Time Mobile Search

2025-12-23 · Jan Mikula, Miroslav Kulich arxiv

Expected-time mobile search (ETS) is a fundamental robotics task where a mobile sensor navigates an environment to minimize the expected time required to locate a hidden object. Global route optimization for ETS in stati…

A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem

2014-07-18 · Gamal Abd El-Nasser A. Said, Abeer M. Mahmoud, El-Sayed M. El-Horbaty

Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study betw…

Combinatorial Optimization

Shapley Value Based Multi-Agent Reinforcement Learning: Theory, Method and Its Application to Energy Network

2024-02-23 · Jianhong Wang

Multi-agent reinforcement learning is an area of rapid advancement in artificial intelligence and machine learning. One of the important questions to be answered is how to conduct credit assignment in a multi-agent syste…

Learning Theory Multi-agent Reinforcement Learning reinforcement-learning Reinforcement Learning

MILP for the Multi-objective VM Reassignment Problem

2021-03-18 · Takfarinas Saber, Anthony Ventresque, Joao Marques-Silva, James Thorburn 외

Machine Reassignment is a challenging problem for constraint programming (CP) and mixed-integer linear programming (MILP) approaches, especially given the size of data centres. The multi-objective version of the Machine …