This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...

This article introduces POPMUSIC a meta heuristic that has been successfully applied to various combinatorial optimization problems This meta heuristic is especially useful for designing heuristic methods for large combinatorial problems that can be partially optimized The basic idea is to optimize sub parts of solutions until a local optimum is reached Implementations of the technique to large...

This paper browses through some well-known meta-heuristic search strategies, and briefly discusses some of their recent applications to the VLSI layout design process. It starts with very brief description of the different phases of VLSI layout design, and a brief overview of Meta-Heuristic search strategies. Since most of the VLSI layout design problems are hard optimization problems, the conc...

We present a general picture of the parallel meta-heuristic search for optimization. We recall the main concepts and strategies in designing parallel metaheuristics, pointing to a number of contributions that instantiated them for neighborhoodand populationbased meta-heuristics, and identify trends and promising research directions. We focus on cooperation-based strategies, which display remark...

This paper presents a novel efficient meta-heuristic optimization algorithm called Colliding Bodies Optimization (CBO), for optimization. This algorithm is based on one-dimensional collisions between bodies, with each agent solution being considered as an object or body with mass. After a collision of two moving bodies having specified masses and velocities, these bodies are separated with new ...

Manufacturing process planning and production scheduling functions are usually performed sequentially, disregarding the dynamic nature of manufacturing system. Integrated process planning and scheduling (IPPS) is to combine both the process planning and scheduling problems in the consideration, with the aim to improve the flexibility and adaptability of the actual process plan and the schedule ...

the markowitz’s optimization problem is considered as a standard quadratic programming problem that has exact mathematical solutions. considering real world limits and conditions, the portfolio optimization problem is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. therefore, the use of meta-heuristic methods such as neural networks and evolutionar...

In this paper, optimal design of arch dams is performed under frequency limitations. Colliding Bodies Optimization (CBO), a recently developed meta-heuristic optimization method, which has been successfully applied to several structural problems, is revised and utilized for finding the best feasible shape of arch dams. The formulation of CBO is derived from one-dimensional collisions between bo...

Local search is an integral part of many meta-heuristic strategies that solve single objective optimisation problems. Essentially, the meta-heuristic is responsible for generating a good starting point from which a greedy local search will find the local optimum. Indeed, the best known solutions to many hard problems (such as the travelling salesman problem) have been generated in this hybrid w...

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...