A multiobjective planning model for university resource allocation

Application of systematic approaches and dynamic planning for efficient resources allocation in institutions of higher education has been quite prevalent the past fifteen years. However, most models developed for university management have focused upon the analysis of input (budget/resource) requirements. They have generally neglected the existing environment, unique institutional values, and bureaucratic decision structures. In this study, a large scale goal programming model is developed for an efficient allocation of resources for an entire university for a five year planning period. The results of the model have been implemented in the form of administrative actions to achieve a set of multiple objectives.     

Evacuation planning using multiobjective evolutionary optimization approach

In an emergency situation, evacuation is conducted in order to displace people from a dangerous place to a safer place, and it usually needs to be done in a hurry. It is necessary to prepare evacuation plans in order to have a good response in an emergency situation. A central challenge in developing an evacuation plan is in determining the distribution of evacuees into the safe areas, that is, deciding where and from which road each evacuee should go. To achieve this aim, several objective functions should be brought into consideration and need to be satisfied simultaneously, though these objective functions may often conflict with each other.     

A subgradient method for multiobjective optimization

A method for solving quasiconvex nondifferentiable unconstrained multiobjective optimization problems is proposed in this paper. This method extends to the multiobjective case of the classical subgradient method for real-valued minimization. Assuming the basically componentwise quasiconvexity of the objective components, full convergence (to Pareto optimal points) of all the sequences produced by the method is established.     

A multiobjective optimization model for processing and distributing biosolids to reuse fields

Advanced wastewater treatment plants remove deleterious nutrients, chemicals, and microorganisms from wastewater and produce biosolids products to be reused at farms and other sites. These biosolids are carefully regulated by environmental restrictions but still may be malodorous to the local populations. In this paper, we develop a multiobjective optimization model to simultaneously minimize the biosolids odours as well as processing and distribution costs. The model employs a linear odour function and bilinear costs; the latter being approximated via Schur's decomposition and special ordered set (SOS) type 2 variables resulting in a mixed integer linear multiobjective optimization problem. Such a model can be used proactively by these plants to produce the least malodorous product at minimal costs. We demonstrate use of the model with a case study for the Blue Plains advanced wastewater treatment plant run by the DC Water and Sewer Authority in Washington, DC.     

A multiobjective optimization model for the waste management of the petrochemical industry

A multiobjective optimization model based on the goal programming approach is proposed in this paper to assist in the proper management of hazardous waste generated by the petrochemical industry. The analytic hierarchy process (AHP), a decision-making approach, incorporating qualitative and quantitative aspects of a problem, is incorporated in the model to prioritize the conflicting goals usually encountered when addressing the waste management problems of the petrochemical industry. The application of the model has been illustrated through a numerical example, using hypothetical but representative data.     

A weighting subgradient algorithm for multiobjective optimization

We propose a weighting subgradient algorithm for solving multiobjective minimization problems on a nonempty closed convex subset of an Euclidean space. This method combines weighting technique and the classical projected subgradient method, using a divergent series steplength rule. Under the assumption of convexity, we show that the sequence generated by this method converges to a Pareto optimal point of the problem. Some numerical results are presented.     

A multiobjective stochastic program for hospital bed planning

In this paper, we study hospital bed capacity management for a set of existing hospitals when the demand for beds is random. We propose a multiobjective stochastic program model to assign beds to hospital departments. We consider three objective functions to be minimized, which are the cost of creation and management of new beds and the number of nurses and physicians working in these hospitals, subject to demand satisfaction of three kinds of health-care specialities. A certainty equivalent program was derived based on a mixture between the chance constrained approach, the recourse approach and the goal programming approach. Empirical results using real data from 157 Tunisian national hospitals are reported.     

A decisional procedure for water resources planning taking into account water quality constraints

This paper describes an approach for water resources planning taking into account both quantity and quality aspects. A decisional procedure is proposed which consists of two phases. In the first phase, the water resources sharing problem is dealt with, taking into account the demands of the various water users and the requirement of a minimum flow in any section of the river. In the second phase, the problem of fulfilling water quality standards is considered. This may require to reformulate the water resources sharing problem in order to increase the water flow in the river.     

A stochastic programming model for water resource planning

A framework is offered for the evaluation of electricity generation and water supply for agricultural irrigation. This assessment is conducted through the construction of an appropriate stochastic optimization model. A recursive least squares algorithm is incorporated in the model which enables more accurate estimation of model parameters.     

A procedure for selection of a multiobjective technique with application to water and mineral resources

The problem of selecting the appropriate multiobjective solution technique to solve an arbitrary multiobjective decision problem is considered. Various classification schemes of available techniques are discussed, leading to the development of a set of 28 model choice criteria and an algorithm for model choice. This algorithm divides the criteria into four groups, only one of which must be reevaluated for each decision problem encountered. The model choice problem is itself modeled as a multiobjective decision problem—strongly influenced, however, by the individual performing the analysis. The appropriate technique is selected for implementation by use of the compromise programming technique. Two example problems are presented to demonstrate the use of this algorithm. The first is concerned with ranking a predefined set of river basin planning alternatives with multiple noncommensurate ordinally ranked consequences. The second deals with coal blending and is modeled by dual objective linear programming. An appropriate multiobjective solution technique is selected for each of these two examples.     

A novel evolution strategy for multiobjective optimization problem

Recent literatures have suggested that multiobjective evolutionary algorithms (MOEAs) can serve as a more exploratory and effective tool in solving multiobjective optimization problems (MOPs) than traditional optimizers. In order to contain a good approximation of Pareto optimal set with wide diversity associated with the inherent characters and variability of MOPs, this paper proposes a new evolutionary approach—(μ, λ) multiobjective evolution strategy ((μ, λ)-MOES). Following the highlight of how to balance proximity and diversity of individuals in exploration and exploitation stages respectively, some cooperative techniques are devised. Firstly, a novel combinatorial exploration operator that develops strong points from Gaussian mutation of proximity exploration and from Cauchy mutation of diversity preservation is elaborately designed. Additionally, we employ a complete nondominance selection so as to ensure maximal pressure for proximity exploitation while a fitness assignment determined by dominance and population diversity information is simultaneous used to ensure maximal diversity preservation. Moreover, a dynamic external archive is introduced to store elitist individuals as well as relatively better individuals and exchange information with the current population when performing archive increase scheme and archive decrease scheme. By graphical presentation and examination of selected performance metrics on three prominent benchmark test functions, (μ, λ)-MOES is found to outperform SPEA-II to some extent in terms of finding a near-optimal, well-extended and uniformly diversified Pareto optimal front.     

A hybrid quantum-inspired immune algorithm for multiobjective optimization

This study suggests a novel quantum immune algorithm for finding Pareto-optimal solutions to multiobjective optimization problems based on quantum computing and immune system. In the proposed algorithm, there are distinct characteristics as follows. First, the encoding method is based on Q-bit representation, and thus a chaos-based approach is suggested to initialize the population. Second, a new chaos-based rotation gate and Q-gates are presented to perform mutation and improve the quality of the population, respectively. Finally, especially, a new truncation algorithm with similar individuals (TASI) is utilized to preserve the diversity of the population. Also, a new selection operator is proposed to create the new population based on TASI. Simulation results on six standard problems (ZDT6, CP, SP, VNT, OSY and KIT) show the proposed algorithm is able to find a much better spread of solutions and has better convergence near the true Pareto-optimal front compared to the vector immune algorithm (VIS) and the elitist non-dominated sorting genetic system (NSGA-II).     

A gap between multiobjective optimization and scalar optimization

We give an example to illustrate a gap between multiobjective optimization and single-objective optimization, which solves a problem proposed in Ref. 1.     

Interactive algorithm for multiobjective optimization

The definition of a class of matrices in Ref. 1 is modified.     

Interactive algorithm for multiobjective optimization

A man-machine interactive algorithm is given for solving multiobjective optimization problems involving one decision maker. The algorithm, a modification of the Frank-Wolfe steepest ascent method, gives at each iteration a significant freedom and ease for the decision-maker's self-expression, and requires a minimal information on his local estimate of the steepest-ascent direction. The convergence of the iterative algorithm is proved under natural assumptions on the convergence and stability of the basic Frank-Wolfe algorithm.     

A robust optimization model for production planning of perishable products

In this study, a robust optimization model is developed to solve production planning problems for perishable products in an uncertain environment in which the setup costs, production costs, labour costs, inventory costs, and workforce changing costs are minimized. Using the concept of postponement, the production process for perishable products is differentiated into two phases to better utilize the resources. By adjusting penalty parameters, decision-makers can determine an optimal production loading plan and better utilize resources while considering different economic growth scenarios. A case from a Hong Kong plush toy company is studied and the characteristics of perishable products are discussed. Numerical results demonstrate the robustness and effectiveness of the proposed model. An analysis of the trade-off between solution robustness and model robustness is also presented.     

A hybrid immune multiobjective optimization algorithm

In this paper, we develop a hybrid immune multiobjective optimization algorithm (HIMO) based on clonal selection principle. In HIMO, a hybrid mutation operator is proposed with the combination of Gaussian and polynomial mutations (GP-HM operator). The GP-HM operator adopts an adaptive switching parameter to control the mutation process, which uses relative large steps in high probability for boundary individuals and less-crowded individuals. With the generation running, the probability to perform relative large steps is reduced gradually. By this means, the exploratory capabilities are enhanced by keeping a desirable balance between global search and local search, so as to accelerate the convergence speed to the true Pareto-optimal front in the global space with many local Pareto-optimal fronts. When comparing HIMO with various state-of-the-art multiobjective optimization algorithms developed recently, simulation results show that HIMO performs better evidently.     

Demilitarized zone planning: A multiobjective approach

The demilitarized zone has been used frequently as a means to separate conflicting nations. Imposition of a buffer zone free from military activities is considered to be an effective first step to restore peace between hostile nations. The demilitarized zone is usually patrolled by third-party forces to discourage military hostilities. This paper deals with the problem of allocating the third-party supervisory forces in order to assure effective policing of demilitarized zones where there are multiple and conflicting objectives.     

A decision tool for optimal irrigated crop planning and water resources sustainability

In the present study, the conjunctive use policies of surface and ground water resources are developed for minimizing water shortage in an irrigation district subject to constraints on groundwater withdrawals and crop planning capacities. An integrated soil water balance algorithm is coupled to a non-linear optimization model in order to carry out water allocation planning in complex deficit agricultural water resources systems based on an economic efficiency criterion. Various options of conjunctive use water resources along with current and proposed cropping patterns have been explored by Koohdasht Irrigation District (KID), a semi-arid region in I.R. Iran. The analysis provides various scenarios, which can help managers in decision-making for the optimum allocation plans of water resources within the irrigation area. The results reveal that the proposed model, as a decision tool for optimal irrigated crop planning and water resources sustainability, may be used for maximizing the overall net benefits and global water productivity of an irrigation district considering an allowable annual recharge of groundwater. Findings indicate the importance of the conjunctive water management modeling, which can be easily implemented and would enhance the overall benefits from cropping activities in the study area.     

A general approach for studying duality in multiobjective optimization

A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular cases and the general duality is specialized for some of them, namely linear scalarization, maximum (-linear) scalarization, set scalarization, (semi)norm scalarization and quadratic scalarization.