Search results

The purpose of this paper is to cut down energy consumption and eliminate production waste on mixed-model assembly lines. Therefore, a supermarket integrated dynamic cyclic kitting system with the application of electric vehicles (EVs) is introduced. The system resorts to just-in-time (JIT) and segmented sub-line assignment strategies, with the objectives of minimizing line-side inventory and energy consumption.

Hybrid opposition-based learning and variable neighborhood search (HOVMQPSO), a multi-objective meta-heuristics algorithm based on quantum particle swarm optimization is proposed, which hybridizes opposition-based learning methodology as well as a variable neighborhood search mechanism. Such algorithm extends the search space and is capable of obtaining more high-quality solutions.

Computational experiments demonstrated the outstanding performance of HOVQMPSO in solving the proposed part-feeding problem over the two benchmark algorithms non-dominated sorting genetic algorithm-II and quantum-behaved multi-objective particle swarm optimization. Additionally, using modified real-life assembly data, case studies are carried out, which imply HOVQMPSO of having good stability and great competitiveness in scheduling problems.

The feeding problem is based on static settings in a stable manufacturing system with determined material requirements, without considering the occurrence of uncertain incidents. Current study contributes to assembly line feeding with EV assignment and could be modified to allow cooperation between EVs.

The dynamic cyclic kitting problem with sub-line assignment applying EVs and supermarkets is solved by an innovative HOVMQPSO, providing both novel part-feeding strategy and effective intelligent algorithm for industrial engineering.

This paper aims to offer a hybrid genetic algorithm and the ant colony optimization (GA-ACO) algorithm for task mapping and resource management. The paper aims to reduce the makespan and total response time in fog computing- medical cyber-physical system (FC-MCPS).

Swift progress in today’s medical technologies has resulted in a new kind of health-care tool and therapy techniques like the MCPS. The MCPS is a smart and reliable mechanism of entrenched clinical equipment applied to check and manage the patients’ physiological condition. However, the extensive-delay connections among cloud data centers and medical devices are so problematic. FC has been introduced to handle these problems. It includes a group of near-user edge tools named fog points that are collaborating until executing the processing tasks, such as running applications, reducing the utilization of a momentous bulk of data and distributing the messages. Task mapping is a challenging problem for managing fog-based MCPS. As mapping is an non-deterministic pol ynomial-time-hard optimization issue, this paper has proposed a procedure depending on the hybrid GA-ACO to solve this problem in FC-MCPS. ACO and GA, that is applied in their standard formulation and combined as hybrid meta-heuristics to solve the problem. As such ACO-GA is a hybrid meta-heuristic using ACO as the main approach and GA as the local search. GA-ACO is a memetic algorithm using GA as the main approach and ACO as local search.

MATLAB is used to simulate the proposed method and compare it to the ACO and MACO algorithms. The experimental results have validated the improvement in makespan, which makes the method a suitable one for use in medical and real-time systems.

The proposed method can achieve task mapping in FC-MCPS by attaining high efficiency, which is very significant in practice.

The proposed approach can achieve the goal of task scheduling in FC-MCPS by attaining the highest total computational efficiency, which is very significant in practice.

This research proposes a GA-ACO algorithm to solve the task mapping in FC-MCPS. It is the most significant originality of the paper.

The intention of the empirics is to contribute to the general understanding of investor responses to market price shocks. The authors review assumptions about investor behavior in response to price shocks and investigate alternative rebalancing heuristics.

The authors use market data over 40 years to define market shocks. Portfolio rebalancing implements constrained Markowitz mean-variance (MV) heuristics.

Momentum rebalancing in portfolio management outperforms contrarian rebalancing in the study interval. Sensitivity analysis by decade, sector constraints and proportion of security holdings bought or sold continue to support momentum rebalancing.

The results are consistent with under-responding to price shocks at consensus levels in financial markets. The theoretical background provides a basis for experimental lab studies of shocks of different magnitudes under conditions in which participants have information on the levels of other participants and a condition in which they can only observe their previous estimates.

Managing portfolios in the face of price disturbances of different magnitudes is informed by empirical studies and their implications for investor behavior.

This is the first study the authors can locate that uses market data with alternative rebalancing heuristics to estimate price returns from the respective heuristics over a time interval of 40 years. The authors support the results with sensitivity estimates and consider implications for the underlying agent heuristics in light of background studies.

Optimum utilization of investments has always been considered one of the most crucial aspects of capital markets. Investment into various securities is the subject of portfolio optimization intent to maximize return at minimum risk. In this series, a population-based evolutionary approach, stochastic fractal search (SFS), is derived from the natural growth phenomenon. This study aims to develop portfolio selection model using SFS approach to construct an efficient portfolio by optimizing the Sharpe ratio with risk budgeting constraints.

This paper proposes a constrained portfolio optimization model using the SFS approach with risk-budgeting constraints. SFS is an evolutionary method inspired by the natural growth process which has been modeled using the fractal theory. Experimental analysis has been conducted to determine the effectiveness of the proposed model by making comparisons with state-of-the-art from domain such as genetic algorithm, particle swarm optimization, simulated annealing and differential evolution. The real datasets of the Indian stock exchanges and datasets of global stock exchanges such as Nikkei 225, DAX 100, FTSE 100, Hang Seng31 and S&P 100 have been taken in the study.

The study confirms the better performance of the SFS model among its peers. Also, statistical analysis has been done using SPSS 20 to confirm the hypothesis developed in the experimental analysis.

In the recent past, researchers have already proposed a significant number of models to solve portfolio selection problems using the meta-heuristic approach. However, this is the first attempt to apply the SFS optimization approach to the problem.

Agriculture is the backbone of a country, contributing more than half of the sector of economy throughout the world. The need for precision agriculture is essential in evaluating the conditions of the crops with the aim of determining the proper selection of pesticides. The conventional method of pest detection fails to be stable and provides limited accuracy in the prediction. This paper aims to propose an automatic pest detection module for the accurate detection of pests using the hybrid optimization controlled deep learning model.

The paper proposes an advanced pest detection strategy based on deep learning strategy through wireless sensor network (WSN) in the agricultural fields. Initially, the WSN consisting of number of nodes and a sink are clustered as number of clusters. Each cluster comprises a cluster head (CH) and a number of nodes, where the CH involves in the transfer of data to the sink node of the WSN and the CH is selected using the fractional ant bee colony optimization (FABC) algorithm. The routing process is executed using the protruder optimization algorithm that helps in the transfer of image data to the sink node through the optimal CH. The sink node acts as the data aggregator and the collection of image data thus obtained acts as the input database to be processed to find the type of pest in the agricultural field. The image data is pre-processed to remove the artifacts present in the image and the pre-processed image is then subjected to feature extraction process, through which the significant local directional pattern, local binary pattern, local optimal-oriented pattern (LOOP) and local ternary pattern (LTP) features are extracted. The extracted features are then fed to the deep-convolutional neural network (CNN) in such a way to detect the type of pests in the agricultural field. The weights of the deep-CNN are tuned optimally using the proposed MFGHO optimization algorithm that is developed with the combined characteristics of navigating search agents and the swarming search agents.

The analysis using insect identification from habitus image Database based on the performance metrics, such as accuracy, specificity and sensitivity, reveals the effectiveness of the proposed MFGHO-based deep-CNN in detecting the pests in crops. The analysis proves that the proposed classifier using the FABC+protruder optimization-based data aggregation strategy obtains an accuracy of 94.3482%, sensitivity of 93.3247% and the specificity of 94.5263%, which is high as compared to the existing methods.

The proposed MFGHO optimization-based deep-CNN is used for the detection of pest in the crop fields to ensure the better selection of proper cost-effective pesticides for the crop fields in such a way to increase the production. The proposed MFGHO algorithm is developed with the integrated characteristic features of navigating search agents and the swarming search agents in such a way to facilitate the optimal tuning of the hyperparameters in the deep-CNN classifier for the detection of pests in the crop fields.

Fabrics, which are one of the raw materials of the clothing industry, constitute approximately 40–45% of the total cost of an apparel product. Due to the labor-intensive nature of this industry and failure to apply scientific methods along with the manufacturing processes, the wastes in the raw materials, including fabrics, become higher. Besides, quality deficiencies are encountered due to the same reasons. This study aims to determine the optimum total fabric layer height based on the fabric type during the cutting process with a straight knife cutting machine, which provided a decrease in the cutting errors.

Frequently used fabric types in an enterprise operating in organic cotton knitwear were listed. During the cutting tests, the straight knife cutting machine was used as the cutting device. The weight and thickness values of the fabrics were obtained to provide a comparison basis. Two different algorithms were created to evaluate the defective pieces according to fabric type, cutting height and error placement. Cutting resistances of these fabrics were also determined to evaluate the defect reasons. In the end, optimum total fabric layer count and total cutting height suggestions were proposed for each fabric type for a minimum cutting error.

At the end of this study, the error-free layers were identified per fabric type. At the same time, the optimum cutting height was suggested for each fabric basis. For 40/1 single jersey fabrics, the cutting height should be between 2.10 cm and 10.40 cm; for 30/1 single jersey fabrics, between 1.65 cm and 5.70 cm; for 20/1 single jersey fabrics, between 1.83 cm and 6.70 cm; for two-thread fleece fabrics, between 2.13 cm and 4.70 cm; and for three-thread fleece fabrics, between 0 cm and 4.90 cm.

Within the scope of the study, since the products made of knitted fabric were produced more frequently and in large quantities, the study was carried out with 15 different types of knitted fabrics at 10 different layers. The same methods should be applied for woven, denim and nonwoven fabric types, which would shed light on the following studies.

Due to scarce research carried out on the cutting procedure of the clothing industry in regards to sustainability, this study aims to contribute to this area. The main difference between this study and the studies that mostly make mathematical predictions about the cutting procedure is that it is practice-oriented.

This paper proposed a bi-level mathematical model for location, routing and allocation of medical centers to distribution depots during the COVID-19 pandemic outbreak. The developed model has two players including interdictor (COVID-19) and fortifier (government). Accordingly, the aim of the first player (COVID-19) is to maximize system costs and causing further damage to the system. The goal of the second player (government) is to minimize the costs of location, routing and allocation due to budget limitations.

The approach of evolutionary games with environmental feedbacks was used to develop the proposed model. Moreover, the game continues until the desired demand is satisfied. The Lagrangian relaxation method was applied to solve the proposed model.

Empirical results illustrate that with increasing demand, the values of the objective functions of the interdictor and fortifier models have increased. Also, with the raising fixed cost of the established depot, the values of the objective functions of the interdictor and fortifier models have raised. In this regard, the number of established depots in the second scenario (COVID-19 wave) is more than the first scenario (normal COVID-19 conditions).

The results of the current research can be useful for hospitals, governments, Disaster Relief Organization, Red Crescent, the Ministry of Health, etc. One of the limitations of the research is the lack of access to accurate information about transportation costs. Moreover, in this study, only the information of drivers and experts about transportation costs has been considered. In order to implement the presented solution approach for the real case study, high RAM and CPU hardware facilities and software facilities are required, which are the limitations of the proposed paper.

The main contributions of the current research are considering evolutionary games with environmental feedbacks during the COVID-19 pandemic outbreak and location, routing and allocation of the medical centers to the distribution depots during the COVID-19 outbreak. A real case study is illustrated, where the Lagrangian relaxation method is employed to solve the problem.

In this study, the authors investigate a different routing and scheduling problem in the field of home health care (HHC) management system. The purpose of this paper is to route and schedule the workday of health workers, assign the patients to suitable health workers, make accurate decisions to minimize costs, provide timely services and, in general, enhance the efficiency of HHC centers.

A mixed-integer linear programming model is developed to assign health workers to patients. The model considers health professionals with different skills, namely nurses and physicians. Additionally, three groups of patients are considered: patients who need a nurse, patients who need a physician and patients who need both. In the third group, the nurse must be present at the patient’s home following the physician’s visit in order to perform the required tasks.

The results of this study show a reduction in costs which results from the fewer health workers employed and dispatched in comparison with traditional approaches. With the help of our solution approach and model, HHC centers may not only successfully reduce their costs but also manage to meet their patients’ demands by assigning suitable nurses and physicians.

Previous studies have often focused on problems involving only one group of health professionals and rarely address problems involving multiple groups. The authors consider this a shortcoming, because in many cases, patients should be visited several times and by various health professionals.

Cloud computing gives several on-demand infrastructural services by dynamically pooling heterogeneous resources to cater to users’ applications. The task scheduling needs to be done optimally to achieve proficient results in a cloud computing environment. While satisfying the user’s requirements in a cloud environment, scheduling has been proven an NP-hard problem. Therefore, it leaves scope to develop new allocation models for the problem. The aim of the study is to develop load balancing method to maximize the resource utilization in cloud environment.

In this paper, the parallelized task allocation with load balancing (PTAL) hybrid heuristic is proposed for jobs coming from various users. These jobs are allocated on the resources one by one in a parallelized manner as they arrive in the cloud system. The novel algorithm works in three phases: parallelization, task allocation and task reallocation. The proposed model is designed for efficient task allocation, reallocation of resources and adequate load balancing to achieve better quality of service (QoS) results.

The acquired empirical results show that PTAL performs better than other scheduling strategies under various cases for different QoS parameters under study.

The outcome has been examined for the real data set to evaluate it with different state-of-the-art heuristics having comparable objective parameters.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.