In this paper, we propose novel mathematical models involving both single- and biobjective functions that deal with a flexible job shop scheduling problem in cellular manufacturing environment by taking into considera...
详细信息
In this paper, we propose novel mathematical models involving both single- and biobjective functions that deal with a flexible job shop scheduling problem in cellular manufacturing environment by taking into consideration exceptional parts, intercellular moves, intercellular transportation times, sequence-dependent family setup times, and recirculation. The problem has been known as NP-hard. The proposed models have been tested and solved using Lingo 11.0 with minimization of makespan for the problems involving about 4 cells, 4 part families, 15 parts, and 12 machines. The most suitable model among the proposed single-objective models is determined using the test results. Then, another objective function as total tardiness is added to this model. The obtained biobjective model is solved using the scalarizationmethods, the weighted sum method, e-constraint method, and conic scalarization method (CSM), in order to convert the mathematical model's objectives into a single-objective function. By utilizing these scalarizationmethods, the Pareto effective solutions are generated for a specific test problem. The advantages of the CSM are demonstrated by considering the Pareto effective solutions.
The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantees to generate all proper efficient solutions and does not require any kind of ...
详细信息
ISBN:
(纸本)9783319181615;9783319181608
The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantees to generate all proper efficient solutions and does not require any kind of convexity or boundedness conditions. In addition the preference and reference point information of the decision maker is taken into consideration by this method. In this paper, relations with other scalarizationmethods are investigated and it is shown that some efficient solutions computed by the Pascoletti-Serafini and the Benson's scalarizationmethods, can be obtained by the conic scalarization method.
This paper presents the conic scalarization method for scalarization of nonlinear multi-objective optimization problems. We introduce a special class of monotonically increasing sublinear scalarizing functions and sho...
详细信息
This paper presents the conic scalarization method for scalarization of nonlinear multi-objective optimization problems. We introduce a special class of monotonically increasing sublinear scalarizing functions and show that the zero sublevel set of every function from this class is a convex closed and pointed cone which contains the negative ordering cone. We introduce the notion of a separable cone and show that two closed cones (one of them is separable) having only the vertex in common can be separated by a zero sublevel set of some function from this class. It is shown that the scalar optimization problem constructed by using these functions, enables to characterize the complete set of efficient and properly efficient solutions of multi-objective problems without convexity and boundedness conditions. By choosing a suitable scalarizing parameter set consisting of a weighting vector, an augmentation parameter, and a reference point, decision maker may guarantee a most preferred efficient or properly efficient solution.
The paper presents an analysis, characterizations and comparison of six commonly used scalarizationmethods in multiobjective optimization. The properties of these methods are investigated with respect to the basic ch...
详细信息
The paper presents an analysis, characterizations and comparison of six commonly used scalarizationmethods in multiobjective optimization. The properties of these methods are investigated with respect to the basic characteristics such as ordering cone, convexity and boundedness, the ability of generating proper efficient solutions, the ability to consider reference points which is a choice of decision maker as a solution and weighting preferences of decision maker, the number of additional constraints and decision variables. The paper also presents new characteristics for these methods and relations between them. The main characteristics of these scalarizationmethods are illustrated on the same example.
This paper presents existence conditions and characterization theorems for minimal points of nonconvex vector optimization problems in reflexive Banach spaces. Characterization theorems use special class of monotonica...
详细信息
This paper presents existence conditions and characterization theorems for minimal points of nonconvex vector optimization problems in reflexive Banach spaces. Characterization theorems use special class of monotonically increasing sublinear scalarizing functions which are defined by means of elements of augmented dual cones. It is shown that the Hartley cone-compactness is necessary and sufficient to guarantee the existence of a properly minimal point of the problem. The necessity is proven in the case of finite dimensional space.
Nowadays, the widespread use of fossil based fuels in power generation units requires the consideration of the environmental pollution. Therefore, in this study, the solution of scalarized environmental economic power...
详细信息
Nowadays, the widespread use of fossil based fuels in power generation units requires the consideration of the environmental pollution. Therefore, in this study, the solution of scalarized environmental economic power dispatch problem in which the environmental pollution has been taken into consideration has been analyzed by using genetic algorithm (GA). In order to turn the environmental economic power dispatch problem into the single objective optimization problem, the conic scalarization method (CSM) has been used. Also, weighted sum method (WSM) has been utilized in the scalarization of the same problem for comparison with CSM. The solution algorithm is tested for the electric power system of thermal units which has been solved by different methods in the literature. The best solution values that give minimum total fuel cost and minimum total emission values have been obtained (Pareto optimal values) for different weight values under electric constraints via CSM and WSM. The obtained Pareto optimal values for different scalarizationmethods have been compared with each other. (C) 2011 Elsevier Ltd. All rights reserved.
暂无评论