Search results

Multi-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.

In this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.

In order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.

In order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.

With the continuous upgrading of the production mode of the manufacturing system, the characteristics of multi-variety, small batch and mixed fluidization are presented, and the production environment becomes more and more complex. To improve the efficiency of solving multi-objective flexible job shop scheduling problem (FJSP), an improved hybrid particle swarm optimization algorithm (IH-PSO) is proposed.

After reviewing literatures on FJSP, an IH-PSO algorithm for solving FJSP is developed. First, IH-PSO algorithm draws on the crossover and mutation operations of genetic algorithm (GA) algorithm and proposes a new method for updating particles, which makes the offspring particles inherit the superior characteristics of the parent particles. Second, based on the improved simulated annealing (SA) algorithm, the method of updating the individual best particles expands the search scope of the domain and solves the problem of being easily trapped in local optimum. Finally, analytic hierarchy process (AHP) is used in this paper to solve the optimal solution satisfying multi-objective optimization.

Through the benchmark experiment and the production example experiment, it is verified that the proposed algorithm has the advantages of high quality of solution and fast speed of convergence.

This method does not consider the unforeseen events that occur during the process of scheduling and cause the disruption of normal production scheduling activities, such as machine breakdown.

IH-PSO algorithm combines PSO algorithm with GA and SA algorithms. This algorithm retains the advantage of fast convergence speed of traditional PSO algorithm and has the characteristic of inheriting excellent genes. In addition, the improved SA algorithm is used to solve the problem of falling into local optimum.

This research provides an efficient scheduling method for solving the FJSP problem.

This research proposes an IH-PSO algorithm to solve the FJSP more efficiently and meet the needs of multi-objective optimization.

The purpose of this paper is to realize a multi‐objective location‐routing network optimization in reverse logistics using particle swarm optimization based on grey relational analysis with entropy weight.

Real world network design problems are often characterized by multi‐objective in reverse logistics. This has recently been considered as an additional objective for facility location problem or vehicle routing problem in reverse logistics network design. Both of them are shown to be NP‐hard. Hence, location‐routing problem (LRP) with multi‐objective is more complicated integrated problem, and it is NP‐hard too. Due to the fact that NP‐hard model cannot be solved directly, grey relational analysis and entropy weight were added to particle swarm optimization to decision among the objectives. Then, a mathematics model about multi‐objective LRP of reverse logistics has been constructed, and a proposed hybrid particle swarm optimization with grey relational analysis and entropy weight has been developed to resolve it. An example is also computed in the last part of the paper.

The results are convincing: not only that particle swarm optimization and grey relational analysis can be used to resolve multi‐objective location‐routing model, but also that entropy and grey relational analysis can be combined to decide weights of objectives.

The method exposed in the paper can be used to deal with multi‐objective LRP in reverse logistics, and multi‐objective network optimization result could be helpful for logistics efficiency and practicability.

The paper succeeds in realising both a constructed multi‐objective model about location‐routing of reverse logistics and a multi‐objective solution algorithm about particle swarm optimization and future stage by using one of the newest developed theories: grey relational analysis.

The purpose of this paper is to propose an optimal energy management (OEM) method using intelligent optimization techniques applied to implement an optimally hybrid heat and power isolated microgrid. The microgrid investigated combines renewable and conventional power generation.

Five bio-inspired optimization methods include an advanced proposed multi-objective particle swarm optimization (MOPSO) approach which is comparatively applied for OEM of the implemented microgrid with other bio-inspired optimization approaches via their comparative simulation results.

Optimal multi-objective solutions through Pareto front demonstrate that the advanced proposed MOPSO method performs quite better in comparison with other meta-heuristic optimization methods. Moreover, the proposed MOPSO is successfully applied to perform 24-h OEM microgrid. The simulation results also display the merits of the real time optimization along with the arbitrary of users’ selection as to satisfy their power requirement.

This paper focuses on the OEM of a designed microgrid using a newly proposed modified MOPSO algorithm. Optimal multi-objective solutions through Pareto front demonstrate that the advanced proposed MOPSO method performs quite better in comparison with other meta-heuristic optimization approaches.

The purpose of this paper is to propose a multi-objective particle swarm optimization (MOPSO) algorithm based design optimization of Brushless DC (BLDC) motor with a view to mitigate cogging torque and enhance the efficiency.

The suitability of MOPSO algorithm is tested on a 120 W BLDC motor considering magnet axial length, stator slot opening and air gap length as the design variables. It avails the use of MagNet 7.5.1, a Finite Element Analysis tool, to account for the geometry and the non-linearity of material for assuaging an improved design framework and operates through the boundaries of generalized regression neural network (GRNN) to advocate the optimum design. The results of MOPSO are compared with Multi-Objective Genetic Algorithm and Non-dominated Sorting Genetic Algorithm-II based formulations for claiming its place in real world applications.

A MOPSO design optimization procedure has been enlivened to escalate the performance of the BLDC motor. The optimality in design has been out reached through minimizing the cogging torque, maximizing the average torque and reducing the total losses to claim an increase in the efficiency. The results have been fortified in well-distributed Pareto-optimal planes to arrive at trade-off solutions between different objectives.

The rhetoric theory of multi objective formulations has been reinforced to provide a decisive solution with regard to the choice of the design obtained from Pareto-optimal planes.

The incorporation of a larger number of design variables together with an orientation to thermal and vibration analysis will still go a long way in bringing on board new dimensions to the fold of optimality in the design of BLDC motors.

The proposal offers a new perspective to the design of BLDC motor in the sense it be-hives the facility of a swarm based approach to optimize the parameters in order that it serves to improve its performance. The results of a 120 W motor in terms of lowering the losses, minimizing the cogging torque and maximizing the average torque emphasize the benefits of the GRNN based multi-objective formulation and establish its viability for use in practical applications.

This paper aims to deal with the optimization of engine operational parameters such as load, compression ratio and blend percentage of fuel using a combined approach of particle swarm optimization (PSO) with Derringer’s desirability.

The performance parameters such as brake thermal efficiency (BTHE), brake specific fuel consumption (BSFC), CO, HC, NO_x and smoke are considered as objectives with compression ratio, blend percentage and load as input factors. Optimization is carried out by using PSO coupled with the desirability approach.

From results, the optimum operating conditions are found to be at compression ratio of 18.5 per cent of fuel blend and 11 kg of load. At this input’s parameters of the engine, outputs performance parameters are found to be 34.84 per cent of BTHE, 0.29 kg/kWh of BSFC, 2.86 per cent of CO, 13 ppm of HC, 490 ppm of NO_x and 26.25 per cent of smoke.

The present study explores the abilities of both particle swarm algorithm and desirability approach when used together. The combined approach resulted in faster convergence and better prediction capability. The present approach predicted performance characteristics of the variable compression ratio engine with less than 10 per cent error.

This paper aims to optimise the dynamic performance of production–inventory control systems in terms of minimisation variance ratio between the order rate and the consumption, and minimisation the integral of absolute error between the actual and the target level of inventory by incorporating the Pareto optimality into particle swarm optimisation (PSO).

The production–inventory control system is modelled and optimised via control theory and simulations. The dynamics of a production–inventory control system are modelled through continuous time differential equations and Laplace transformations. The simulation design is conducted by using the state–space model of the system. The results of multi-objective particle swarm optimisation (MOPSO) are compared with published results obtained from weighted genetic algorithm (WGA) optimisation.

The results obtained from the MOPSO optimisation process ensure that the performance is systematically better than the WGA in terms of reducing the order variability (bullwhip effect) and improving the inventory responsiveness (customer service level) under the same operational conditions.

This research is limited to optimising the dynamics of a single product, single-retailer single-manufacturer process with zero desired inventory level.

PSO is widely used and popular in many industrial applications. This research shows a unique application of PSO in optimising the dynamic performance of production–inventory control systems.

Developing an optimized project schedule that considers all decision criteria represents a challenge for project managers. The purpose of this paper is to provide a multi-objectives overall optimization model for project scheduling considering time, cost, resources, and cash flow. This development aims to overcome the limitations of optimizing each objective at once resulting of non-overall optimized schedule.

In this paper, a multi-objectives overall optimization model for project scheduling is developed using particle swarm optimization with a new evolutionary strategy based on the compromise solution of the Pareto-front. This model optimizes the most important decisions that affect a given project including: time, cost, resources, and cash flow. The study assumes each activity has different execution methods accompanied by different time, cost, cost distribution pattern, and multiple resource utilization schemes.

Applying the developed model to schedule a real-life case study project proves that the proposed model is valid in modeling real-life construction projects and gives important results for schedulers and project managers. The proposed model is expected to help construction managers and decision makers in successfully completing the project on time and reduced budget by utilizing the available information and resources.

The paper presented a novel model that has four main characteristics: it produces an optimized schedule considering time, cost, resources, and cash flow simultaneously; it incorporates a powerful particle swarm optimization technique to search for the optimum schedule; it applies multi-objectives optimization rather than single-objective and it uses a unique Pareto-compromise solution to drive the fitness calculations of the evolutionary process.

The paper aims at the bi‐objective optimization of a two‐echelon distribution network model for facility location and capacity allocation where in a set of customer locations with demands and a set of candidate facility locations will be known in advance. The problem is to find the locations of the facilities and the shipment pattern between the facilities and the distribution centers (DCs) to minimize the combined facility location and shipment costs subject to a requirement that maximum customer demands be met.

To optimize the two objectives simultaneously, the location and distribution two‐echelon network model is mathematically represented in this paper considering the associated constraints, capacity, production and shipment costs and solved using hybrid multi‐objective particle swarm optimization (MOPSO) algorithm.

This paper shows that the heuristic based hybrid MOPSO algorithm can be used as an optimizer for characterizing the Pareto optimal front by computing well‐distributed non‐dominated solutions. These aolutions represent trade‐off solutions out of which an appropriate solution can be chosen according to industrial requirement.

Very few applications of hybrid MOPSO are mentioned in literature in the area of supply chain management. This paper addresses one of such applications.

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.