A Variable Neighborhood Search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, task assignment costs, and communication costs between tasks assigned to different processors. A computational study shows that the algorithm performs well in terms of time and solution quality relative to other local search procedures that have been proposed.Peer Reviewe
In this paper we consider the resource constrained project scheduling problem. We propose an evoluti...
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing proble...
This paper presents variable neighborhood search (VNS) for the problem of finding the global minimum...
A variable neighbourhood search algorithm that employs new neighbourhoods is proposed for solving a ...
A Variable Neighborhood Search algorithm is proposed for solving a task allocation problem whose mai...
In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is...
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combin...
Local search algorithms operate by making small changes to candidate solutions with the aim of reach...
Variable neighborhood search is a local search metaheuristic that uses sequentially different neighb...
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solvin...
: A variable depth search procedure (abbreviated as VDS) is a generalization of the local search met...
This paper presents a combination of variable neighbourhood search and mathematical programming to m...
For many NP-hard combinatorial optimization problems, the existence of constraints complicates the i...
This paper describes a Variable Neighbourhood Search (VNS) combined with simulated annealing to tack...
International audienceEmbedded systems have become an essential part of our lives, thanks to their e...
In this paper we consider the resource constrained project scheduling problem. We propose an evoluti...
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing proble...
This paper presents variable neighborhood search (VNS) for the problem of finding the global minimum...
A variable neighbourhood search algorithm that employs new neighbourhoods is proposed for solving a ...
A Variable Neighborhood Search algorithm is proposed for solving a task allocation problem whose mai...
In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is...
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combin...
Local search algorithms operate by making small changes to candidate solutions with the aim of reach...
Variable neighborhood search is a local search metaheuristic that uses sequentially different neighb...
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solvin...
: A variable depth search procedure (abbreviated as VDS) is a generalization of the local search met...
This paper presents a combination of variable neighbourhood search and mathematical programming to m...
For many NP-hard combinatorial optimization problems, the existence of constraints complicates the i...
This paper describes a Variable Neighbourhood Search (VNS) combined with simulated annealing to tack...
International audienceEmbedded systems have become an essential part of our lives, thanks to their e...
In this paper we consider the resource constrained project scheduling problem. We propose an evoluti...
The variable sized bin packing problem is a generalisation of the one-dimensional bin packing proble...
This paper presents variable neighborhood search (VNS) for the problem of finding the global minimum...