Search results

Product returns are a major challenge for e-businesses as they involve huge logistical and operational costs. Therefore, it becomes crucial to predict returns in advance. This study aims to evaluate different genres of classifiers for product return chance prediction, and further optimizes the best performing model.

An e-commerce data set having categorical type attributes has been used for this study. Feature selection based on chi-square provides a selective features-set which is used as inputs for model building. Predictive models are attempted using individual classifiers, ensemble models and deep neural networks. For performance evaluation, 75:25 train/test split and 10-fold cross-validation strategies are used. To improve the predictability of the best performing classifier, hyperparameter tuning is performed using different optimization methods such as, random search, grid search, Bayesian approach and evolutionary models (genetic algorithm, differential evolution and particle swarm optimization).

A comparison of F1-scores revealed that the Bayesian approach outperformed all other optimization approaches in terms of accuracy. The predictability of the Bayesian-optimized model is further compared with that of other classifiers using experimental analysis. The Bayesian-optimized XGBoost model possessed superior performance, with accuracies of 77.80% and 70.35% for holdout and 10-fold cross-validation methods, respectively.

Given the anonymized data, the effects of individual attributes on outcomes could not be investigated in detail. The Bayesian-optimized predictive model may be used in decision support systems, enabling real-time prediction of returns and the implementation of preventive measures.

There are very few reported studies on predicting the chance of order return in e-businesses. To the best of the authors’ knowledge, this study is the first to compare different optimization methods and classifiers, demonstrating the superiority of the Bayesian-optimized XGBoost classification model for returns prediction.

Exact solution of time–cost trade-off problem (TCTP) by the state-of-the-art meta-heuristic algorithms can be obtained for small- and medium-scale problems, while satisfactory results cannot be obtained for large construction projects. In this study, a hybrid heuristic meta-heuristic algorithm that adapts the search domain is developed to solve the large-scale discrete TCTP more efficiently.

Minimum cost slope–based heuristic network analysis algorithm (NAA), which eliminates the unfeasible search domain, is embedded into differential evolution meta-heuristic algorithm. Heuristic NAA narrows the search domain at the initial phase of the optimization. Moreover, activities with float durations higher than the predetermined threshold value are eliminated and then the meta-heuristic algorithm starts and searches the global optimum through the narrowed search space. However, narrowing the search space may increase the probability of obtaining a local optimum. Therefore, adaptive search domain approach is employed to make reintroduction of the eliminated activities to the design variable set possible, which reduces the possibility of converging into local minima.

The developed algorithm is compared with plain meta-heuristic algorithm with two separate analyses. In the first analysis, both algorithms have the same computational demand, and in the latter analysis, the meta-heuristic algorithm has fivefold computational demand. The tests on case study problems reveal that the developed algorithm presents lower total project costs according to the dependent t-test for paired samples with α = 0.0005.

In this study, TCTP is solved without considering quality or restrictions on the resources.

The proposed method enables to adapt the number of parameters, that is, the search domain and provides the opportunity of obtaining significant improvements on the meta-heuristic algorithms for other engineering optimization problems, which is the theoretical contribution of this study. The proposed approach reduces the total construction cost of the large-scale projects, which can be the practical benefit of this study.

With the rapid growth of the domestic lending industry, assessing whether the borrower of each loan is at risk of default is a pressing issue for financial institutions. Although there are some models that can handle such problems well, there are still some shortcomings in some aspects. The purpose of this paper is to improve the accuracy of credit assessment models.

In this paper, three different stages are used to improve the classification performance of LSTM, so that financial institutions can more accurately identify borrowers at risk of default. The first approach is to use the K-Means-SMOTE algorithm to eliminate the imbalance within the class. In the second step, ResNet is used for feature extraction, and then two-layer LSTM is used for learning to strengthen the ability of neural networks to mine and utilize deep information. Finally, the model performance is improved by using the IDWPSO algorithm for optimization when debugging the neural network.

On two unbalanced datasets (category ratios of 700:1 and 3:1 respectively), the multi-stage improved model was compared with ten other models using accuracy, precision, specificity, recall, G-measure, F-measure and the nonparametric Wilcoxon test. It was demonstrated that the multi-stage improved model showed a more significant advantage in evaluating the imbalanced credit dataset.

In this paper, the parameters of the ResNet-LSTM hybrid neural network, which can fully mine and utilize the deep information, are tuned by an innovative intelligent optimization algorithm to strengthen the classification performance of the model.

The target of this research is to develop a mathematical model which combines the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and the Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP). Due to the importance of resource management, the proposed formulation comprises resource leveling considerations as well. The model aims to simultaneously optimize: (1) the total time to accomplish all projects and (2) the total deviation of resource consumptions from the uniform utilization levels.

The K-Means (KM) and Fuzzy C-Means (FCM) clustering methods have been separately applied to discover the clusters of activities which have the most similar resource demands. The discovered clusters are given to the scheduling process as priori knowledge. Consequently, the execution times of the activities with the most common resource requests will not overlap. The intricacy of the problem led us to incorporate the KM and FCM techniques into a meta-heuristic called the Bi-objective Symbiosis Organisms Search (BSOS) algorithm so that the real-life samples of this problem could be solved. Therefore, two clustering-based algorithms, namely, the BSOS-KM and BSOS-FCM have been developed.

Comparisons between the BSOS-KM, BSOS-FCM and the BSOS method without any clustering approach show that the clustering techniques could enhance the optimization process. Another hybrid clustering-based methodology called the NSGA-II-SPE has been added to the comparisons to evaluate the developed resource leveling framework.

The practical importance of the model and the clustering-based algorithms have been demonstrated in planning several construction projects, where multiple water supply systems are concurrently constructed.

Reviewing the literature revealed that there was a need for a hybrid formulation that embraces the characteristics of the RCMPSP and MSRCPSP with resource leveling considerations. Moreover, the application of clustering algorithms as resource leveling techniques was not studied sufficiently in the literature.

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

Integrating project scheduling and material ordering problems is vital in realistically estimating project cost and duration. Also, the quality level of materials is important as one of the key project success factors.

In this paper, a three-objective mathematical model is presented for green project scheduling with materials ordering problems considering rental resources. The first objective is to minimize the total cost of the project site and logistics. The second objective is to minimize the environmental impacts of producing materials and the third objective is to maximize the total quality of materials. Since costs trigger several challenges in projects, cost constraints are considered in this model for the first time and also the cost of delay in supplying of materials by the suppliers has been deducted from the project costs. Subsequently, the model was implemented in a real case and solved by the Lagrangian Relaxation algorithm as an exact method on GAMS software for model validation.

Based on sensitivity analysis of some parameters, the findings indicate that the cost constraint and lead time have considerable effects on the project duration. Also, integrating project scheduling and material ordering improves the robustness of the project schedule.

The primary contributions of the present research can be stated as follows: considering the cost constraints in the project scheduling with material ordering problem, incorporating the rental resources and taking the quality levels of materials as well as the environmental impacts into account.

The paper aims to develop a useful tool that can reliably and accurately find the critical paths of high-rise buildings and provide optimal solutions considering the uncertainty based on Monte Carlo simulation (MCS) to enhance project implementation performance by assisting site workers and project managers in high-rise building engineering.

This research proposes an approach integrating the improved nondominated sorting genetic algorithm II (NSGA-II) considering uncertainty and delay scenarios simulated by MCS with the technique for order preference by similarity to an ideal solution.

The results demonstrate that the proposed approach is capable of generating optimal solutions, which can improve the construction performance of high-rise buildings and guide the implementation management for shortening building engineering project schedule and cost under the delay conditions.

In this study, only the construction data of the two floors was focused due to the project at the construction stage, and future work can analyze the whole construction stage of the high-rise building to examine the performance of the approach, and the multi-objective optimization (MOO) only considered two factors as objectives, where more objectives, such as schedule, cost and quality, can be expanded in future.

The approach proposed in this research can be successfully applied to the construction process of high-rise buildings, which can be a guidance basis for optimizing the performance of high-rise building construction.

The innovations and advantages derived from the proposed approach underline its capability to handle project construction scheduling optimization (CSO) problems with different performance objectives under uncertainty and delay conditions.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.

This paper aims to optimize cable-stayed force in asymmetric one-tower cable-stayed bridge formation using an improved particle swarm algorithm. It compares results with the traditional unconstrained minimum bending energy method.

This paper proposes an improved particle swarm algorithm to optimize cable-stayed force in bridge formation. It formulates a quadratic programming mathematical model considering the sum of bending energies of the main girder and bridge tower as the objective function. Constraints include displacements, stresses, cable-stayed force, and uniformity. The algorithm is applied to optimize the formation of an asymmetrical single-tower cable-stayed bridge, combining it with the finite element method.

The study’s findings reveal significant improvements over the minimum bending energy method. Results show that the structural displacement and internal force are within constraints, the maximum bending moment of the main girder decreases, resulting in smoother linear shape and more even internal force distribution. Additionally, the tower top offset decreases, and the bending moment change at the tower-beam junction is reduced. Moreover, diagonal cable force and cable force increase uniformly with cable length growth.

The improved particle swarm algorithm offers simplicity, effectiveness, and practicality in optimizing bridge-forming cable-staying force. It eliminates the need for arbitrary manual cable adjustments seen in traditional methods and effectively addresses the optimization challenge in asymmetric cable-stayed bridges.

For successful management of construction projects, a precise analysis of the balance between time and cost is imperative to attain the most effective results. The aim of this study is to present an innovative approach tailored to tackle the challenges posed by time-cost trade-off (TCTO) problems. This objective is achieved through the integration of the multi-verse optimizer (MVO) with opposition-based learning (OBL), thereby introducing a groundbreaking methodology in the field.

The paper aims to develop a new hybrid meta-heuristic algorithm. This is achieved by integrating the MVO with OBL, thereby forming the iMVO algorithm. The integration enhances the optimization capabilities of the algorithm, notably in terms of exploration and exploitation. Consequently, this results in expedited convergence and yields more accurate solutions. The efficacy of the iMVO algorithm will be evaluated through its application to four different TCTO problems. These problems vary in scale – small, medium and large – and include real-life case studies that possess complex relationships.

The efficacy of the proposed methodology is evaluated by examining TCTO problems, encompassing 18, 29, 69 and 290 activities, respectively. Results indicate that the iMVO provides competitive solutions for TCTO problems in construction projects. It is observed that the algorithm surpasses previous algorithms in terms of both mean deviation percentage (MD) and average running time (ART).

This research represents a significant advancement in the field of meta-heuristic algorithms, particularly in their application to managing TCTO in construction projects. It is noteworthy for being among the few studies that integrate the MVO with OBL for the management of TCTO in construction projects characterized by complex relationships.