Search results

The purpose of this paper is to propose a multi-objective differential evolution algorithm named as MOMR-DE to resolve multicast routing problem. In mobile ad hoc network (MANET), multicast routing is a non-deterministic polynomial -complete problem that deals with the various objectives and constraints. Quality of service (QoS) in the multicast routing problem mainly depends on cost, delay, jitter and bandwidth. So the cost, delay, jitter and bandwidth are always considered as multi-objective for designing multicast routing protocols. However, mobile node battery energy is finite and the network lifetime depends on node battery energy. If the battery power consumption is high in any one of the nodes, the chances of network’s life reduction due to path breaks are also more. On the other hand, node’s battery energy had to be consumed to guarantee high-level QoS in multicast routing to transmit correct data anywhere and at any time. Hence, the network lifetime should be considered as one objective of the multi-objective in the multicast routing problem.

Recently, many metaheuristic algorithms formulate the multicast routing problem as a single-objective problem, although it obviously is a multi-objective optimization problem. In the MOMR-DE, the network lifetime, cost, delay, jitter and bandwidth are considered as five objectives. Furthermore, three QoS constraints which are maximum allowed delay, maximum allowed jitter and minimum requested bandwidth are included. In addition, we modify the crossover and mutation operators to build the shortest-path multicast tree to maximize network lifetime and bandwidth, minimize cost, delay and jitter.

Two sets of experiments are conducted and compared with other algorithms for these problems. The simulation results show that our proposed method is capable of achieving faster convergence and is more preferable for multicast routing in MANET.

In MANET, most metaheuristic algorithms formulate the multicast routing problem as a single-objective problem. However, this paper proposes a multi-objective differential evolution algorithm to resolve multicast routing problem, and the proposed algorithm is capable of achieving faster convergence and more preferable for multicast routing.

The purpose of this paper is performance enhancement of ferrite-assisted synchronous reluctance (FASR) motor using multi-objective differential evolution (MODE) algorithm, considering the significant geometric design parameters.

This work illustrates the optimization of FASR motor using MODE algorithm to enhance the performance of the motor considering barrier angular positions, magnet height, magnet axial length, flux barrier angles of the rotor and air gap length. In the optimization routine to determine the performance parameters, generalized regression neural network-based interpolation is used. The results of MODE are validated with multi-objective particle swarm optimization algorithm and multi-objective genetic algorithm.

The design optimization procedure developed in this work for FASR motor aims at achieving multiple objectives, namely, average torque, torque ripple and efficiency. With multiple objectives, it is essential to give the designer the tradeoff between different objectives so as to arrive at the best design suitable for the application. The results obtained in this work justify the application of the MODE approach for FASR motor to determine the various feasible solutions within the bounds of the design.

Analysis, design and optimization of synchronous reluctance motor has been explored in detail to establish its potential for variable speed applications. In recent years, the focus is toward the electromagnetic design of hybrid configurations such as FASR motor. It is in this preview this work aims to achieve optimal design of FASR motor using multi-objective optimization approach.

The results of this work will supplement and encourage the application of FASR motor as a viable alternate for variable speed drive applications. In addition, the application of MODE to arrive at better design solutions is demonstrated.

The approach presented in this work focuses on obtaining enhanced design of FASR motor considering average torque, torque ripple and efficiency as performance measures. The posteriori analysis of optimization provides an insight into the choice of parameters involved and their effects on the design of FASR motor. The efficacy of the optimization routine is justified in comparison with other multi-objective algorithms.

This paper aims to propose a numerically efficient multi-objective optimization strategy, which can improve both the efficiency and performance during the optimization process.

This paper discusses the multi-objective optimization algorithm by combining multi-objective differential evolution (MODE) algorithm with an adaptive dynamic Taylor Kriging (ADTK) model.

The proposed approach is validated through application to an analytic example and applied to a shape optimal design of a multi-layered interior permanent magnet synchronous motor for torque ripple reduction while maintaining the average torque.

The ADTK model selects its basis functions adaptively and dynamically so that it may have better accuracy than any other Kriging models. Through adaptive insertion of new sampling data, it guarantees minimum required sampling data for a desired fitting accuracy.

Driven by sustainable production, mobile robots are introduced as a new clean-energy material handling tool for mixed-model assembly lines (MMALs), which reduces energy consumption and lineside inventory of workstations (LSI). Nevertheless, the previous part feeding scheduling method was designed for conventional material handling tools without considering the flexible spatial layout of the robotic mobile fulfillment system (RMFS). To fill this gap, this paper focuses on a greening mobile robot part feeding scheduling problem with Just-In-Time (JIT) considerations, where the layout and number of pods can be adjusted.

A novel hybrid-load pod (HL-pod) and mobile robot are proposed to carry out part feeding tasks between material supermarkets and assembly lines. A bi-objective mixed-integer programming model is formulated to minimize both total energy consumption and LSI, aligning with environmental and sustainable JIT goals. Due to the NP-hard nature of the proposed problem, a chaotic differential evolution algorithm for multi-objective optimization based on iterated local search (CDEMIL) algorithm is presented. The effectiveness of the proposed algorithm is verified by dealing with the HL-pod-based greening part feeding scheduling problem in different problem scales and compared to two benchmark algorithms. Managerial insights analyses are conducted to implement the HL-pod strategy.

The CDEMIL algorithm's ability to produce Pareto fronts for different problem scales confirms its effectiveness and feasibility. Computational results show that the proposed algorithm outperforms the other two compared algorithms regarding solution quality and convergence speed. Additionally, the results indicate that the HL-pod performs better than adopting a single type of pod.

This study proposes an innovative solution to the scheduling problem for efficient JIT part feeding using RMFS and HL-pods in automobile MMALs. It considers both the layout and number of pods, ensuring a sustainable and environmental-friendly approach to production.

For one thing, despite the fact that it is popular to research the minimization of the power losses in power systems, the optimization of single objective seems insufficient to fully improve the performance of power systems. Multi-objective VAR Dispatch (MVARD) generally minimizes two objectives simultaneously: power losses and voltage deviation. The purpose of this paper is to propose Multi-Objective Enhanced PSO (MOEPSO) algorithm that achieves a good performance when applied to solve MVARD problem. Thus, the new algorithm is worthwhile to be known by the public.

Motivated by differential evolution algorithm, cross-over operator is introduced to increase particle diversity and reinforce global searching capacity in conventional PSO. In addition to that, a constraint-handling approach considering Constrain-prior Pareto-Dominance (CPD) is presented to handle the inequality constraints on dependent variables. Constrain-prior Nondominated Sorting (CNS) and crowding distance methods are considered to maintain well-distributed Pareto optimal solutions. The method combining CPD approach, CNS technique, and cross-over operator is called the MOEPSO method.

The IEEE 30 node and IEEE 57 node on power systems have been used to examine and test the presented method. The simulation results show the MOEPSO method can achieve lower power losses, smaller voltage deviation, and better-distributed Pareto optimal solutions comparing with the Multi-Objective PSO approach.

The most original parts include: the presented MOEPSO algorithm, the CPD approach that is used to handle constraints on dependent variables, and the CNS method which is considered to maintain a well-distributed Pareto optimal solutions. The performance of the proposed algorithm successfully reflects the value of this paper.

As often in project scheduling, when the project duration is shortened to reduce total cost, the total float is lost resulting in more critical or nearly critical activities. This, in turn, results in reducing the probability of completing the project on time and increases the risk of schedule delays. The objective of project management is to complete the scope of work on time, within budget in a safe fashion of risk to maximize overall project success. The purpose of this paper is to present an effective algorithm, named as adaptive multiple objective differential evolution (DE) for project scheduling with time, cost and risk trade-off (AMODE-TCR).

In this paper, a multi-objective optimization model for project scheduling is developed using DE algorithm. The AMODE modifies a population-based search procedure by using adaptive mutation strategy to prevent the optimization process from becoming a purely random or a purely greedy search. An elite archiving scheme is adopted to store elite solutions and by aptly using members of the archive to direct further search.

A numerical construction project case study demonstrates the ability of AMODE in generating non-dominated solutions to assist project managers to select an appropriate plan to optimize TCR problem, which is an operation that is typically difficult and time-consuming. Comparisons between the AMODE and currently widely used multiple objective algorithms verify the efficiency and effectiveness of the developed algorithm. The proposed model is expected to help project managers and decision makers in successfully completing the project on time and reduced risk by utilizing the available information and resources.

The paper presented a novel model that has three main contributions: First, this paper presents an effective and efficient adaptive multiple objective algorithms named as AMODE for producing optimized schedules considering time, cost and risk simultaneously. Second, the study introduces the effect of total float loss and resource control in order to enhance the schedule flexibility and reduce the risk of project delays. Third, the proposed model is capable of operating automatically without any human intervention.

The purpose of this paper is to design an improved multi-objective algorithm with better spread and convergence than some current algorithms. The proposed application is for engineering design problems.

This study proposes two novel approaches which focus on faster convergence to the Pareto front (PF) while adopting the advantages of Strength Pareto Evolutionary Algorithm-2 (SPEA2) for better spread. In first method, decision variables corresponding to the optima of individual objective functions (Utopia Point) are strategically used to guide the search toward PF. In second method, boundary points of the PF are calculated and their decision variables are seeded to the initial population.

The proposed methods are tested with a wide range of constrained and unconstrained multi-objective test functions using standard performance metrics. Performance evaluation demonstrates the superiority of proposed algorithms over well-known existing algorithms (such as NSGA-II and SPEA2) and recent ones such as NSLS and E-NSGA-II in most of the benchmark functions. It is also tested on an engineering design problem and compared with a currently used algorithm.

The algorithms are intended to be used for practical engineering design problems which have many variables and conflicting objectives. A complex example of Welded Beam has been shown at the end of the paper.

The algorithm would be useful for many design problems and social/industrial problems with conflicting objectives.

This paper presents two novel hybrid algorithms involving SPEA2 based on: local search; and Utopia point directed search principles. This concept has not been investigated before.

Project managers work to ensure successful project completion within the shortest period and at the lowest cost. One of the main tasks of a project manager in the planning phase is to generate the project time–cost curve, and furthermore, to determine the most appropriate schedule for the construction process. Numerous existing time–cost tradeoff analysis models have focused on solving a simple project representation without regarding for typical activity and project characteristics. This study aims to present a novel approach called “multiple-objective social group optimization” (MOSGO) for optimizing time–cost decisions in generalized construction projects.

In this paper, a novel MOGSO to mimic the time–cost tradeoff problem in generalized construction projects is proposed. The MOSGO has slightly modified the mechanism operation from the original algorithm to be a free-parameter algorithm and to enhance the exploring and exploiting balance in an optimization algorithm. The evidential reasoning technique is used to rank the global optimal obtained non-dominated solutions to help decision makers reach a single compromise solution.

Two case studies of real construction projects were investigated and the performance of MOSGO was compared to those of widely considered multiple-objective evolutionary algorithms. The comparison results indicated that the MOSGO approach is a powerful, efficient and effective tool in finding the time–cost curve. In addition, the multi-criteria decision-making approaches were applied to identify the best schedule for project implementation.

Accordingly, the first major practical contribution of the present research is that it provides a tool for handling real-world construction projects by considering all types of construction project. The second important implication of this study derives from research finding on the hybridization multiple-objective and multi-criteria techniques to help project managers in facilitating the time–cost tradeoff (TCT) problems easily. The third implication stems from the wide-range application of the proposed model TCT.

The model can be used in early stages of the construction process to help project managers in selecting an appropriate plan for whole project lifecycle.

The proposal model can be applied to multi-objective contexts in diversified fields. Moreover, the model is also a useful reference for future research.

This paper makes contributions to extant literature by: introducing a method for making TCT models applicable to actual projects by considering general activity precedence relations; developing a novel MOSGO algorithm to solving TCT problems in multi-objective context by a single simulation; and facilitating the TCT problems to project managers by using multi-criteria decision-making approaches.

Real-world applications in engineering and other fields usually involve simultaneous optimization of multiple objectives, which are generally non-commensurable and conflicting with each other. This paper aims to treat the transformer design optimization (TDO) as a multiobjective problem (MOP), to minimize the manufacturing cost and the total owing cost, taking into consideration design constraints.

To deal with this optimization problem, a new method is proposed that combines the unrestricted population-size evolutionary multiobjective optimization algorithm (UPS-EMOA) with differential evolution, also applying lognormal distribution for tuning the scale factor and the beta distribution to adjust the crossover rate (UPS-DELFBC). The proposed UPS-DELFBC is useful to maintain the adequate diversity in the population and avoid the premature convergence during the generational cycle. Numerical results using UPS-DELFBC applied to the transform design optimization of 160, 400 and 630 kVA are promising in terms of spacing and convergence criteria.

Numerical results using UPS-DELFBC applied to the transform design optimization of 160, 400 and 630 kVA are promising in terms of spacing and convergence criteria.

This paper develops a promising UPS-DELFBC approach to solve MOPs. The TDO problems for three different transformer specifications, with 160, 400 and 630 kVA, have been addressed in this paper. Optimization results show the potential and efficiency of the UPS-DELFBC to solve multiobjective TDO and to produce multiple Pareto solutions.

In line with computational technological advances, obtaining optimal solutions for engineering problems has become attractive research topics in various disciplines and real engineering systems having multiple objectives. Therefore, it is aimed to ensure that the multiple objectives are simultaneously optimized by considering them among the trade-offs. Furthermore, the practical means of solving those problems are principally concentrated on handling various complicated constraints. The purpose of this paper is to suggest an algorithm based on symbiotic organisms search (SOS), which mimics the symbiotic reciprocal influence scheme adopted by organisms to live on and breed within the ecosystem, for constrained multi-objective engineering design problems.

Though the general performance of SOS algorithm was previously well demonstrated for ordinary single objective optimization problems, its efficacy on multi-objective real engineering problems will be decisive about the performance. The SOS algorithm is, hence, implemented to obtain the optimal solutions of challengingly constrained multi-objective engineering design problems using the Pareto optimality concept.

Four well-known mixed constrained multi-objective engineering design problems and a real-world complex constrained multilayer dielectric filter design problem are tackled to demonstrate the precision and stability of the multi-objective SOS (MOSOS) algorithm. Also, the comparison of the obtained results with some other well-known metaheuristics illustrates the validity and robustness of the proposed algorithm.

The algorithmic performance of the MOSOS on the challengingly constrained multi-objective multidisciplinary engineering design problems with constraint-handling approach is successfully demonstrated with respect to the obtained outperforming final optimal designs.