A Framework for Time-Cost-Quality Optimization in Project Management Problems Using an Exploratory Grid Concept in the Multi-Objective Simulated-Annealing

2021 ◽  
pp. 1-26
Author(s):  
Alzira Mota ◽  
Paulo Ávila ◽  
Ricardo Albuquerque ◽  
Lino Costa ◽  
João Bastos
Keyword(s):  
Decision Making ◽  
Simulated Annealing ◽  
Optimization Problems ◽  
Decision Makers ◽  
Time Cost ◽  
Trade Off ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Criteria Weights ◽  
Optimal Set

Time, cost, and quality are the three indispensable factors for the realization and success of a project. In this context, we propose a framework composed of a multi-objective approach and multi-criteria decision-making methods (MCDM) to solve time-cost-quality trade-off optimization problems. A multi-objective Simulated Annealing (MOSA) algorithm is used to compute an approximation to the Pareto optimal set. The concept of the exploratory grid is introduced in the MOSA to improve its performance. MCDM are used to assist the decision-making process. The Shannon entropy and AHP methods assign weights to criteria. The first methodology is for the inexperienced decision-makers, and the second concedes a personal and flexible weighting of the criteria weights, based on the project manager’s assessment. The TOPSIS and VIKOR methods are considered to rank the solutions. Although they have the same purpose, the rankings achieved are different. A tool is implemented to solve a time-cost-quality trade-off problem on a project activities network. The computational experiments are analyzed and the results with the exploratory grid in Simulated Annealing (SA) are promising. Despite the framework aims to solve multi-objective trade-off optimization problems, supporting the decisions of the project manager, the methodologies used can also be applied in other areas.

scholarly journals A Decomposition-Based Interactive Method for Multi-Objective Evolutionary Algorithm

2012 ◽  
Author(s):  
Nguye Long ◽  
Bui Thu Lam
Keyword(s):  
Optimization Problems ◽  
Decision Makers ◽  
Optimization Process ◽  
Multi Objective Optimization ◽  
Interactive Method ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Single Solution ◽  
Optimal Set

Multi-objectivity has existed in many real-world optimization problems. In most multi-objective cases, objectives are often conflicting, there is no single solution being optimal with regards to all objectives. These problems are called Multi-objective Optimization Problems (MOPs). To date, there have been al large number of methods for solving MOPs including evolutionary methods (namly Multi-objective Evolutionary Algorithms MOEAs). With the use of a population of solutions for searching. MOEAs are naturally suitable for approximating optimal solutions (called the Pareto Optimal Set (POS) or the efficient set). There has been a popular trend in MOEAs considering the role of Decision Makers (DMs) during the optimization process (known as the human-in-loop) for checking, analyzing the results and giving the preference to guide the optimization process. This is call the interactive method.

scholarly journals Elite Exploitation: A Combination of Mathematical Concept and EMO Approach for Multi-Objective Decision Making

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 136
Author(s):  
Wenxiao Li ◽  
Yushui Geng ◽  
Jing Zhao ◽  
Kang Zhang ◽  
Jianxin Liu
Keyword(s):  
Decision Making ◽  
Optimization Problems ◽  
Hybrid Genetic Algorithm ◽  
Decision Makers ◽  
Superior Performance ◽  
Test Problems ◽  
Mathematical Function ◽  
Hyperbolic Tangent ◽  
Nsga Ii ◽  
Multi Objective

This paper explores the combination of a classic mathematical function named “hyperbolic tangent” with a metaheuristic algorithm, and proposes a novel hybrid genetic algorithm called NSGA-II-BnF for multi-objective decision making. Recently, many metaheuristic evolutionary algorithms have been proposed for tackling multi-objective optimization problems (MOPs). These algorithms demonstrate excellent capabilities and offer available solutions to decision makers. However, their convergence performance may be challenged by some MOPs with elaborate Pareto fronts such as CFs, WFGs, and UFs, primarily due to the neglect of diversity. We solve this problem by proposing an algorithm with elite exploitation strategy, which contains two parts: first, we design a biased elite allocation strategy, which allocates computation resources appropriately to elites of the population by crowding distance-based roulette. Second, we propose a self-guided fast individual exploitation approach, which guides elites to generate neighbors by a symmetry exploitation operator, which is based on mathematical hyperbolic tangent function. Furthermore, we designed a mechanism to emphasize the algorithm’s applicability, which allows decision makers to adjust the exploitation intensity with their preferences. We compare our proposed NSGA-II-BnF with four other improved versions of NSGA-II (NSGA-IIconflict, rNSGA-II, RPDNSGA-II, and NSGA-II-SDR) and four competitive and widely-used algorithms (MOEA/D-DE, dMOPSO, SPEA-II, and SMPSO) on 36 test problems (DTLZ1–DTLZ7, WGF1–WFG9, UF1–UF10, and CF1–CF10), and measured using two widely used indicators—inverted generational distance (IGD) and hypervolume (HV). Experiment results demonstrate that NSGA-II-BnF exhibits superior performance to most of the algorithms on all test problems.

Collective intelligence approaches in interactive evolutionary multi-objective optimization

2020 ◽  
Vol 28 (1) ◽  
pp. 95-108 ◽  
Author(s):  
Daniel Cinalli ◽  
Luis Martí ◽  
Nayat Sanchez-Pi ◽  
Ana Cristina Bicharra Garcia
Keyword(s):  
Collective Intelligence ◽  
Real Life ◽  
Decision Makers ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Trade Offs ◽  
Life Problems ◽  
Conflicting Objectives ◽  
Optimal Set

Abstract Evolutionary multi-objective optimization algorithms (EMOAs) have been successfully applied in many real-life problems. EMOAs approximate the set of trade-offs between multiple conflicting objectives, known as the Pareto optimal set. Reference point approaches can alleviate the optimization process by highlighting relevant areas of the Pareto set and support the decision makers to take the more confident evaluation. One important drawback of this approaches is that they require an in-depth knowledge of the problem being solved in order to function correctly. Collective intelligence has been put forward as an alternative to deal with situations like these. This paper extends some well-known EMOAs to incorporate collective preferences and interactive techniques. Similarly, two new preference-based multi-objective optimization performance indicators are introduced in order to analyze the results produced by the proposed algorithms in the comparative experiments carried out.

Including decision-makers preferences in the cost-deprivation trade-off during disaster interventions

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Florian Diehlmann ◽  
Patrick Siegfried Hiemsch ◽  
Marcus Wiens ◽  
Markus Lüttenberg ◽  
Frank Schultmann
Keyword(s):  
Decision Making ◽  
Humanitarian Logistics ◽  
Decision Makers ◽  
Weighted Sum ◽  
Trade Off ◽  
Content Type ◽  
Multi Objective ◽  
Conflicting Objectives ◽  
The Cost

Purpose In this contribution, the purpose of this study is to extend the established social cost concept of humanitarian logistics into a preference-based bi-objective approach. The novel concept offers an efficient, robust and transparent way to consider the decision-maker’s preference. In principle, the proposed method applies to any multi-objective decision and is especially suitable for decisions with conflicting objectives and asymmetric impact. Design/methodology/approach The authors bypass the shortcomings of the traditional approach by introducing a normalized weighted sum approach. Within this approach, logistics and deprivation costs are normalized with the help of Nadir and Utopia points. The weighting factor represents the preference of a decision-maker toward emphasizing the reduction of one cost component. The authors apply the approach to a case study for hypothetical water contamination in the city of Berlin, in which authorities select distribution center (DiC) locations to supply water to beneficiaries. Findings The results of the case study highlight that the decisions generated by the approach are more consistent with the decision-makers preferences while enabling higher efficiency gains. Furthermore, it is possible to identify robust solutions, i.e. DiCs opened in each scenario. These locations can be the focal point of interest during disaster preparedness. Moreover, the introduced approach increases the transparency of the decision by highlighting the cost-deprivation trade-off, together with the Pareto-front. Practical implications For practical users, such as disaster control and civil protection authorities, this approach provides a transparent focus on the trade-off of their decision objectives. The case study highlights that it proves to be a powerful concept for multi-objective decisions in the domain of humanitarian logistics and for collaborative decision-making. Originality/value To the best of the knowledge, the present study is the first to include preferences in the cost-deprivation trade-off. Moreover, it highlights the promising option to use a weighted-sum approach to understand the decisions affected by this trade-off better and thereby, increase the transparency and quality of decision-making in disasters.

scholarly journals Time-Cost-Quality Trade-off Model for Optimal Pile Type Selection Using Discrete Particle Swarm Optimization Algorithm

2019 ◽  
Vol 5 (11) ◽  
pp. 2461-2471
Author(s):  
Hanaa H. Lateef ◽  
Abbas Mohammed Burhan
Keyword(s):  
Decision Making ◽  
Particle Swarm Optimization ◽  
Pso Algorithm ◽  
Pile Foundations ◽  
Time Cost ◽  
Multi Objective Optimization ◽  
Swarm Optimization ◽  
Trade Off ◽  
Multi Objective ◽  
Pile Type

The cost of pile foundations is part of the super structure cost, and it became necessary to reduce this cost by studying the pile types then decision-making in the selection of the optimal pile type in terms of cost and time of production and quality .So The main objective of this study is to solve the time–cost–quality trade-off (TCQT) problem by finding an optimal pile type with the target of "minimizing" cost and time while "maximizing" quality. There are many types In the world of piles but  in this paper, the researcher proposed five pile types, one of them is not a traditional, and   developed a model for the problem and then employed particle swarm optimization (PSO) algorithm, as one of evolutionary algorithms with the help of (Mat lab software), as a tool for decision making problem about choosing the best alternative of the traded piles, and proposes a multi objective optimization model, which aims to optimize the time, cost and quality of the pile types, and assist in selecting the most appropriate pile types. The researcher selected 10 of senior engineers to conduct interviews with them.  And prepared some questions for interviews and open questionnaire. The individuals are selected from private and state sectors each one have 10 years or more experience in pile foundations work. From personal interviews and field survey the research has shown that most of the experts, engineers are not fully aware of new soft wear techniques to helps them in choosing alternatives, despite their belief in the usefulness of using modern technology and software. The Problem is multi objective optimization problem, so after running the PSO algorithm it is usual to have more than one optimal solution, for five proposed pile types, finally the researcher  evaluated and  discussed the output results and  found out that pre-high tension spun (PHC)pile type was the optimal pile type.

An Orthogonal Multi-objective Evolutionary Algorithm for Multi-objective Optimization Problems with Constraints

2004 ◽  
Vol 12 (1) ◽  
pp. 77-98 ◽  
Author(s):  
Sanyou Y. Zeng ◽  
Lishan S. Kang ◽  
Lixin X. Ding
Keyword(s):  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Engineering Problem ◽  
Test Problems ◽  
Pareto Optimal ◽  
Large Set ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Optimal Set

In this paper, an orthogonal multi-objective evolutionary algorithm (OMOEA) is proposed for multi-objective optimization problems (MOPs) with constraints. Firstly, these constraints are taken into account when determining Pareto dominance. As a result, a strict partial-ordered relation is obtained, and feasibility is not considered later in the selection process. Then, the orthogonal design and the statistical optimal method are generalized to MOPs, and a new type of multi-objective evolutionary algorithm (MOEA) is constructed. In this framework, an original niche evolves first, and splits into a group of sub-niches. Then every sub-niche repeats the above process. Due to the uniformity of the search, the optimality of the statistics, and the exponential increase of the splitting frequency of the niches, OMOEA uses a deterministic search without blindness or stochasticity. It can soon yield a large set of solutions which converges to the Pareto-optimal set with high precision and uniform distribution. We take six test problems designed by Deb, Zitzler et al., and an engineering problem (W) with constraints provided by Ray et al. to test the new technique. The numerical experiments show that our algorithm is superior to other MOGAS and MOEAs, such as FFGA, NSGAII, SPEA2, and so on, in terms of the precision, quantity and distribution of solutions. Notably, for the engineering problem W, it finds the Pareto-optimal set, which was previously unknown.

A PARETO MULTI-OBJECTIVE OPTIMIZATION APPROACH FOR SOLVING TIME-COST-QUALITY TRADEOFF PROBLEMS

2011 ◽  
Vol 17 (1) ◽  
pp. 22-41 ◽  
Author(s):  
Xundi Diao ◽  
Heng Li ◽  
Saixing Zeng ◽  
Vivian Wy Tam ◽  
Hongling Guo
Keyword(s):  
Project Planning ◽  
Optimization Approach ◽  
Time Cost ◽  
Multi Objective Optimization ◽  
Quality Performance ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Computer Based ◽  
The Cost ◽  
Optimal Set

Speeding up a project's duration will definitely increase the cost and decrease the quality. The previous literatures were mainly related to project planning and controlling which mainly focus on cost-time tradeoff. However, limited researches have been referred to project quality based on mathematical methodologies. This paper proposes a tradeoff problem on time-cost-quality performance. A computer-based Pareto multi-objective optimization approach is utilized for solving the tradeoff problems. The approach can help searching near the reality Pareto-optimal set while not receiving any information on the stakeholders’ preference for time, cost and quality. Based on the developed approach, decision-making can become easy according to the sorted non-dominated solutions and project preferences.

scholarly journals Solution Selection from a Pareto Optimal Set of Multi-Objective Reservoir Operation via Clustering Operation Processes and Objective Values

Water ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1046
Author(s):  
Yanjun Kong ◽  
Yadong Mei ◽  
Xianxun Wang ◽  
Yue Ben
Keyword(s):  
Reservoir Operation ◽  
Pareto Optimal ◽  
Compromise Solution ◽  
Decision Space ◽  
Trade Off ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Objective Space ◽  
Solution Selection ◽  
Optimal Set

Multi-objective evolutionary algorithms (MOEAs) are widely used to optimize multi-purpose reservoir operations. Considering that most outcomes of MOEAs are Pareto optimal sets with a large number of incomparable solutions, it is not a trivial task for decision-makers (DMs) to select a compromise solution for application purposes. Due to the increasing popularity of data-driven decision-making, we introduce a clustering-based decision-making method into the multi-objective reservoir operation optimization problem. Traditionally, solution selection has been conducted based on trade-off ranking in objective space, and solution characteristics in decision space have been ignored. In our work, reservoir operation processes were innovatively clustered into groups with unique properties in decision space, and the trade-off surfaces were analyzed via clustering in objective space. To attain a suitable performance, a new similarity measure, referred to as the Mei–Wang fluctuation similarity measure (MWFSM), was tailored to reservoir operation processes. This method describes time series in terms of both their shape and quantitative variation. Then, a compromise solution was selected via the joint use of two clustering results. A case study of the Three Gorges cascade reservoirs system under small and medium floods was investigated to verify the applicability of the proposed method. The results revealed that the MWFSM effectively distinguishes reservoir operation processes. Two more operation patterns with similar positions but different shapes were identified via MWFSM when compared with Euclidean distance and the dynamic time warping method. Furthermore, the proposed method decreased the selection range from the whole Pareto optimal set to a set containing relatively few solutions. Finally, a compromise solution was selected.

scholarly journals A Method for Integration of Preferences to a Multi-Objective Evolutionary Algorithm Using Ordinal Multi-Criteria Classification

2021 ◽  
Vol 26 (2) ◽  
pp. 27
Author(s):  
Alejandro Castellanos-Alvarez ◽  
Laura Cruz-Reyes ◽  
Eduardo Fernandez ◽  
Nelson Rangel-Valdez ◽  
Claudia Gómez-Santillán ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Selective Pressure ◽  
Optimization Problems ◽  
Region Of Interest ◽  
Decision Makers ◽  
Multiple Objective ◽  
Objective Functions ◽  
Multi Objective ◽  
Imperfect Knowledge ◽  
Real World Problems

Most real-world problems require the optimization of multiple objective functions simultaneously, which can conflict with each other. The environment of these problems usually involves imprecise information derived from inaccurate measurements or the variability in decision-makers’ (DMs’) judgments and beliefs, which can lead to unsatisfactory solutions. The imperfect knowledge can be present either in objective functions, restrictions, or decision-maker’s preferences. These optimization problems have been solved using various techniques such as multi-objective evolutionary algorithms (MOEAs). This paper proposes a new MOEA called NSGA-III-P (non-nominated sorting genetic algorithm III with preferences). The main characteristic of NSGA-III-P is an ordinal multi-criteria classification method for preference integration to guide the algorithm to the region of interest given by the decision-maker’s preferences. Besides, the use of interval analysis allows the expression of preferences with imprecision. The experiments contrasted several versions of the proposed method with the original NSGA-III to analyze different selective pressure induced by the DM’s preferences. In these experiments, the algorithms solved three-objectives instances of the DTLZ problem. The obtained results showed a better approximation to the region of interest for a DM when its preferences are considered.

Sign in / Sign up

Export Citation Format

Share Document