tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. the tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. this problem has already been so...

In this paper the recently developed meta-heuristic optimization method, known as charged system search (CSS), is utilized for optimum nodal ordering to minimize bandwidth and profile of sparse matrices. The CSS is an optimization algorithm, which is based on the governing laws of Coulomb and Gauss from electrostatics and the Newtonian mechanics of motion. The bandwidth and profile of some grap...

This paper presents a simulated annealing search procedure developed to solve job shop scheduling problems simultaneously subject to tardiness and inventory costs. The procedure is shown to signi cantly increase schedule quality compared to multiple combinations of dispatch rules and release policies, though at the expense of intense computational e orts. A meta-heuristic procedure is developed...

The 18th EURO Summer/Winter Institute (ESWI XVIII) took place during the spring 2000 in Switzerland. The topic of ESWI XVIII, ‘‘Meta-heuristics in Combinatorial Optimization’’, was selected due to its great current scientific interest: indeed, in recent years, several meta-heuristics have proved to be highly efficient for the solution of difficult combinatorial optimization problems. The Instit...

In recent decades, with the introduction of optimization problems, new methods of was optimizing developed. The most important group of optimization techniques is meta-heuristic method. That is able to solve the problems of combination optimizing. The major problems in the combination optimizing such as Dynamic Travelling Salesman Problem (DTSP) is a kind of problems that is close answer to the...

For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale optimisation problems. Up to now, several frameworks have been implemented for this family of methods. Some of them are either dedicated to Local Search such as EasyLocal++[5], Localizer[8], LocalSearch framework[1], Templar[7], HotFrame[4] or to Evolutionary Computation such as EOS[2], EASEA[3]. Th...

Search in general, and heuristic search in particular, is at the heart of many Artificial Intelligence algorithms and applications. There is now a growing and active community devoted to the empirical and theoretical study of heuristic search algorithms, thanks to the successful application of search-based algorithms to areas such as robotics, domain-independent planning, optimization, and comp...

This paper presents a Harmony Search Algorithm to seek the optimal solution of the unit maintenance scheduling. For the maintenance scheduling, cost reduction is as important as reliability. The objective function of this algorithm considers the effect of economy as well as reliability. Various constraints such as spinning reserve, duration of maintenance crew are being taken into account. We a...

In this paper, we propose the first heuristic approach for the vertex separator problem (VSP), based on Breakout Local Search (BLS). BLS is a recent meta-heuristic that follows the general framework of the popular Iterated Local Search (ILS) with a particular focus on the perturbation strategy. Based on some relevant information on search history, it tries to introduce the most suitable degree ...

In this paper we present a static mapping heuristic, called Heterogeneous Multi-phase Mapping (HMM), which allows a suboptimal mapping of a parallel program onto a metacomputer to minimize the program execution time. HMM allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application. Moreover, it uses a local search technique together w...