Applying the big bang-big crunch metaheuristic to large-sized operational problems

Abstract

In this study, we present an investigation of comparing the capability of a big bang-big crunch metaheuristic (BBBC) for managing operational problems including combinatorial optimization problems. The BBBC is a product of the evolution theory of the universe in physics and astronomy. Two main phases of BBBC are the big bang and the big crunch. The big bang phase involves the creation of a population of random initial solutions, while in the big crunch phase these solutions are shrunk into one elite solution exhibited by a mass center. This study looks into the BBBC’s effectiveness in assignment and scheduling problems. Where it was enhanced by incorporating an elite pool of diverse and high quality solutions; a simple descent heuristic as a local search method; implicit recombination; Euclidean distance; dynamic population size; and elitism strategies. Those strategies provide a balanced search of diverse and good quality population. The investigation is conducted by comparing the proposed BBBC with similar metaheuristics. The BBBC is tested on three different classes of combinatorial optimization problems; namely, quadratic assignment, bin packing, and job shop scheduling problems. Where the incorporated strategies have a greater impact on the BBBC's performance. Experiments showed that the BBBC maintains a good balance between diversity and quality which produces high-quality solutions, and outperforms other identical metaheuristics (e.g. swarm intelligence and evolutionary algorithms) reported in the literature.

Learning trends in customer churn with rule-based and kernel methods

“…To get better prediction, the paper proposed the addition of integrating methods for sampling and learning processes dependent on cost with standard random forests (SRF). They also reported that IRBF produces more accuracy than other algorithms like artificial neural network, decision trees, despite its superior results in other fields [9]- [21].…”

Comparison of meta-heuristic algorithms for fuzzy modelling of COVID-19 illness’ severity classification

“…This section discusses how meta-heuristic algorithms [29], [67]- [70], [73]- [75], [82], [90], [95], [109], [119], [160], [163], [176], [179]- [188] are included in the fuzzy modelling process. The implementation of fuzzy meta-heuristic algorithms is depicted in Figure 6.…”

Neural network to solve fuzzy constraint satisfaction problems

“…The Hopfield neural network was proposed by Hopfield and Tank [14] with both discrete and continuous modes, and it has been widely used in various applications, including identification [15], pattern recognition, and optimization [16]. The continuous Hopfield neural network (CHN) has also demonstrated its ability to solve hard optimization problems [17], [18]. Our main objective in this paper is to adapt the weights and settings of the continuous Hopfield neural network to be able to solve FCSP.…”