Designing an optimal connected nature reserve

We consider a landscape divided into elementary cells, each of these cells containing some species to be protected. We search to select a set of cells to form a natural reserve in order to protect all the species present in the landscape. A species is considered protected if it is present in a certain number of cells of the reserve. There is an important spatial constraint concerning the set of selected cells: a species must be able to go from any cell to any cell without leaving the reserve. An integer linear programming model was proposed by Önal and Briers [2] for this reserve selection problem, but the size of the problems which can be handled by this model is limited: several hours of computation are required for solving instances with hundred of cells and hundred of species. Having proposed an improvement of this model which reduces appreciably the computation time, we propose another integer linear programming model, easy to carry out, which allows to obtain, in a few seconds of computation, optimal or near-optimal solutions for instances with hundred of cells and hundred of species. However, the computation time becomes prohibitive for instances with more than 200 cells and 100 species. But, this approach can be particularly useful to solve the problem, in an approximate way, by aggregation of cells as proposed by Önal and Briers [2].     

Aggregate production planning for process industries under oligopolistic competition

We consider a competitive version of the traditional aggregate production planning model with capacity constraints. In the general case, multiple products are produced by a few competing producers (oligopoly) with limited capacities. Production quantities, prices and consequently profits depend on production and allocation decisions of each producer. In addition, there is competition for the raw material whose supplies are limited, and where prices reflect these limitations. Such situations have recently occurred in several process industry settings including petro-refining, petrochemicals, basic chemicals, cement, fertilizers, pharmaceuticals, rubber, paper, food processing and metals. We use a successive “Bertrand–Cournot” framework to address this problem and to determine optimal production quantities, prices and profits at the producers and at the raw material supplier. Our analysis allows a new way to understand and evaluate the marginal value of additional capacity when there is competition for the market and raw materials.     

Optimization of a highway project planning using a modified genetic algorithm

This paper proposes an optimization method for a national-level highway project planning based on a modified genetic algorithm. The proposed method adds to the existing methods by integrating various planning elements into a single system. A simulation model is used in order to determine the best investment strategy with regard to net present value, time deviation from the initial plan and discrepancy between available resources and investment costs by taking into account economical, social, traffic and political factors. The outcome is a project schedule with an optimized cash flow. The proposed method was tested using the example of the National Highway Programme in Slovenia.     

A Mixed Integer Formulation for Multiple-Route Transit Network Design

We consider the design of multiple transit lines in a network and present a mixed integer formulation for this multiple-route transit network design problem (MRTNDP). With the introduction of node labels, the formulation can exploit the route structure and hence attains efficiency in obtaining a cost minimizing transit network design. This revised version was published online in July 2006 with corrections to the Cover Date.     

教育专业规划的一个定量分析问题

本依据教育专业规划的定量分析方法，讲述了规划一所中学的办学模型的数学手段，提出了需考虑的主要因素，介绍了这些因素的量化方法，所应用的数学模型。     

A rolling window optimization method for large-scale WCDMA base stations planning problem

The large-scale base station planning problem for wideband code division multiple access (WCDMA) wireless networks is studied in this paper. A new rolling window optimization method is presented, where the global optimization problem is decomposed into small optimization sub-problems, which are defined on a series of successive rolling windows. Effective rolling strategies are designed in the rolling optimization method based on the prediction of the interference among the base stations in the WCDMA wireless network. We show that the proposed method has the property that the global objective is non-increasing in the successive optimization procedure. Simulations are carried out to analyze the performance of the proposed optimization method, which show the importance of the rolling strategy.     

高等级公路路线方案的多目标量化优选

应用最小二乘法准则,并改进了层次分析法判断矩阵的构成,获得考虑专家评价水平的诸影响因素权向量;基于集值统计法和属性数学原理,建立了对高等级公路路线方案量化综合评价优选模型,并给出了计算实例.     

Two storage inventory model with fuzzy deterioration over a random planning horizon

An inventory model for a deteriorating item with stock dependent demand is developed under two storage facilities over a random planning horizon, which is assumed to follow exponential distribution with known parameter. For crisp deterioration rate, the expected profit is derived and maximized via genetic algorithm (GA). On the other hand, when deterioration rate is imprecise then optimistic/pessimistic equivalent of fuzzy objective function is obtained using possibility/necessity measure of fuzzy event. Fuzzy simulation process is proposed to maximize the optimistic/pessimistic return and finally fuzzy simulation-based GA is developed to solve the model. The models are illustrated with some numerical data. Sensitivity analyses on expected profit function with respect to distribution parameter λ and confidence levels α₁ and α₂ are also presented.     

Periodicity of equilibrium structures in a time dependent markov model under stochastic environment

The problem of periodicity for a non–homogeneous Markov model in a stochastic environment is studied. The stochastic concept is established through the notion of optional scenarios applied on the transition process. It is proved that the sequence of so–called aggregate structures follows a certain periodic pattern that can split into converging subsequences according to alternative policies. These limits are highly influenced by the different scenarios utilized in the model, but always lie on a convex region that also depends on the pool of alternatives.