Search results

The purpose of the present paper is to show a comparative analysis of classical and modern heuristics such as genetic algorithms, simulated annealing, particle swarm optimization and bacterial chemotaxis, when they are applied to electrical engineering problems.

Hybrid algorithms (HAs) obtained by a synergy between the previous listed heuristics, with the eventual addiction of the Tabu Search, have also been compared with the single heuristic performances.

Empirically, a different sensitivity for initial values has been observed by changing type of heuristics. The comparative analysis has then been performed for two kind of problems depending on the dimension of the solution space to be inspected. All the proposed comparative analyses are referred to two corresponding different cases: Preisach hysteresis model identification (high dimension solution space) and load‐flow optimization in power systems (low dimension solution space).

The originality of the paper is to verify the performances of classical, modern and hybrid heuristics for electrical engineering applications by varying the heuristic typology and by varying the typology of the optimization problem. An original procedure to design a HA is also presented.

In recent years, the demand for garments has significantly increased, requiring manufacturers to speed up their production to attract customers. Cut order planning (COP) is one of the most important processes in the apparel manufacturing industry. The appropriate stencil arrangement can reduce costs and fabric waste. The COP problem focuses on determining the size combination for a pattern, which is determined by the length of the cutting table, width, demand order, and height of the cutting equipment.

This study proposes new heuristics: genetic algorithm (GA), symbiotic organism search, and divide-and-search-based Lite heuristic and a One-by-One (ObO) heuristic to address the COP problem. The objective of the COP problem is to determine the optimal combination of stencils to meet demand requirements and minimize the total fabric length.

A comparison between our proposed heuristics and other simulated annealing and GA-based heuristics, and a hybrid approach (conventional algorithm + GA) was conducted to demonstrate the effectiveness and efficiency of the proposed heuristics. The test results show that the ObO heuristic can significantly improve the solution efficiency and find the near optimal solution for extreme demands.

This paper proposes a new heuristic, the One-by-One (ObO) heuristic, to solve the COP problem. The results show that the proposed approaches overcome the long operation time required to determine the fitting arrangement of stencils. In particular, our proposed ObO heuristic can significantly improve the solution efficiency, i.e. finding the near optimal solution for extreme demands within a very short time.

Our editorial argues that categories theory can be advanced by embracing heuristics research, and the insight that audiences often evaluate items based on multiple valued criteria. Thus, rather than building on extant theory – which suggests that categories embody specific evaluative criteria, or that audiences operate according to a set “theory of value” – the authors argue that hybrids research would benefit from attending to the underlying processes that actors use to weigh and balance the diverse considerations that guide their decisions. The authors define and discuss three commonly used heuristics (satisficing, lexicographic preferences, and elimination by aspects), and show how these might lead audiences to support different types of hybrid entities.

This study aims to address the hybrid open shop problem (HOSP) with respect to the minimization of the overall finishing time or makespan. In the HOSP, we have to process n jobs in stages without preemption. Each job must be processed once in every stage, there is a set of m_k identical machines in stage k and the production flow is immaterial.

Computational experiments carried out on a set of randomly generated instances showed that the minimal idleness heuristic (MIH) priority rule outperforms the longest processing time (LPT) rule proposed in the literature and the other proposed constructive methods on most instances.

The proposed mathematical model outperformed the existing model in the literature with respect to computing time, for small-sized instances, and solution quality within a time limit, for medium- and large-sized instances. The authors’ hybrid iterated local search (ILS) improved the solutions of the MIH rule, drastically outperforming the models on large-sized instances with respect to solution quality.

The authors formalize the HOSP, as well as argue its NP-hardness, and propose a mixed integer linear programming model to solve it. The authors propose several priority rules – constructive heuristics based on priority measures – for finding feasible solutions for the problem, consisting of adaptations of classical priority rules for scheduling problems. The authors also propose a hybrid ILS for improving the priority rules solutions.

Dynamic planning and scheduling forms a widely adopted smart strategy for solving real-world problems in diverse business systems. This paper uses deductive content analysis to explore secondary data from previous studies in dynamic planning and scheduling to draw conclusions on its current status, forward action and research needs in construction management.

The authors searched academic databases using planning and scheduling keywords without a periodic setting. This research collected secondary data from the database to draw an objective comparison of categories and conclusions about how the data relates to planning and scheduling to avoid the subjective responses from questionnaires and interviews. Then, applying inclusion and exclusion criteria, we selected one hundred and four articles. Finally, the study used a seven-step deductive content analysis to develop the categorisation matrix and sub-themes for describing the dynamic planning and scheduling categories. The authors used deductive analysis because of the secondary data and categories comparison. Using the event types represented in a quadrant mapping, authors delve into where, when, application and benefits of the classes.

The content analysis showed that all the accounts and descriptions of dynamic planning and scheduling are identifiable in an extensive research database. The content analysis reveals the need for multi-hybrid (4D BIM-Agent based-discrete event-discrete rate-system dynamics) simulation modelling and optimisation method for proffering solutions to scheduling and planning problems, its current status, tools and obstacles.

This research reveals the deductive content analysis talent in construction research. It also draws direction, focuses and raises a question on dynamic planning and scheduling research concerning the five-integrated model, an opportunity for their integration, models combined attributes and insight into its solution viability in construction.

To compare the performance of a new hybrid manufacturing system (HMS) with a conventional cellular manufacturing system (CMS). The hybrid system is a combination of the cellular manufacturing and job shop.

A hypothetical manufacturing facility with eight machines and 20 parts is used as a case. Simulation models are developed for two manufacturing systems. A multi‐factor comparison is carried out to test the performance of the systems under different scenarios.

It was found that group scheduling rules (GSR) and the manufacturing system design factors have significant impact on the performance of the system. In particular, the hybrid system shows its best performance when the MSSPT GSR is applied, whereas the cellular system is superior when DDSI is implemented. The results also demonstrate that, by adding non‐family parts to the production schedule of the HMS, significant benefits in the performance measures can be attained.

The conclusion cannot be generalized, as the result is dependent upon the input data and the size of the problem.

The application may be limited to certain industry sectors. Further studies may be needed to identify the appropriate industry.

While the majority of the literature focuses on either a job shop or a pure CMS, this paper has a distinctive approach that allows the combined use of both systems. This could be a useful transitional approach from one system to the other.

The purpose of this study is to investigate resource-constrained multi-project scheduling problems (RCMPSP) involving uncertainty in the form of time-dependent renewable resource reliability. A key focus is to minimize the makespan (completion time) of projects when resources can become unavailable or fail over time at non-constant rates. Accounting for realistic resource reliability seeks to provide scheduling solutions that better reflect potential delays in practical multi-project environments.

A new discrete-time binary integer programming formulation of RCMPSP is expanded to include time-dependent resource reliability and simultaneously evaluate the time-dependent failure rate and constant repair rate of a resource. A new hybrid immune genetic algorithm with local search (HIGALS) is developed to solve this NP-hard problem. HIGALS incorporates a new coding mechanism, initialization method and local search operator.

A case study tests the proposed HIGALS approach. The validity of the mathematical model is confirmed by solving small-sized problems with GAMS software. The proposed HIGALS algorithm is validated by solving small-sized problems and comparing its solutions with GAMS. The superiority of HIGALS is demonstrated by comparing its solutions with six basic algorithms on medium- and large-sized problems. Results show that HIGALS outperforms existing algorithms, achieving an average reduction in makespan of over 11.79%, while maintaining the advantages of genetic, immune and local search algorithms and avoiding their disadvantages.

Considering time-dependent resource reliability can help project managers plan for disruptions and delays in resource-critical projects. HIGALS provides decision support for robust multi-project scheduling.

This study contributes to the field by investigating RCMPSP with time-dependent renewable resource reliability, which reflects real-world uncertainty more accurately. HIGALS presents a novel approach to balance intensification and diversification for this challenging problem.

The purpose of this paper is to present a hybrid meta-heuristic based on genetic algorithms (GAs), simulated annealing, variable neighborhood descent and path relinking for solving the variant of the unrelated parallel machine scheduling problem considering sequence-dependent setup times.

The authors carried out computational experiments on literature problem instances proposed by Vallada and Ruiz (2011) and Arnaout et al. (2010) to test the performance of the proposed meta-heuristic. The objective function adopted was makespan minimization, and the authors used relative deviation, average and population standard deviation as performance criteria.

The results indicate the competitivity of the proposed approach and its superiority in comparison with several other algorithms. In small instances proposed by Vallada and Ruiz (2011) and on small and large instances proposed by Arnaout et al. (2010), the proposed approach presented the best results in most tested problem instances.

In small instances proposed by Vallada and Ruiz (2011) and on small and large instances proposed by Arnaout et al. (2010), the proposed approach presented the best results in most tested problem instances.

The proposed approach presented high-quality results, with an innovative hybridization of a GA and neighborhood search algorithms, tested in diverse instances of literature. Furthermore, the case study demonstrated that the proposed approach is recommended for solving real-world problems.

So far, the simplicity of heuristics has been mostly studied at the rule level. However, actors' bounded rationality implies that small bundles of rules drive behavior. This study thus conducts a conceptual elaboration around such bundling. This leads to reflections on the various processes of heuristic emergence and to qualifications of the respective characteristics of basic heuristic classes.

Determining which rules – out of many possible ones – to select in one's small bundle constitutes a difficult combinatorial problem. Fortunately, past research has demonstrated that solutions can be found in evolutionary mechanisms. Those converge toward bundles that are somewhat imperfect yet cannot be easily improved, a.k.a., locally optimal bundles. This paper therefore identifies that heuristic bundles can efficiently emerge by social evolutionary mechanisms whereby actors recursively exchange, adopt and perform bundles of rules constitute processes of heuristic emergence.

Such evolutionary emergence of socially calculated small bundles of heuristics differs from the agentic process by which some simple rule heuristics emerge or from the biological calculation process by which some behavioral biology heuristics emerge. The paper subsequently proceeds by classifying heuristics depending on their emergence process, distinguishing, on the one hand, agentic vs evolutionary mechanisms and, on the other hand, social vs biological encodings. The differences in the emergence processes of heuristics suggest the possibility of comparing them on three key characteristics – timescale, reflectivity and local optimality – which imply different forms of fitness.

The study proceeds as a conceptual elaboration; hence, it does not provide empirics. At a microlevel, it enables classification and comparison of the largest possible range of heuristics. At a macrolevel, it advocates for further exploration of managerial bundles of rules, regarding both their dynamics and their substantive nature.

In the field, practitioners are often observed to socially construct their theory of action, which emerges as a bundle of heuristics. This study demonstrates that such social calculations provide solutions that have comparatively good qualities as compared to heuristics emerging through other processes, such as agentic simple rules or instinctive – i.e. behavioral biology – heuristics. It should motivate further research on bundles of heuristics in management practice. Such an effort would improve the ability to produce knowledge fitting the absorptive capacity of practitioners and enhance the construction of normative managerial theories and pedagogy.

Bundles of rules may also play a crucial role in the emergence of collective action. This study contributes to a performativity perspective whereby theories can become reality. It demonstrates how the construction of a managerial belief system may amount to the launching of a social movement and vice versa.

Overall, many benefits accrue from integrating the bundles of rules expressed and exchanged by practitioners under the heuristic umbrella. So far, in management scholarship, such emergent objects have sometimes been interpreted as naïve or as indicative of institutional pressures. By contrast, this study shows that socially calculated bundles may efficiently combine the advantages of individuals' reflective cognitive processes with those provided by massive evolutionary exchanges. In conclusion, the social calculations of small heuristic bundles may constitute a crucial mechanism for the elaboration of pragmatic theories of action.

The purpose of this paper is to present a new mathematical model for the unrelated parallel machine scheduling problem with aging effects and multi-maintenance activities.

The authors assume that each machine may be subject to several maintenance activities over the scheduling horizon and a machine turn into its initial condition after maintenance activity and the aging effects start anew. The objective is to minimize the weighted sum of early/tardy times of jobs and maintenance costs.

As this problem is proven to be non-deterministic polynomial-time hard (NP-hard), the authors employed imperialist competitive algorithm (ICA) and genetic algorithm (GA) as solution approaches, and the parameters of the proposed algorithms are calibrated by a novel parameter tuning tool called Artificial Neural Network (ANN). The computational results clarify that GA performs better than ICA in quality of solutions and computational time.

Predictive maintenance (PM) activities carry out the operations on machines and tools before the breakdown takes place and it helps to prevent failures before they happen.