Solving the Shortest Path Problem with Interval Arcs

This paper presents an algorithm for the shortest path problem when the connected arcs in a transportation network are represented as interval numbers. The methodology proposed in this paper considers fuzzy preference ordering of intervals (Sengupta and Pal (2000), European Journal of Operational Research 127, 28–43) from pessimistic and optimistic decision maker’s point of view.     

Fuzzy Bayesian estimation on lifetime data

Summary  The Bayesian estimation on lifetime data under fuzzy environments is proposed in this paper. In order to apply the Bayesian approach, the fuzzy parameters are assumed as fuzzy random variables with fuzzy prior distributions. The (conventional) Bayesian estimation method will be used to create the fuzzy Bayes point estimator by invoking the well-known theorem called “Resolution Identity” in fuzzy set theory. On the other hand, we also provide computational procedures to evaluate the membership degree of any given Bayes point estimate. In order to achieve this purpose, we transform the original problem into a nonlinear programming problem. This nonlinear programming problem is then divided into four subproblems for the purpose of simplifying computation. Finally, the subproblems can be solved by using any commercial optimizers, e.g., GAMS or LINDO.     

A linear programming priority method for a fuzzy transportation problem with non-linear constraints

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.     

具有模糊信息的多目标运输问题求解

提出一种求解具有模糊信息的多目标运输问题的方法。利用专家意见通过模糊算法集给从各产地到各目的地运送单位物资的模糊综合指标值,运用一种对模糊数排序的方法,将模糊多目标运输问题转化为单目标的运输问题进行求解,最后给出了一个数值例子。     

A strongly polynomial algorithm for the transportation problem

For the (linear) transportation problem withm supply nodes,n demand nodes andk feasible arcs we describe an algorithm which runs in time proportional tom logm(k + n logn) (assuming w.l.o.g.mn). The algorithm uses excess scaling. The complexity bound is a slight improvement over the bound achieved by an application of a min-cost-flow algorithm of Orlin to the transportation problem.Corresponding author. Research supported in part by grant no. I-84-095.06/88 of the German—Israeli-Foundation for Scientific Research and Development.     

Fuzzy real algebra: Some results

In this paper, the possibility to perform easily most of the extended n-ary operations on fuzzy subsets of the real line is shown. A general algorithm is given. These results are particularized for usual operations such as addition, subtraction, multiplication, division, ‘max’ and ‘min’ operations for normalized convex fuzzy subsets of the real line, i.e. fuzzy numbers. A three parameters representation for fuzzy numbers is shown to be very convenient to perform usual operations. Lastly, interpretative comments about fuzzy real algebra are given and possible applications pointed out.     

Fuzzy profit measures for a fuzzy economic order quantity model

Changing economic conditions make the selling price and demand quantity more and more uncertain in the market. The conventional inventory models determine the selling price and order quantity for a retailer’s maximal profit with exactly known parameters. This paper develops a solution method to derive the fuzzy profit of the inventory model when the demand quantity and unit cost are fuzzy numbers. Since the parameters contained in the inventory model are fuzzy, the profit value calculated from the model should be fuzzy as well. Based on the extension principle, the fuzzy inventory problem is transformed into a pair of two-level mathematical programs to derive the upper bound and lower bound of the fuzzy profit at possibility level α. According to the duality theorem of geometric programming, the pair of two-level mathematical programs is transformed into a pair of conventional geometric programs to solve. By enumerating different α values, the upper bound and lower bound of the fuzzy profit are collected to approximate the membership function. Since the profit of the inventory problem is expressed by the membership function rather than by a crisp value, more information is provided for making decisions.     

Pricing decisions for substitutable products with a common retailer in fuzzy environments

The pricing problem of substitutable products in a fuzzy supply chain is analyzed by using game theory in this paper. There are two substitutable products produced by two competitive manufacturers respectively and then sold by one common retailer to the consumers. Both the manufacturing cost and the customer demand for each product are characterized as fuzzy variables. How the two manufacturers and the common retailer make their own pricing decisions about wholesale prices and retail prices are explored under four different scenarios, and the corresponding expected value models are developed in this paper. Finally, a numerical example is given to illustrate the effectiveness of the proposed supply chain models.     

A fuzzy approach to the transportation problem

The transportation problem with fuzzy supply values of the deliverers and with fuzzy demand values of the receivers is analysed. For the solution of the problem the technique of parametric programming is used. This makes it possible to obtain not only the maximizing solution (according to the Bellman-Zadeh criterion) but also other alternatives close to the optimal solution.     

Multi-objective genetic algorithm for single machine scheduling problem under fuzziness

This paper presents a new multi-objective approach to a single machine scheduling problem in the presence of uncertainty. The uncertain parameters under consideration are due dates of jobs. They are modelled by fuzzy sets where membership degrees represent decision maker’s satisfaction grade with respect to the jobs’ completion times. The two objectives defined are to minimise the maximum and the average tardiness of the jobs. Due to fuzziness in the due dates, the two objectives become fuzzy too. In order to find a job schedule that maximises the aggregated satisfaction grade of the objectives, a hybrid algorithm that combines a multi-objective genetic algorithm with local search is developed. The algorithm is applied to solve a real-life problem of a manufacturing pottery company.     

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.     

Method of solution to fuzzy relation equations in a complete Brouwerian lattice

Up to now, how to solve a fuzzy relation equation in a complete Brouwerian lattice is still an open problem as Di Nola et al. point out. To this problem, the key problem is whether there exists a minimal element in the solution set when a fuzzy relation equation is solvable. In this paper, we first show that there is a minimal element in the solution set of a fuzzy relation equation AX=b (where A=(a₁,a₂,…,a_n) and b are known, and X=(x₁,x₂,…,x_n)^T is unknown) when its solution set is nonempty, and b has an irredundant finite join-decomposition. Further, we give the method to solve AX=b in a complete Brouwerian lattice under the same conditions. Finally, a method to solve a more general fuzzy relation equation in a complete Brouwerian lattice when its solution set is nonempty is also given under similar conditions.     

Generalized minimal cost flow problem in fuzzy nature: An application in bus network planning problem

The aim of minimal cost flow problem (MCFP) in fuzzy nature, which is denoted with FMCFP, is to find the least cost of the shipment of a commodity through a capacitated network in order to satisfy imprecise concepts in supply or demand of network nodes and capacity or cost of network links. Fuzzy supply–demand may arise in real problems, where incomplete statistical data or simulation results are used. Also, variation in the cost or capacity of links is commonly happening. In the present paper, after defining a total order on LR type fuzzy numbers, three models are studied; MCFP with fuzzy costs, MCFP with fuzzy supply–demand and a combination of two cases. For the first model, scaling negative cycle cancelling algorithm, which is a polynomial time algorithm, is proposed. For the second model, “nominal flow” is introduced which provides an efficient scheme for finding fuzzy flow. For the third model, we present an exact and some heuristic methods. Numerical examples are illustrated to demonstrate the efficiency of the proposed schemes. Finally, an application of this viewpoint in bus network planning problem is provided.     

Application of possibility theory to investment decisions

Carlson and Fuller (2001, Fuzzy Sets and Systems, 122, 315–326) introduced the concept of possibilistic mean, variance and covariance of fuzzy numbers. In this paper, we extend some of these results to a nonlinear type of fuzzy numbers called adaptive fuzzy numbers (see Bodjanova (2005, Information Science, 172, 73–89) for detail). We then discuss the application of these results to decision making problems in which the parameters may involve uncertainty and vagueness. As an application, we develop expression for fuzzy net present value (FNPV) of future cash flows involving adaptive fuzzy numbers by using their possibilistic moments. An illustrative numerical example is given to illustrate the results.     

Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower

Taipower, the official electricity authority of Taiwan, encounters several difficulties in planning annual coal purchase and allocation schedule, e.g., with multiple sources, multiple destinations, multiple coal types, different shipping vessels, and even in uncertain demand and supply. In this study, these concerns are formulated as a fuzzy bicriteria multi-index transportation problem. Furthermore, an effective and interactive algorithm is proposed which combines reducing index method and interactive fuzzy multi-objective linear programming technique to cope with a complicated problem which may be prevalent in other industries. Results obtained in this study clearly demonstrate that this model can not only satisfy more of the actual requirements of the integral system but also offer more information to the decision makers (DMs) for reference in favor of exalting decision making quality.     

Fuzzy programming and profit and cost allocation for a production and transportation problem

In this paper, we deal with a real problem on production and transportation in a housing material manufacturer, and consider a production and transportation planning under the assumption that the manufacturer makes multiple products at factories in multiple regions and the products are in demand in each of the regions. First, we formulate mixed zero–one programming problems such that the cost of production and transportation is minimized subject to capacities of factories and demands of regions. Second, to realize stable production and satisfactory supply of the products in fuzzy environments, fuzzy programming for the production and transportation problem is incorporated. Finally, under the optimal planning of production and transportation, we show a profit and cost allocation by applying a solution concept from game theory. Using actual data, we show usefulness of the fuzzy programming and a rational allocation scheme of the profit and cost.     

Fuzzy n-cell numbers and the differential of fuzzy n-cell number value mappings

In this paper, we give the definition of a special kind of n-dimension fuzzy numbers, fuzzy n-cell numbers, discuss their operations and representation theorems, define a complete metric on the fuzzy n-cell number space and prove that the metric is equivalent to the supremum metric derived by the Hausdorff metric between the level sets of the n-dimension fuzzy numbers, and obtain an embedding theorem of the fuzzy n-cell number space (isometrically embeds it into a concrete Banach space). We also consider the differential of the fuzzy mappings from an interval into the fuzzy n-cell number space by using the embedding theorem.     

智能制造环境下的备件生产与运输协同调度问题研究

智能制造和即时配送环境下的备件生产与运输协同调度问题是目前国内研究的一大热点,这是因为备件供应链响应速度已成为当前备件制造企业赢得客户的关键因素。为了提高客户满意度,尽可能缩短从客户下达定制化生产订单到订单配送完成的时间,本文建立了以所有客户总等待时间最短为目标的混合整数规划模型和集合覆盖模型,推导了最优解性质,并设计改进的分支定价算法求得最优解。通过将小规模算例结果与CPLEX进行对比,验证了模型和算法的有效性。多组算例测试结果表明,所提出的模型和算法可以有效提升智能制造环境下的备件供应链运作效率。     

循环取货模式下的多车场协同运输问题研究

分析循环取货模式和协同运输问题的关联性,提出了供需节点分离下的多车场一体化协同运输路线优化问题,考虑运输价值和运输成本,引入节点-弧流量的概念,通过比较流量大小确定节点集合,构建了问题的多供应点、多需求点运输模型.考虑取货的单向性和送货的闭合性,构造了求解模型的两阶段算法,运用动态规划的递推解法确定取货最优路线,然后基于余弦定理的几何法求解出发点和返回点不相同的送货路径优化问题,最后通过算例分析,说明了模型的合理性和算法的有效性.     

An active index algorithm for the nearest point problem in a polyhedral cone

We consider the problem of finding the nearest point in a polyhedral cone C={x∈R ⁿ :D x≤0} to a given point b∈R ⁿ , where D∈R ^m×n . This problem can be formulated as a convex quadratic programming problem with special structure. We study the structure of this problem and its relationship with the nearest point problem in a pos cone through the concept of polar cones. We then use this relationship to design an efficient algorithm for solving the problem, and carry out computational experiments to evaluate its effectiveness. Our computational results show that our proposed algorithm is more efficient than other existing algorithms for solving this problem.