Search results

This study aims to evaluate the performance of the most popular multi-objective programming scalarization methods in the literature for the aircraft sequencing and scheduling problem (ASSP). These methods are the weighted sum method, weighted goal programming, the ε-constraint method, the elastic constraint method, weighted Tchebycheff and augmented weighted Tchebycheff.

First, the ASSP for a single runway case was modeled using mixed-integer programming considering the safety and operational constraints and the objectives of the minimization of total delay and total flight time for a sample airport. The objectives were then combined by using the multi-objective programming scalarization methods and various expected times of arrival–departure samples were run for the mathematical models. Finally, the methods were evaluated in terms of the number of nondominated solutions, superior nondominated solution and the average solution time using the Measurement of Alternatives and Ranking according to Compromise Solution method, which is a popular multi-criteria decision-making method.

Augmented Weighted Tchebycheff was found to be the most effective approach to ASSP in terms of the evaluation criteria followed by Weighted Tchebycheff and then weighted sum method.

The methodology presented in this study could provide more efficient air traffic management in terminal maneuvering areas when multiple objectives need to be optimized.

Although there are studies including the comparison of several scalarization methods for other problems, the comparison of the methods for ASSP has not yet been handled in the literature. As there are several stakeholders in the air traffic system, ASSP includes several objectives, and as a result, this problem can benefit from analyses using this comparison.

The purpose of this paper is to propose the selection guide of the multi-objective optimization methods for the ergonomic design. The proposed guide enables designers to select an appropriate method for optimizing the human characteristics composed of the engineering characteristics (e.g. users’ height, weight and muscular strength) and the physiological characteristics (e.g. brain wave, pulse-beat and myoelectric signal) in the trade-off relationships.

This paper focuses on the types of the relationships between engineering or physiological characteristics and their psychological characteristics (e.g. comfort and usability). Using these relationships and the characteristics of the multi-objective optimization methods, this paper classified them and constructed a flow chart for selecting them.

This paper applied the proposed selection guide to a geometric design of a comfortable seat and confirmed its applicability. The selected multi-objective optimization method optimized the contact area of seat back (engineering characteristic associated with the comfortable fit of the seat backrest) and the blood flow volume (physiological characteristic associated with the numbness in the lower limb) on the basis of each design intent such as a deep-vein thrombosis after long flight.

Because of the lack of the selection guide of the multi-objective optimization methods, an inappropriate method is often applied in industry. This paper proposed the selection guide applied in the ergonomic design having a lot of the multi-objective optimization problem.

The purpose of this paper is threefold: to make explicitly clear the range of efficient multi‐objective optimization algorithms which are available with kriging; to demonstrate a previously uninvestigated algorithm on an electromagnetic design problem; and to identify algorithms particularly worthy of investigation in this field.

The paper concentrates exclusively on scalarizing multi‐objective optimization algorithms. By reviewing the range of selection criteria based on kriging models for single‐objective optimization along with the range of methods available for transforming a multi‐objective optimization problem to a single‐objective problem, the family of scalarizing multi‐objective optimization algorithms is made explicitly clear.

One of the proposed algorithms is demonstrated on the multi‐objective design of an electron gun. It is able to identify efficiently an approximation to the Pareto‐optimal front.

The algorithms proposed are applicable to unconstrained problems only. One future development is to incorporate constraint‐handling techniques from single‐objective optimization into the scalarizing algorithms.

A family of algorithms, most of which have not been explored before in the literature, is proposed. Algorithms of particular potential (utilizing the most promising developments in single‐objective optimization) are identified.

The optimization of investment portfolios is a topic of major importance in financial decision making, with many relevant models available in the relevant literature. The purpose of this paper is to perform a thorough comparative assessment of different bi-objective models as well as multi-objective one, in terms of the performance and robustness of the whole set of Pareto optimal portfolios.

In this study, three bi-objective models are considered (mean-variance (MV), mean absolute deviation, conditional value-at-risk (CVaR)), as well as a multi-objective model. An extensive comparison is performed using data from the Standard and Poor’s 500 index, over the period 2005–2016, through a rolling-window testing scheme. The results are analyzed using novel performance indicators representing the deviations between historical (estimated) efficient frontiers, actual out-of-sample efficient frontiers and realized out-of-sample portfolio results.

The obtained results indicate that the well-known MV model provides quite robust results compared to other bi-objective optimization models. On the other hand, the CVaR model appears to be the least robust model. The multi-objective approach offers results which are well balanced and quite competitive against simpler bi-objective models, in terms of out-of-sample performance.

This is the first comparative study of portfolio optimization models that examines the performance of the whole set of efficient portfolios, proposing analytical ways to assess their stability and robustness over time. Moreover, an extensive out-of-sample testing of a multi-objective portfolio optimization model is performed, through a rolling-window scheme, in contrast static results in prior works. The insights derived from the obtained results could be used to design improved and more robust portfolio optimization models, focusing on a multi-objective setting.

This paper develops a framework for selecting the most efficient and effective preventive maintenance policy using multiple-criteria decision making and multi-objective optimization.

The critical component is identified with a list of maintenance policies, and then its failure data are collected and the optimization objective functions are defined. Fuzzy AHP is used to prioritize each objective based on the experts' questionnaire. Weighted comprehensive criterion method is used to solve the multi-objective models for each policy. Finally, the effectiveness and efficiency are calculated to select the best maintenance policy.

For a fleet of buses in hot climate environment where coolant pump is identified as the most critical component, it was found that block-GAN policy is the most efficient and effective one with a 10.24% of cost saving and 0.34 expected number of failures per cycle compared to age policy and block-BAO policy.

Only three maintenance policies are compared and studied. Other maintenance policies can also be considered in future.

The proposed methodology is implemented in UAE for selecting a maintenance scheme for a critical component in a fleet of buses. It can be validated later in other Gulf countries.

This research lays a solid foundation for selecting the most efficient and effective preventive maintenance policy for different applications and sectors using MCDM and multi-objective optimization to improve reliability and avoid economic loss.

Although disassembly balancing lines has been studied for over two decades, there is a gap in the robotic disassembly. Moreover, combination of problem with heterogeneous employee assignment is also lacking. The hazard related with the tasks performed on disassembly lines on workers can be reduced by the use of robots or collaborative robots (cobots) instead of workers. This situation causes an increase in costs. The purpose of the study is to propose a novel version of the problem and to solve this bi-objective (minimizing cost and minimizing hazard simultaneously) problem.

The epsilon constraint method was used to solve the bi-objective model. Entropy-based Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Preference Ranking Organization methods for Enrichment Evaluation (PROMETHEE) methods were used to support the decision-maker. In addition, a new criterion called automation rate was proposed. The effects of factors were investigated with full factor experiment design.

The effects of all factors were found statistically significant on the solution time. The combined effect of the number of tasks and number of workers was also found to be statistically significant.

In this study, for the first time in the literature, a disassembly line balancing and employee assignment model was proposed in the presence of heterogeneous workers, robots and cobots to simultaneously minimize the hazard to the worker and cost.

The purpose of this paper is to develop a mathematical model that determines the location of temporary logistics hubs (TLHs) for disaster response and proposes a new method to determine weights of the objectives in a multi-objective optimization problem. The research is motivated by the importance of TLHs and the complexity that surrounds the determination of their location.

A multi-period multi-objective model with multi-sourcing is developed to determine the location of the TLHs. A fuzzy factor rating system (FFRS) under the group decision-making (GDM) condition is then proposed to determine the weights of the objectives when multiple decision makers exist.

The interview with decision makers shows the heterogeneity of decision opinions, thus substantiating the importance of GDM. The optimization results provide useful managerial insights for decision makers by considering the trade-off between two non-commensurable objectives.

In this study, decision makers are considered to be homogeneous, which might not be the case in reality. This study does not consider the stochastic nature of relief demand.

The outcomes of this study are valuable to decision makers for relief distribution planning. The proposed FFRS approach reveals the importance of involving multiple decision makers to enhance sense of ownership of established TLHs.

A mathematical model highlighting the importance of multi-sourcing and short operational horizon of TLHs is developed. A new method is proposed and implemented to determine the weights of the objectives. To the best of the authors’ knowledge, the multi-actor and multi-objective aspects of the TLH location problem have not thus far been considered simultaneously for one particular problem in humanitarian logistics.

This paper aims to investigate different multi-objective optimization (MOO) approaches for design and control of electromagnetic devices. The main goal of MOO is to find the set of design variables or control parameters which will provide the best possible values of typical conflicting objective functions.

In the research studies, standard genetic algorithm (GA), non-dominated sorting GA (NSGA-II), migration NSGA algorithm and alternance method of optimal control theory are discussed and compared.

The test practical problems of multi-criteria optimization of induction heating processes with respect to chosen quality criteria confirm the effectiveness of application of considered MOO approaches both for the problems of design and control.

This paper represents and investigates different MOO approaches for design and control of electrotechnological systems.

The goal of this study is to carry out multi‐objective optimization by considering minimization of surface roughness (Ra) and build time (T) in selective laser sintering (SLS) process, which are functions of “build orientation”. Evolutionary algorithms are applied for this purpose. The performance comparison of the optimizers is done based on statistical measures. In order to find truly optimal solutions, local search is proposed. An important task of decision making, i.e. the selection of one solution in the presence of multiple trade‐off solutions, is also addressed. Analysis of optimal solutions is done to gain insight into the problem behavior.

The minimization of Ra and T is done using two popular optimizers – multi‐objective genetic algorithm (non‐dominated sorting genetic algorithm (NSGA‐II)) and multi‐objective particle swarm optimizers (MOPSO). Standard measures from evolutionary computation – “hypervolume measure” and “attainment surface approximator” have been borrowed to compare the optimizers. Decision‐making schemes are proposed in this paper based on decision theory.

The objects are categorized into groups, which bear similarity in optimal solutions. NSGA‐II outperforms MOPSO. The similarity of spread and convergence patterns of NSGA‐II and MOPSO ensures that obtained solutions are (or are close to) Pareto‐optimal set. This is validated by local search. Based on the analysis of obtained solutions, general trends for optimal orientations (depending on the geometrical features) are found.

A novel and systematic way to address multi‐objective optimization decision‐making post‐optimal analysis is shown. Simulations utilize experimentally derived models for roughness and build time. A further step could be the experimental verification of findings provided in this study.

This study provides a thorough methodology to find optimal build orientations in SLS process. A route to decipher valuable problem information through post‐optimal analysis is shown. The principles adopted in this study are general and can be extended to other rapid prototyping (RP) processes and expected to find wide applicability.

This paper is a distinct departure from past studies in RP and demonstrates the concepts of multi‐objective optimization, decision‐making and related issues.

This paper aims to investigate a multi-objective electric vehicle’s (EV’s) synergetic scheduling problem in the automotive industry, where a synergetic delivery mechanism to coordinate multiple EVs is proposed to fulfill part feeding tasks.

A chaotic reference-guided multi-objective evolutionary algorithm based on self-adaptive local search (CRMSL) is constructed to deal with the problem. The proposed CRMSL benefits from the combination of reference vectors guided evolutionary algorithm (RVEA) and chaotic search. A novel directional rank sorting procedure and a self-adaptive energy-efficient local search strategy are then incorporated into the framework of the CRMSL to obtain satisfactory computational performance.

The involvement of the chaotic search and self-adaptive energy-efficient local search strategy contributes to obtaining a stronger global and local search capability. The computational results demonstrate that the CRMSL achieves better performance than the other two well-known benchmark algorithms in terms of four performance metrics, which is inspiring for future researches on energy-efficient co-scheduling topics in manufacturing industries.

This research fully considers the cooperation and coordination of handling devices to reduce energy consumption, and an improved multi-objective evolutionary algorithm is creatively applied to solve the proposed engineering problem.