Preface The interface between computer science and operations research has drawn much attention recently especially in optimization which is a main tool in operations research. In optimization area, the interest on this interface has rapidly increased in the last few years in order to develop nonstandard algorithms that can deal with optimization problems which the standard optimization techniq...

For years, extensive research has been in the binarization of continuous metaheuristics for solving binary-domain combinatorial problems. This paper is a continuation previous review and seeks to draw comprehensive picture various ways binarize this type metaheuristics; study uses standard systematic consisting analysis 512 publications from 2017 January 2022 (5 years). The work will provide th...

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

In recent years, there has been a great deal of interest in metaheuristics in the optimization community. Tabu Search (TS) represents a popular class of metaheuristics. However, compared with other metaheuristics like genetic algorithm and simulated annealing, contributions of TS that deals with continuous problems are still very limited. In this paper, we introduce a continuous TS called Direc...

This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop is the combination of Job Shop, Flow Shop and Open Shop scheduling problems. The sample i...

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably mor...

Abstract Initialization of metaheuristics is a crucial topic that lacks comprehensive and systematic review the state art. Providing such requires in‐depth study knowledge advances challenges in broader field metaheuristics, especially with regard to diversification strategies, order assess proposed methods provide insights for initialization. Motivated by aforementioned research gap, we relate...

The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, ...

This paper addresses the similarity assessment and the retrieval problems in Case-Based Reasoning for case bases consisting of traditional and generalized cases. Previous work focussed on similarity assessment for generalized cases with continuous domains. The similarity assessment problem was formulated as Nonlinear Programm (NLP), which is well known in mathematical optimization. In several r...

In the present study the efficiency of Big Bang-Big Crunch (BB-BC) algorithm is investigated in discrete structural design optimization. It is shown that a standard version of the BB-BC algorithm is sometimes unable to produce reasonable solutions to problems from discrete structural design optimization. Two reformulations of the algorithm, which are referred to as modified BB-BC (MBB-BC) and e...