Search results

This study analyses the sequence of actions carried out by successful enterprises in the agricultural sector and aims to understand the logic followed with such actions and the differences related to the types of families that develop them.

Through a multiple case study approach, the business and family trajectories of 14 successful agricultural enterprises in Mexico were analysed. The actions carried out by enterprises are conceptualized as strategic movements and are classified into seven categories: (1) growth and intensification, (2) reconversion, (3) diversification, (4) integration, (5) differentiation, (6) outsourcing and (7) digitization. Depending on their relationship with agriculture, entrepreneurial families are classified into three categories: (1) continuing families, (2) returning families and (3) incoming families.

The entrepreneurship logic follows three stages: evaluation, expansion and consolidation, through which different activities are tested, then the one that produces the best results is expanded and adopted as the main activity, and finally the expansion of the main activity and its evaluation are combined by comparing and complementing it with other agricultural activities. The difference is that continuing families adhere more to the traditional productivist model based on growth in scale and improved productivity of primary production. On the other hand, actions that imply a distinction in the quality of production such as integration and differentiation and that require links with other organizations such as outsourcing are more frequently carried out by returning and incoming families.

The findings obtained through case studies cannot be statistically generalized to a specific population, however, our perspective can be transferred to other cases to obtain analogous findings.

The study is a unique piece in terms of the analysis of how families with different degrees of proximity to agriculture develop successful enterprises.

This paper aims to investigate and review adaptation measures in the livestock sector from 21 African countries through literature survey and grounded theory approaches. The adaptation themes that emerged captured essence of measures and experience drawn from varied country submissions and contexts instituted to make the livestock sector climate compatible in as far as adaptation is concerned.

Literature survey approach was used on the impacts of climate change on livestock and a review of the submitted adaptation measures. The study used grounded theory approach to derive meaning from the retrieved information. The grounded theory was derived inductively through systematic collection and analysis of data pertaining to the submitted National Communications reports. The retrieved themes were then examined and interpreted to give meaning and draw conclusions through coding, conceptualizing, categorizing and theorizing.

Results identify eight adaptation themes: carrying capacity and policies; integrated pasture management; capacity building, extension, training, awareness and information sharing; livestock breeding, diversification and intensification; disease, vectors and parasites management; technology, innovation, research and development; alternative livelihood; and water supply. The findings show that African Governments have been implementing effective adaptation measures for food security through building a climate resilient livestock production system.

This study is one of the first to lead to recommendations that decision- and policymakers, private sectors, relevant stakeholders and government officials and scientists should play a key role in ensuring that adaptation measures reach farmers, herders at grassroots level. In addition, governments should create an enabling environment (policies) in climate change adaptation to improve food security. These recommendations might be helpful in many communities where adaptation to climate change is a pressing issue.

In recent decades, development of effective methods for optimizing a set of conflicted objective functions has been absorbing an increasing interest from researchers. This refers to the essence of real-life engineering systems and complex natural mechanisms which are generally multi-modal, non-convex and multi-criterion. Until now, several deterministic and stochastic methods have been proposed to cope with such complex systems. Advanced soft computational methods such as evolutionary games (cooperative and non-cooperative), Pareto-based techniques, fuzzy evolutionary methods, cooperative bio-inspired algorithms and neuro-evolutionary systems have effectively come to the aid of researchers to build up efficient paradigms with application to vector optimization. The paper aims to discuss this issue.

A novel hybrid algorithm called synchronous self-learning Pareto strategy (SSLPS) is presented for the sake of vector optimization. The method is the ensemble of evolutionary algorithms (EA), swarm intelligence (SI), adaptive version of self-organizing map (CSOM) and a data shuffling mechanism. EA are powerful numerical optimization algorithms capable of finding a global extreme point over a wide exploration domain. SI techniques (the swarm of bees in our case) can improve both intensification and robustness of exploration. CSOM network is an unsupervised learning methodology which learns the characteristics of non-dominated solutions and, thus, enhances the quality of the Pareto front.

To prove the effectiveness of the proposed method, the authors engage a set of well-known benchmark functions and some well-known rival optimization methods. Additionally, SSLPS is employed for optimal design of shape memory alloy actuator as a nonlinear multi-modal real-world engineering problem. The experiments show the acceptable potential of SSLPS for handling both numerical and engineering multi-objective problems.

To the author’s best knowledge, the proposed algorithm is among the rare multi-objective methods which fosters the use of automated unsupervised learning for increasing the intensity of Pareto front (while preserving the diversity). Also, the research evaluates the power of hybridization of SI and EA for efficient search.

The set-union knapsack problem is one of the most significant generalizations of the Non-deterministic Polynomial (NP)-hard 0-1 knapsack problem in combinatorial optimization, which has rich application scenarios. Although some researchers performed effective algorithms on normal-sized instances, the authors found these methods deteriorated rapidly as the scale became larger. Therefore, the authors design an efficient yet effective algorithm to solve this large-scale optimization problem, making it applicable to real-world cases under the era of big data.

The authors develop three targeted strategies and adjust them into the adaptive tabu search framework. Specifically, the dynamic item scoring tries to select proper items into the knapsack dynamically to enhance the intensification, while the age-guided perturbation places more emphasis on the diversification of the algorithm. The lightweight neighborhood updating simplifies the neighborhood operators to reduce the algorithm complexity distinctly as well as maintains potential solutions. The authors conduct comparative experiments against currently best solvers to show the performance of the proposed algorithm.

Statistical experiments show that the proposed algorithm can find 18 out of 24 better solutions than other algorithms. For the remaining six instances on which the competitor also achieves the same solutions, ours performs more stably due to its narrow gap between best and mean value. Besides, the convergence time is also verified efficiency against other algorithms.

The authors present the first implementation of heuristic algorithm for solving large-scale set-union knapsack problem and achieve the best results. Also, the authors provide the benchmarks on the website for the first time.

This paper aims to quantify the dependence relationship of bat algorithm’s (BA) behaviour on the factors that could possibly affect the outputs, and rank the importance of the various uncertain factors thus suggesting research priorities.

This paper conducts a sensitivity analysis based on variance decomposition of factors in both of original and improved BA. The data sets for sensitivity analysis are generated by optimal Latin hyper sampling in the design of experiment. The optimal factor sets are screened by stochastic error bar measures for the effective and robust implementation of BA.

The paper reveals the inner dependent relationship between factors and output in both of original and improved BA. It figures out the weakness in original BA and improves that. It suggests that uncertainty brought about by factors are mainly caused by the interaction effect and all the higher-order term in sensitivity indices for both of original and improved BA. It ranks the main effect and the total effect of factors and screens out some optimal factor sets for BA.

This paper quantifies the dependence relationship of BA’s behaviour on the factors that could affect outputs using sensitivity analysis based on variance decomposition.

The purpose of this paper is to introduce an effective methodology of obtaining Perot-optimal solutions when combining system dynamics (SD) and multi-objective optimization (MOO) for supply chain problems.

This paper proposes a new approach that combines SD and MOO within a simulation-based optimization framework for generating the efficient frontier for supporting decision making in supply chain management (SCM). It also addresses the issue of the curse of dimensionality, commonly found in practical optimization problems, through design space reduction.

The integrated MOO and SD approach has been shown to be very useful for revealing how the decision variables in the Beer Game (BG) affect the optimality of the three common SCM objectives, namely, the minimization of inventory, backlog, and the bullwhip effect (BWE). The results from the in-depth BG study clearly show that these three optimization objectives are in conflict with each other, in the sense that a supply chain manager cannot minimize the BWE without increasing the total inventory and total backlog levels.

Having a methodology that enables effective generation of optimal trade-off solutions, in terms of computational cost, time as well as solution diversity and intensification, assist decision makers in not only making decision in time but also present a diverse and intense solution set to choose from.

This paper presents a novel supply chain MOO methodology to assist in finding Pareto-optimal solutions in a more effective manner. In order to do so the methodology tackles the so-called curse of dimensionality by reducing the design space and focussing the search of the optimization to regions of inters. Together with design space reduction, it is believed that the integrated SD and MOO approach can provide an innovative and efficient approach for the design and analysis of manufacturing supply chain systems in general.

The purpose of this paper is to tackle a satellite module layout design problem (SMLDP). As a complex engineering layout and combinatorial optimization problem, SMLDP cannot be solved effectively by traditional exact methods. Although evolutionary algorithms (EAs) have shown some promise of tackling SMLDP in previous work, the solution quality and computational efficiency still pose a challenge. This paper aims to address these two issues.

Scatter search (SS) and a cooperative co‐evolutionary architecture are integrated to form a new approach called a cooperative co‐evolutionary scatter search (CCSS). The cooperative co‐evolutionary architecture is characterized by the decomposition and cooperation for dealing with complex engineering problems. SS is a flexible meta‐heuristic method that can effectively solve the combinatorial optimization problems. Designing the elements of SS is context‐dependent. Considering the characteristics of SMLDP, our work focuses on two folds: the diversification method, and the reference set update method. The diversification method is built on the method of coordinate transformation and the controlled randomness. The reference set is updated by the static method on the basis of two dissimilarities. Two test problems for circles packing illustrated the capacity of SS. However, when solving SMLDP, SS shows some limitations in the computational time and quality. This study adopts divide‐conquer‐coordination strategy to decompose SMLDP into several layout sub‐problems. Then CCSS is applied to cooperatively solve these sub‐problems. The experimental results illustrate the capability of the proposed approach in tackling the complex problem with less computational effort.

Applying CCSS to SMLDP can obtain satisfying solutions in terms of quality and computational efficiency. This contrasts with the limiting experimental results of SMLDP with some approaches (including modified SS).

A new CCSS is proposed to provide an effective and efficient way of solving SMLDP. Some elements of SS are improved to address the layout problem. SMLDP is decomposed into several sub‐problems that can be solved cooperatively by CCSS after its characteristics are taken into consideration.

Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.

This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.

The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.

This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.

This paper aims to describe two enhancements of the variable neighbourhood search (VNS) algorithm to solve efficiently the minimum interference frequency assignment problem (MI-FAP) which is a major issue in the radio networks, as well as a well-known NP-hard combinatorial optimisation problem. The challenge is to assign a frequency to each transceiver of the network with limited or no interferences at all. Indeed, considering that the number of radio networks users is ever increasing and that the radio spectrum is a scarce and expensive resource, the latter should be carefully managed to avoid any interference.

The authors suggest two new enhanced VNS variants for MI-FAP, namely, the iterated VNS (It-VNS) and the breakout VNS (BVNS). These two algorithms were designed based on the hybridising and the collaboration approaches that have emerged as two powerful means to solve hard combinatorial optimisation problems. Therefore, these two methods draw their strength from other meta-heuristics. In addition, the authors introduced a new mechanism of perturbation to enhance the performance of VNS. An extensive experiment was conducted to evaluate the performance of the proposed methods on some well-known MI-FAP datasets. Moreover, they carried out a comparative study with other metaheuristics and achieved the Friedman’s non-parametric statistical test to check the actual effect of the proposed enhancements.

The experiments showed that the two enhanced methods (It-VNS) and (BVNS) achieved better results than the VNS method. The comparative study with other meta-heuristics showed that the results are competitive and very encouraging. The Friedman’s non-parametric statistical test reveals clearly that the results of the three methods (It-VNS, BVNS and VNS) are significantly different. The authors therefore carried out the Nemenyi’s post hoc test which allowed us to identify those differences. The impact of the operated change on both the It-VNS and BVNS was thus confirmed. The proposed BVNS is competitive and able to produce good results as compared with both It-VNS and VNS for MI-FAP.

Approached methods and particularly newly designed ones may have some drawbacks that weaken the results, in particular when dealing with extensive data. These limitations should therefore be eliminated through an appropriate approach with a view to design appropriate methods in the case of large-scale data.

The authors designed and implemented two new variants of the VNS algorithm before carrying out an exhaustive experimental study. The findings highlighted the potential opportunities of these two enhanced methods which could be adapted and applied to other combinatorial optimisation problems, real world applications or academic problems.

This paper aims at enhancing the VNS algorithm through two new approaches, namely, the It-VNS and the BVNS. These two methods were applied to the MI-FAP which is a crucial problem arising in a radio network. The numerical results are interesting and demonstrate the benefits of the proposed approaches in particular BVNS for MI-FAP.

In this paper, a newly proposed hybridization algorithm namely constriction coefficient-based particle swarm optimization and gravitational search algorithm (CPSOGSA) has been employed for training MLP to overcome sensitivity to initialization, premature convergence, and stagnation in local optima problems of MLP.

In this study, the exploration of the search space is carried out by gravitational search algorithm (GSA) and optimization of candidate solutions, i.e. exploitation is performed by particle swarm optimization (PSO). For training the multi-layer perceptron (MLP), CPSOGSA uses sigmoid fitness function for finding the proper combination of connection weights and neural biases to minimize the error. Secondly, a matrix encoding strategy is utilized for providing one to one correspondence between weights and biases of MLP and agents of CPSOGSA.

The experimental findings convey that CPSOGSA is a better MLP trainer as compared to other stochastic algorithms because it provides superior results in terms of resolving stagnation in local optima and convergence speed problems. Besides, it gives the best results for breast cancer, heart, sine function and sigmoid function datasets as compared to other participating algorithms. Moreover, CPSOGSA also provides very competitive results for other datasets.

The CPSOGSA performed effectively in overcoming stagnation in local optima problem and increasing the overall convergence speed of MLP. Basically, CPSOGSA is a hybrid optimization algorithm which has powerful characteristics of global exploration capability and high local exploitation power. In the research literature, a little work is available where CPSO and GSA have been utilized for training MLP. The only related research paper was given by Mirjalili et al., in 2012. They have used standard PSO and GSA for training simple FNNs. However, the work employed only three datasets and used the MSE performance metric for evaluating the efficiency of the algorithms. In this paper, eight different standard datasets and five performance metrics have been utilized for investigating the efficiency of CPSOGSA in training MLPs. In addition, a non-parametric pair-wise statistical test namely the Wilcoxon rank-sum test has been carried out at a 5% significance level to statistically validate the simulation results. Besides, eight state-of-the-art meta-heuristic algorithms were employed for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.