In this paper, the uncapacitated facility location problem is considered. A tabu search algorithm for solving this problem is proposed. The algorithm is tested on some standard test problems taken from literature and its performance is compared with the known optimal solutions. Computational results show that the proposed algorithm produces optimal solutions for all test problems, and that it is very efficient in terms of time compared to existing algorithms in the literature
Abstract In this paper, a leader–follower competitive facility location problem considering the reac...
A fundamental facility location problem is to choose the location of facilities, such as industrial ...
We give a modified version of a heuristic, available in the relevant literature, of the capacitated ...
The uncapacitated facility location problem is one of choosing sites among a set of candidates in wh...
The uncapacitated facility location problem (UFLP) is a problem that has been studied intensively in...
The uncapacitated warehouse location problem (UWLP) has been studied heavily in mathematical progra...
A tabu search heuristic procedure for the capacitated facility location problem is developed, implem...
We study local search algorithms for metric instances of facility location problems: the uncapacitat...
In this work, a tabu search algorithm for solving uncapacitated location problems is presented. The ...
Resumo: Localização de facilidades é uma das atividades da área de logística que envolve decisões do...
Abstract Facility location problem (FLP) is a mathematical way to optimally locate facilities within...
We present a multistart heuristic for the uncapacitated facility location problem, based on a very ...
A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optim...
In this paper, we propose and analyze a local search algorithm for the capacitated facility location...
The objective of the present paper is to review my personal contributions in the field of uncapacita...
Abstract In this paper, a leader–follower competitive facility location problem considering the reac...
A fundamental facility location problem is to choose the location of facilities, such as industrial ...
We give a modified version of a heuristic, available in the relevant literature, of the capacitated ...
The uncapacitated facility location problem is one of choosing sites among a set of candidates in wh...
The uncapacitated facility location problem (UFLP) is a problem that has been studied intensively in...
The uncapacitated warehouse location problem (UWLP) has been studied heavily in mathematical progra...
A tabu search heuristic procedure for the capacitated facility location problem is developed, implem...
We study local search algorithms for metric instances of facility location problems: the uncapacitat...
In this work, a tabu search algorithm for solving uncapacitated location problems is presented. The ...
Resumo: Localização de facilidades é uma das atividades da área de logística que envolve decisões do...
Abstract Facility location problem (FLP) is a mathematical way to optimally locate facilities within...
We present a multistart heuristic for the uncapacitated facility location problem, based on a very ...
A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optim...
In this paper, we propose and analyze a local search algorithm for the capacitated facility location...
The objective of the present paper is to review my personal contributions in the field of uncapacita...
Abstract In this paper, a leader–follower competitive facility location problem considering the reac...
A fundamental facility location problem is to choose the location of facilities, such as industrial ...
We give a modified version of a heuristic, available in the relevant literature, of the capacitated ...