In this paper we study a 1.5-dimensional cutting stock and assortment problem which includes determination of the number of different widths of roll stocks to be maintained as inventory and determination of how these ...
详细信息
In this paper we study a 1.5-dimensional cutting stock and assortment problem which includes determination of the number of different widths of roll stocks to be maintained as inventory and determination of how these roll stocks should be cut by choosing the optimal cutting pattern combinations. We propose a new multi-objective mixed integer linear programming (MILP) model in the form of simultaneously minimization two contradicting objectives related to the trim loss cost and the combined inventory cost in order to fulfill a given set of cutting orders. An equivalent nonlinear version and a particular case related to the situation when a producer is interested in choosing only a few number of types among all possible roll sizes, have also been considered. A new method called the conic scalarization is proposed for scalarizing non-convex multi-objective problems and several experimental tests are reported in order to demonstrate the validity of the developed modeling and solving approaches. (c) 2006 Elsevier B.V. All rights reserved.
In order to solve the problem of railway emergency materials dispatching optimization considering the difference of the emergency time limit of the materials, the uniqueness of this problem is analyzed and a multi-obj...
详细信息
In order to solve the problem of railway emergency materials dispatching optimization considering the difference of the emergency time limit of the materials, the uniqueness of this problem is analyzed and a multi-objective dispatching model is established with multi-objective programming method. On base of satisfying the requirement of emergency time limit of different materials, the model achieves the objectives of minimum number of selected depots and minimum cost of dispatching. Then the solution procedure and algorithm of the model is designed and an example is set to verify the feasibility of this algorithm. Analytic results indicate that the model can ensure utilizing and dispatching the emergency materials efficiently and methodically.
Location of fire stations is an important factor in its fire protection capability. This paper aims to determine the optimal location of fire station facilities. The proposed method is the combination of a fuzzy multi...
详细信息
Location of fire stations is an important factor in its fire protection capability. This paper aims to determine the optimal location of fire station facilities. The proposed method is the combination of a fuzzy multi-objective programming and a genetic algorithm. The original fuzzy multiple objectives are appropriately converted to a single unified 'min-max' goal, which makes it easy to apply a genetic algorithm for the problem solving. Compared with the existing methods of fire station location our approach has three distinguish features: (1) considering fuzzy nature of a decision maker (DM) in the location optimization model;(2) fully considering the demands for the facilities from the areas with various fire risk categories;(3) being more understandable and practical to DM. The case study was based on the data collected from the Derbyshire fire and rescue service and used to illustrate the application of the method for the optimization of fire station locations. (c) 2006 Elsevier B.V. All rights reserved.
The paper treats the multi-objective programming problem with a large composite set of (linear and nonlinear) objective functions, the domain of feasible solutions being defined by a set of linear equalities/inequalit...
详细信息
ISBN:
(纸本)9783642184659
The paper treats the multi-objective programming problem with a large composite set of (linear and nonlinear) objective functions, the domain of feasible solutions being defined by a set of linear equalities/inequalities representing a large scale problem. One constructs a preferred solution i.e. a non-dominated solution chosen via extending the decision-making framework. A feasible approach, for this class of problems, is to use a solver for the Linear programming problems and a solver for multiple Attribute Decision Making problems in combination with Parallel and Distributed Computing techniques based on a GRID configuration.
Contemporary food supply chains are generating externalities with high economic and social costs, notably in public health terms through the rise in diet-related non-communicable disease. A decision making model of mu...
详细信息
ISBN:
(纸本)9783037850220
Contemporary food supply chains are generating externalities with high economic and social costs, notably in public health terms through the rise in diet-related non-communicable disease. A decision making model of multi-product multi-stage food supply-chain consisted of single manufacturer and single supplier is proposed in this article. The model is proved to be superior and efficient through application example. Reasonable decisions are suggested by analyzing the solution of dual problem. The decisions could help members of food supply-chain get more profits.
Structural redundancies in mathematical programming models are nothing uncommon and nonlinear programming problems are no exception. Over the past few decades numerous papers have been written on redundancy. Redundanc...
详细信息
Structural redundancies in mathematical programming models are nothing uncommon and nonlinear programming problems are no exception. Over the past few decades numerous papers have been written on redundancy. Redundancy in constraints and variables are usually studied in a class of mathematical programming problems. However, main emphasis has so far been given only to linear programming problems. In this paper, an algorithm that identifies redundant objective function(s) and redundant constraint(s) simultaneously in multi-objective nonlinear stochastic fractional programming problems is provided. A solution procedure is also illustrated with numerical examples. The proposed algorithm reduces the number of nonlinear fractional objective functions and constraints in cases where redundancy exists. (C) 2009 Elsevier B.V. All rights reserved.
We propose a methodology for obtaining the exact Pareto set of Bi-objectivemulti-Dimensional Knapsack Problems, exploiting the concept of core expansion. The core concept is effectively used in single objectivemulti...
详细信息
We propose a methodology for obtaining the exact Pareto set of Bi-objectivemulti-Dimensional Knapsack Problems, exploiting the concept of core expansion. The core concept is effectively used in single objectivemulti-dimensional knapsack problems and it is based on the "divide and conquer" principle. Namely, instead of solving one problem with n variables we solve several sub-problems with a fraction of n variables (core variables). In the multi-objective case, the general idea is that we start from an approximation of the Pareto set (produced with the multi-Criteria Branch and Bound algorithm, using also the core concept) and we enrich this approximation iteratively. Every time an approximation is generated, we solve a series of appropriate single objective Integer programming (IP) problems exploring the criterion space for possibly undiscovered, new Pareto Optimal Solutions (POS). If one or more new POS are found, we appropriately expand the already found cores and solve the new core problems. This process is repeated until no new POS are found from the IP problems. The paper includes an educational example and some experiments.
In the smart grid environment, appropriate power energy exchange strategies will be necessary for energy intensive industries (EIIs) with industrial power plants. This paper presents a systematic approach that can cop...
详细信息
ISBN:
(纸本)9781424462551
In the smart grid environment, appropriate power energy exchange strategies will be necessary for energy intensive industries (EIIs) with industrial power plants. This paper presents a systematic approach that can cope with the integration of industry consumers and an energy exchange strategy aiming at achieving balance between power production and consumption in EIIs. A basic balance model using Linear programming (LP) is built and the generation levels of thermal units are obtained. The solution is further improved to provide a more smooth power output curve. The ramping constraints of thermal units are addressed to ensure the result obtained is energy realizable. Penalty terms are also introduced in the objective function to reduce the level of power energy exchange between EII and the grid. Finally, numerical tests are performed and the simulation results for a real system suggest that the method presented is effective.
Demand and supply pattern for most products varies during their life cycle in the markets. In this paper, the author presents a transportation problem with non-linear constraints in which supply and demand are symmetr...
详细信息
Demand and supply pattern for most products varies during their life cycle in the markets. In this paper, the author presents a transportation problem with non-linear constraints in which supply and demand are symmetric trapezoidal fuzzy value. In order to reflect a more realistic pattern, the unit of transportation cost is assumed to be stochastic. Then, the non-linear constraints are linearized by adding auxiliary constraints. Finally, the optimal solution of the problem is found by solving the linear programming problem with fuzzy and crisp constraints and by applying fuzzy programming technique. A new method proposed to solve this problem, and is illustrated through numerical examples. multi-objective goal programming methodology is applied to solve this problem. The results of this research were developed and used as one of the Decision Support System models in the Logistics Department of Kayson Co.
In the last 10 years much has been written about the drawbacks of radial projection. During this time, many authors proposed methods to explore, interactively or not, the efficient frontier via non-radial projections....
详细信息
In the last 10 years much has been written about the drawbacks of radial projection. During this time, many authors proposed methods to explore, interactively or not, the efficient frontier via non-radial projections. This paper compares three families of data envelopment analysis (DEA) models: the traditional radial, the preference structure and the multi-objective models. We use the efficiency analysis of Rio de Janeiro Odontological Public Health System as a background for comparing the three methods through a real case with one integer and one exogenous variable. The objectives of the study case are ( i) to compare the applicability of the three approaches for efficiency analysis with exogenous and integer variables, (ii) to present the main advantages and drawbacks for each approach, (iii) to prove the impossibility to project in some regions and its implications, (iv) to present the approximate CPU time for the models, when this time is not negligible. We find that the multi-objective approach, although mathematically equivalent to its preference structure peer, allows projections that are not present in the latter. Furthermore, we find that, for our case study, the traditional radial projection model provides useless targets, as expected. Furthermore, for some parts of the frontier, none of the models provide suitable targets. Other interesting result is that the CPU-time for the multi-objective formulation, although its endogenous high complexity, is acceptable for DEA applications, due to its compact nature.
暂无评论