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...

Nature Inspired Meta-Heuristic algorithms are proved to be beneficial for solving real world combinatorial problems such as minimum spanning tree, knapsack problem, process planning problems, load balancing and many more. In this research work, existing meta-heuristic approaches are discussed. Due to astonishing feature of echolocation, bat algorithm has drawn major attention in recent years an...

This paper summarizes our position on the use of AI–based techniques applied to the development and support of metaknowledge. Our intent is to derive higher level abstractions using current heuristic methods to the goal of plan development and selection. A generalized framework is discussed, allowing for development of strategic plans coupled with an interchangeable learning mechanism. Along wi...

this paper deals with the product mix problem using the concept of theory of constraints (toc). theory of constraints is one of the most efficient approaches which have been applied to solve the product mix problem heuristically. although there are numerous heuristic and meta-heuristics to solve this problem, finding the optimal solution in a reasonable time is still a challenging issue. in thi...

Meta-heuristics are high-level approaches developed to discover a heuristic that provides reasonable solution many varieties of optimization problems. The classification problems contain sort problem. Simply, the objective herein is reduce number misclassified instances. In this paper, question whether meta-heuristic methods can be used construct linear models or not answered. To end, Particle ...

Assembly line balancing problem (ALBP) is a decision problem arising when designing or redesigning an assembly line and it consists in finding the optimal assignment of tasks among the workstations corresponding to some objectives. This paper deals with the single-model ALBP with the aim of minimizing the cycle time and maximizing the workload smoothness among the workstations. In order to solv...

Article history: Received 1 April 2010 Received in revised form 22 July 2010 Accepted 30 July 2010 Available online 1 Auguest 2010 Meta-heuristic approaches are general algorithmic framework, often nature-inspired and designed to solve NP-complete optimization problems in cellular manufacturing systems and has been a growing research area for the past two decades. This paper discusses various m...

Genetic and simulated annealing algorithms have been used to solve many combinatorial problems. Their results are proven to be efficient in solving such problems. The running time of these techniques is generally less than the run time needed to find the optimal solution. However, in very large-scale problems such as sensor deployment, their running time is extremely slow. In this paper, we int...

University timetabling problems can be classified into two main categories: course and examination timetabling. We discuss the problem statements and constraints for each of them and provide an overview of some recent research advances that have been made by the authors and members of their research team. We particularly concentrate upon: • Meta-heuristic approaches that are less dependent upon...

We evaluate three different approaches to road network partitioning for simulation. The first approach consists of algorithms that rely on dividing the road physical network spatially into rectangular blocks of different sizes. Our second approach uses a graph representation of the road network, and uses meta-heuristic search algorithms to partition the graph. The final hybrid scheme builds clu...