Search results

A new algorithm based on ant colony optimization (ACO) for data clustering has been developed.

ACO technique along with simulated annealing, tournament selection (GA), Tabu search and density distribution are used to solve unsupervised clustering problem for making similar groups from arbitrarily entered large data.

Distinctive clusters of similar data are formed metaheuritically from arbitrarily entered mixed data based on similar attributes of data.

The authors have run a computer program for a number of cases related to data clustering. So far, there are no problems in convergence of results for formation of distinctive similar groups with given data set quickly and accurately.

ACO‐based method developed here can be applied to practical industrial problems for mobile robotic navigation other than data clustering and travelling salesman.

This paper will enable the solving of problems related to mixed data, which requires the formation of a number of groups of similar data without having a prior knowledge of divisions, which lead to unbiased clustering. The computer code developed in this work is based on a metaheuristic algorithm and presented here to solve a number of cases.

The purpose of this paper is to provide an improved genetic algorithm to solve 0/1 multidimensional knapsack problem (0/1 MKP), by proposing new selection and crossover operators that cooperate to explore the search space.

The authors first present a new sexual selection strategy that significantly improves the one proposed by (Varnamkhasti and Lee, 2012), while working in phenotype space. Then they propose two variants of the two-stage recombination operator of (Aghezzaf and Naimi, 2009), while they adapt the latter in the context of 0/1 MKP. The authors evaluate the efficiency of both proposed operators on a large set of 0/1 MKP benchmark instances. The obtained results are compared against that of conventional selection and crossover operators, in terms of solution quality and computing time.

The paper shows that the proposed selection respects the two major factors of any metaheuristic: exploration and exploitation aspects. Furthermore, the first variant of the two-stage recombination operator pushes the search space towards exploitation, while the second variant increases the genetic diversity. The paper then demonstrates that the improved genetic algorithm combining the two proposed operators is a competitive method for solving the 0/1 MKP.

Although only 0/1 MKP standard instances were tested in the empirical experiments in this paper, the improved genetic algorithm can be used as a powerful tool to solve many real-world applications of 0/1 MKP, as the latter models several industrial and investment issues. Moreover, the proposed selection and crossover operators can be incorporated into other bio-inspired algorithms to improve their performance. Furthermore, the two proposed operators can be adapted to solve other binary combinatorial optimization problems.

This research study provides an effective solution for a well-known non-deterministic polynomial-time (NP)-hard combinatorial optimization problem; that is 0/1 MKP, by tackling it with an improved genetic algorithm. The proposed evolutionary mechanism is based on two new genetic operators. The first proposed operator is a new and deeply different variant of the so-called sexual selection that has been rarely addressed in the literature. The second proposed operator is an adaptation of the two-stage recombination operator in the 0/1 MKP context. This adaptation results in two variants of the two-stage recombination operator that aim to improve the quality of encountered solutions, while taking advantage of the sexual selection criteria to prevent the classical issue of genetic algorithm that is premature convergence.

The aim of this paper is to explore the potential of standard quantum particle swarm optimization algorithms to solve single objective electromagnetic optimization problems.

A modified quantum particle swarm optimization (MQPSO) algorithm is designed.

The MQPSO algorithm is an efficient and robust global optimizer for optimizing electromagnetic design problems. The numerical results as reported have demonstrated that the proposed approach can find better final optimal solution at an initial stage of the iterating process as compared to other tested stochastic methods. It also demonstrates that the proposed method can produce better outcomes by using almost the same computation cost (number of iterations). Thus, the merits or advantages of the proposed MQPSO method in terms of both solution quality (objective function values) and convergence speed (number of iterations) are validated.

The improvements include the design of a new position updating formula, the introduction of a new selection method (tournament selection strategy) and the proposal of an updating parameter rule.

This research paper reports a novel genetic algorithm (GA)‐based approach for reconfiguration of radial distribution networks for real loss minimization and power quality improvement.

A fuzzy controlled GA has been used for efficient reconfiguration of radial distribution systems for loss minimization and power quality improvement. The special features of the proposed algorithm are: an improved chromosome coding/decoding for network representation so as to preserve the radial property without islanding any load after reconfiguration and an efficient convergence characteristics attributed to fuzzy controlled mutation.

The proposed network reconfiguration algorithm is very much effective in arriving at the global optimal solution (minimum loss network structure) because of efficient search of the solution space. Also, no invalid chromosomes are generated in the genetic evolution because of appropriate coding/decoding. The algorithm is found to be very much suitable for real time implementations.

This research paper provides the power distribution engineers with a computationally efficient approach for optimal operation of distribution systems.

The algorithm proposed in this paper is computationally much faster compared to most of the present day mathematical programming approaches for distribution system operation. This makes it very much attractive for online implementations in any radial distribution network.

This paper has proposed a novel chromosome coding/decoding technique for radial distribution system and a fuzzy logic‐based mutation probability controller for efficient search of global solution space to be used in GA‐based optimal operation of radial distribution systems.

Nowadays, building information modeling (BIM) represents an evolution in the architecture, engineering and construction (AEC) industries with its various applications. BIM is capable to store huge amounts of information related to buildings which can be leveraged in several areas such as quantity takeoff, scheduling, sustainability and facility management. The main objective of this research is to establish a model for automated schedule generation using BIM and to solve the time–cost trade-off problem (TCTP) resulting from the various scenarios offered to the user.

A model is developed to use the quantities exported from a BIM platform, then generate construction activities, calculate the duration of each activity and finally the logic/sequence is applied in order to link the activities together. Then, multiobjective optimization is performed using nondominated sorting genetic algorithm (NSGA-II) in order to provide the most feasible solutions considering project duration and cost. The researchers opted NSGA-II because it is one of the well-known and credible algorithms that have been used in many applications, and its performances were tested in several comparative studies.

The proposed model is capable to select the near-optimum scenario for the project and export it to Primavera software. A case study is worked to demonstrate the use of the proposed model and illustrate its main features.

The proposed model can provide a simple and user-friendly model for automated schedule generation of construction projects. In addition, opportunities related to the interface between an automated schedule generation model and Primavera software are enabled as Primavera is one of the most popular and common schedule software solutions in the construction industry. Furthermore, it allows importing data from MS Excel, which is used to store activities data in the different scenarios. In addition, there are numerous solutions, each one corresponds to a certain duration and cost according to the performance factor which often reflects the number of crews assigned to the activity and/or construction method.

By introducing the mass customization service mode into the cloud logistics environment, this paper studies the joint optimization of service provider selection and customer order decoupling point (CODP) positioning based on the mass customization service mode to provide customers with more diversified and personalized service content with lower total logistics service cost.

This paper addresses the general process of service composition optimization based on the mass customization mode in a cloud logistics service environment and constructs a joint decision model for service provider selection and CODP positioning. In the model, the two objective functions of minimum service cost and most satisfactory delivery time are considered, and the Pareto optimal solution of the model is obtained via the NSGA-II algorithm. Then, a numerical case is used to verify the superiority of the service composition scheme based on the mass customization mode over the general scheme and to verify the significant impact of the scale effect coefficient on the optimal CODP location.

(1) Under the cloud logistics mode, the implementation of the logistics service mode based on mass customization can not only reduce the total cost of logistics services by means of the scale effect of massive orders on the cloud platform but also make more efficient use of a large number of logistics service providers gathered on the cloud platform to provide customers with more customized and diversified service content. (2) The scale effect coefficient directly affects the total cost of logistics services and significantly affects the location of the CODP. Therefore, before implementing the mass customization logistics service mode, the most reasonable clustering of orders on the cloud logistics platform is very important for the follow-up service combination.

The originality of this paper includes two aspects. One is to introduce the mass customization mode in the cloud logistics service environment for the first time and summarize the operation process of implementing the mass customization mode in the cloud logistics environment. Second, in order to solve the joint decision optimization model of provider selection and CODP positioning, this paper designs a method for solving a mixed-integer nonlinear programming model using a multi-layer coding genetic algorithm.

The purpose of this work is to study the capability of heuristic algorithms like genetic algorithm to estimate the electron transport parameters of the Gallium Arsenide (GaAs). Also, the paper provides a simple but complete electron mobility model for the GaAs based on the genetic algorithm that can be suitable for use in simulation, optimization and design of GaAs‐based electronic and optoelectronic devices.

The genetic algorithm as a powerful heuristic optimization technique is used to approximate the electron transport parameters during the model development.

The capability of the model to approximate the electron transport properties of Gallium Arsenide is tested using experimental and Monte Carlo data. Results show that the genetic algorithm based model can provide a reliable estimate of the electron mobility in Gallium Arsenide for a wide range of temperatures, concentrations and electric fields. Based on the obtained results, this paper shows that the genetic algorithm can be a useful tool for the estimation of the transport parameters of semiconductors.

For the first time, the genetic algorithm is used to calculate the electron transport parameters in Gallium Arsenide. A complete electron mobility model for a wide range of temperatures, doping concentrations, compensation ratios and electric fields is developed.

The purpose of this paper is to assess the quality of commercial lubricant oils. A spectroscopic method was used in combination with multivariate regression techniques (ordinary multivariate multiple regression, principal components analysis, partial least squares, and support vector regression (SVR)).

The rationale behind the use of SVR was the fuzzy characteristics of the signal and its inherent ability to find nonlinear, global solutions in highly complex dimensional input spaces. Thus, SVR allows extracting useful information from calibration samples that makes it possible to characterize physical-chemical properties of the lubricant oils.

A dataset of 42 spectra measured from oil standards was studied to assess the concentration of copper into the oils and, thus, evaluate the wearing of the machinery. It was found that the use of SVR was very advantageous to get a regression model.

The use of genetic algorithms coupled to SVR was considered in order to reduce the time needed to find the optimal parameters required to get a suitable prediction model.

This paper aims to present a new model for solving the integrated production planning and scheduling. Usually, the two decision levels are treated sequentially because of their complexity. Scheduling depends on the lot sizes calculated at the tactical level and ignoring scheduling constraints generates unrealistic and inconsistent decisions. Therefore, integrating more detail scheduling constraint in production planning is important for managing efficiently operations. Therefore, an integrated model was developed, and two evolutionary optimization approaches were suggested for solving it, namely, genetic algorithm (GA) and the hybridization of simulated annealing (SA) with GA HSAGA. The proposed algorithms have some parameters that must be adjusted using Taguchi method. Therefore, to evaluate the proposed algorithm, the authors compared the results given by GA and the hybridization. The SA-based local search is embedded into a GA search mechanism to move the GA away from being closed within local optima. The analysis shows that the combination of simulated annealing with GA gives better solutions and minimizes the total production costs.

The paper opted for an approached resolution method particularly GA and simulated annealing. The study represents a comparison between the results found using GA and the hybridization of simulated annealing and GA. A total of 45 instances were studied to evaluate job-shop problems of different sizes.

The results illustrate that for 36 instances of 45, the hybridization of simulated annealing and GA HSAGA has provided best production costs. The efficiency demonstrated by HSAGA approach is related to the combination between the exploration ability of GA and the capacity to escape local optimum of simulated annealing.

This study provides a new resolution approach to the integration of planning and scheduling while considering a new operational constrain. The model suggested aims to control the available capacity of the resources and guaranties that the resources to be consumed do not exceed the real availability to avoid the blocking that results from the unavailability of resources. Furthermore, to solve the MILP model, a GA is proposed and then it is combined to simulated annealing.