Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

In spite of the widespread importance of nonlinear and parametric optimization, many standard solution methods allow a large gap between local optimality and global optimality, inviting consideration of metaheuristics capable of reducing such gaps. We identify ways to apply the tabu search metaheuristic to nonlinear optimization problems from both continuous and discrete settings. The step beyo...

The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve th...

Guided Local Search (GLS) is an intelligent search scheme for combinatorial optimization problems. A main feature of the approach is the iterative use of local search. Information is gathered from various sources and exploited to guide local search to promising parts of the search space. The application of the method to the Travelling Salesman Problem and the Quadratic Assignment Problem is exa...

This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. This problem allows lateness at customer locations although a penalty is then incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the tabu search, a neighborhood of the current solution is crea...

The dynamic space allocation problem (DSAP) presented in this paper considers the task of assigning items (resources) to locations during a multi-period planning horizon such that the cost of rearranging the items is minimized. Three tabu search heuristics are presented for this problem. The first heuristic is a simple basic tabu search heuristic. The second heuristic adds diversification and i...

This paper introduces tabu search for the solution of general linear integer problems. Search is done on integer variables; if there are continuous variables, their corresponding value is determined through the solution of a linear program, which is also used to evaluate the integer solution. The complete tabu search procedure includes an intensification and diversification procedure, whose eff...

In this work, a new scatter search-based approach is studied for the NP-Hard satisfiability problems, in particular for its optimization version namely max-SAT. The paper describes a scatter search algorithm enhanced with a tabu search component combined with a uniform crossover operator. The latter is used to identify promising search regions while tabu search performs an intensified search of...