Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems

Severe traffic congestion and growing ecological consciousness have led to the rise of alternative transportation systems. Ride sharing is one such alternative in which drivers and passengers with similar time schedules and travel plans are matched. For this service to be effective, a large number of users are required to increase the probability of finding suitable travel partners. The present paper proposes a late acceptance metaheuristic to decide which users act as drivers and to construct their routes. The underlying optimization model allows passengers to walk to/from alternative pickup/drop‐off locations so as to further exploit user flexibility. A computational study quantifies the impact of different types of participant flexibility on CO₂ emissions. These insights can inform and support policymakers in organizing effective ride‐sharing systems.     

Cyclical parthenogenesis algorithm for layout optimization of truss structures with frequency constraints

Structural optimization with frequency constraints is seen as a challenging problem because it is associated with highly nonlinear, discontinuous and non-convex search spaces consisting of several local optima. Therefore, competent optimization algorithms are essential for addressing these problems. In this article, a newly developed metaheuristic method called the cyclical parthenogenesis algorithm (CPA) is used for layout optimization of truss structures subjected to frequency constraints. CPA is a nature-inspired, population-based metaheuristic algorithm, which imitates the reproductive and social behaviour of some animal species such as aphids, which alternate between sexual and asexual reproduction. The efficiency of the CPA is validated using four numerical examples.     

A novel hybridized metaheuristic technique in enhancing the diagnosis of cross-sectional dent damaged offshore platform members

Offshore jacket platforms are widely used for oil and gas extraction as well as transportation in shallow to moderate water depth. Tubular cross-sectional elements are used to construct offshore platforms. Tubular cross sections impart higher resistance against hydrodynamic forces and have high torsional rigidity. During operation, the members can be partially or fully damaged due to lateral impacts. The lateral impacts can be due to ship collisions or through the impact of falling objects. The impact forces can weaken some members that influence the overall performance of the platform. This demonstrates an urgent need to develop a framework that can accurately forecast dent depth as well as dent angle of the affected members. This study investigates the use of an adaptive metaheuristics algorithm to provide automatic detection of denting damage in an offshore structure. The damage information includes dent depth and the dent angle. A model is developed in combination with the percentage of the dent depth of the damaged member and is used to assess the performance of the method. It demonstrates that small changes in stiffness of individual damaged bracing members are detectable from measurements of global structural motion.     

A Hybrid Model Using Bio-Inspired Metaheuristic Algorithms for Network Intrusion Detection System

Network Intrusion Detection System (IDS) aims to maintain computer network security by detecting several forms of attacks and unauthorized uses of applications which often can not be detected by firewalls. The features selection approach plays an important role in constructing effective network IDS. Various bio-inspired metaheuristic algorithms used to reduce features to classify network traffic as abnormal or normal traffic within a shorter duration and showing more accuracy. Therefore, this paper aims to propose a hybrid model for network IDS based on hybridization bio-inspired metaheuristic algorithms to detect the generic attack. The proposed model has two objectives; The first one is to reduce the number of selected features for Network IDS. This objective was met through the hybridization of bio-inspired metaheuristic algorithms with each other in a hybrid model. The algorithms used in this paper are particle swarm optimization (PSO), multi-verse optimizer (MVO), grey wolf optimizer (GWO), moth-flame optimization (MFO), whale optimization algorithm (WOA), firefly algorithm (FFA), and bat algorithm (BAT). The second objective is to detect the generic attack using machine learning classifiers. This objective was met through employing the support vector machine (SVM), C4.5 (J48) decision tree, and random forest (RF) classifiers. UNSW-NB15 dataset used for assessing the effectiveness of the proposed hybrid model. UNSW-NB15 dataset has nine attacks type. The generic attack is the highest among them. Therefore, the proposed model aims to identify generic attacks. My data showed that J48 is the best classifier compared to SVM and RF for the time needed to build the model. In terms of features reduction for the classification, my data show that the MFO-WOA and FFA-GWO models reduce the features to 15 features with close accuracy, sensitivity and F-measure of all features, whereas MVO-BAT model reduces features to 24 features with the same accuracy, sensitivity and F-measure of all features for all classifiers.     

Discrete size optimization of steel trusses using a refined big bang–big crunch algorithm

This article presents a methodology that provides a method for design optimization of steel truss structures based on a refined big bang–big crunch (BB-BC) algorithm. It is shown that a standard formulation of the BB-BC algorithm occasionally falls short of producing acceptable solutions to problems from discrete size optimum design of steel trusses. A reformulation of the algorithm is proposed and implemented for design optimization of various discrete truss structures according to American Institute of Steel Construction Allowable Stress Design (AISC-ASD) specifications. Furthermore, the performance of the proposed BB-BC algorithm is compared to its standard version as well as other well-known metaheuristic techniques. The numerical results confirm the efficiency of the proposed algorithm in practical design optimization of truss structures.     

BAS-ADAM: An ADAM Based Approach to Improve the Performance of Beetle Antennae Search Optimizer

In this paper, we propose enhancements to Beetle Antennae search (BAS) algorithm, called BAS-ADAM, to smoothen the convergence behavior and avoid trapping in local-minima for a highly non-convex objective function. We achieve this by adaptively adjusting the step-size in each iteration using the adaptive moment estimation (ADAM) update rule. The proposed algorithm also increases the convergence rate in a narrow valley. A key feature of the ADAM update rule is the ability to adjust the step-size for each dimension separately instead of using the same step-size. Since ADAM is traditionally used with gradient-based optimization algorithms, therefore we first propose a gradient estimation model without the need to differentiate the objective function. Resultantly, it demonstrates excellent performance and fast convergence rate in searching for the optimum of non-convex functions. The efficiency of the proposed algorithm was tested on three different benchmark problems, including the training of a high-dimensional neural network. The performance is compared with particle swarm optimizer (PSO) and the original BAS algorithm.      

An improved harmony search algorithm with dynamically varying bandwidth

The present work demonstrates a new variant of the harmony search (HS) algorithm where bandwidth (BW) is one of the deciding factors for the time complexity and the performance of the algorithm. The BW needs to have both explorative and exploitative characteristics. The ideology is to use a large BW to search in the full domain and to adjust the BW dynamically closer to the optimal solution. After trying a series of approaches, a methodology inspired by the functioning of a low-pass filter showed satisfactory results. This approach was implemented in the self-adaptive improved harmony search (SIHS) algorithm and tested on several benchmark functions. Compared to the existing HS algorithm and its variants, SIHS showed better performance on most of the test functions. Thereafter, the algorithm was applied to geometric parameter optimization of a friction stir welding tool.     

Algorithms for a realistic variant of flowshop scheduling

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be visited by all jobs. Lastly, we also consider job sequence dependent setup times per stage. The optimization criterion considered is makespan minimization. While many approaches for hybrid flowshops have been proposed, hybrid flexible flowshops have been rarely studied. The situation is even worse with the addition of sequence dependent setups. In this study, we propose two advanced algorithms that specifically deal with the flexible and setup characteristics of this problem. The first algorithm is a dynamic dispatching rule heuristic, and the second is an iterated local search metaheuristic. The proposed algorithms are evaluated by comparison against seven other high performing existing algorithms. The statistically sound results support the idea that the proposed algorithms are very competitive for the studied problem.     

An efficient auxiliary projection-based multigrid isogeometric reanalysis method and its application in an optimization framework

An efficient optimization framework is developed in this study by integrating auxiliary projection-based multigrid isogeometric reanalysis (MG-IGR) and metaheuristic searching techniques. It is well known that the inherent characteristics of isogeometric analysis (IGA) are superior in shape optimization problems. Inheriting the characteristics of IGA, an auxiliary projection-based MG reanalysis (MGR) is proposed to construct mapping between the mesh before modification and after modification during the optimization process. Subsequently, MG-IGR is utilized to reanalyze the modified design efficiently by reusing the initial evaluated results. Moreover, the proposed MG-IGR also eliminates the restriction of mesh consistency. In this framework, the structure can be designed directly through parameterized control of the non-uniform rational B-spline (NURBS) model, and the MG-IGR fast solver enables any metaheuristic algorithm to perform the optimization procedure. Moreover, the accuracy of the simulation can be guaranteed by the NURBS model and the convergence criterion of the MG. Finally, two geometric optimization examples are presented to validate the performance of the developed framework.     

Performance evaluation of uniform linear array for adaptive beamforming using a novel Fibonacci branch algorithm

A new metaheuristic algorithm Fibonacci branch search (FBS) based on two innovative criteria rules, tree's branches fundamental structure and interactive searching rules, was introduced in this paper and applied to adaptive beamforming (ABF) field for uniform linear array. The global optima in search space can be reached by FBS during the searching process by the fitness evaluation of optimization rules. In this mode, two types of multidimensional points are to construct the branch structure of FBS based on shortening fraction selected by Fibonacci series. Then, the interactive local optimization and global searching rules are implemented alternately to obtain the optimal solutions, avoiding the search points trapping and stagnating in the local optimum. The performance of global searching ability of FBS has been evaluated by standard benchmark functions. It is also used here to construct an ABF technique as a practical issue to improve the nulling level. The simulation results of implemetation of FBS are compared with the five well‐known heuristic optimization algorithms and verfied the superior of the proposed FBS approach in both locating the global optimal solution and higher precision of nulling improvement in the ABF.