Optimal way of selecting cities and conveyances for supplying coal in uncertain environment

In this paper, the limitations and shortcomings of the existing methods for solving fuzzy solid transportation problem are pointed out and to overcome these shortcomings, a new method is proposed for solving fuzzy solid transportation problem. The advantages of the proposed method over the existing methods are discussed. To illustrate the proposed method, an existing fuzzy solid transportation problem is solved. Also, to show the application of the proposed method in real life problems an existing real life fuzzy solid transportation problem is solved by the proposed method.     

Lexicographic fuzzy multi-objective model for minimisation of exceptional and void elements in manufacturing cell formation

This research proposes a lexicographic fuzzy multi-objective model based on perfect grouping for concurrent solving the part-family and machine-cell formation problems in a cellular manufacturing system. New simplified mathematical expressions of exceptional and void elements are proposed, opposing conventional quadratic and absolute functions. The main objectives of the proposed solution model, that is, the minimisation of both the number of exceptional elements and the number of void elements is defined by fuzzy goals as pre-emptive ordering. A lexicographic fuzzy goal model is developed to enhance cell performance and machine utilisation simultaneously. A satisfactory efficient solution can easily be obtained, and alternative solutions can also be generated by capturing flexibility of the proposed fuzzy multi-objective programming model. The formulated model can be solved by existing integer programming solvers. Finally, the evaluation of cell formation problems is briefly discussed to show the performance of the proposed model.     

A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem

In this article a line search algorithm is proposed for solving constrained multi-objective optimization problems. At every iteration of the proposed method, a subproblem is formulated using quadratic approximation of all functions. A feasible descent direction is obtained as a solution of this subproblem. This scheme takes care some ideas of the sequential quadratically constrained quadratic programming technique for single objective optimization problems. A non-differentiable penalty function is used to restrict constraint violations at every iterating point. Convergence of the scheme is justified under the Slater constraint qualification along with some reasonable assumptions. The proposed algorithm is verified and compared with existing methods with a set of test problems. It is observed that this algorithm provides better results in most of the test problems.     

Multi-objective mixed integer programming and an application in a pharmaceutical supply chain

Multi-objective integer linear and/or mixed integer linear programming (MOILP/MOMILP) are very useful for many areas of application as any model that incorporates discrete phenomena requires the consideration of integer variables. However, the research on the methods for the general multi-objective integer/mixed integer model has been scant when compared to multi-objective linear programming with continuous variables. In this paper, an MOMILP is proposed, which integrates various conflicting objectives. We give importance to the imprecise nature of some of the critical factors used in the modelling that can influence the effectiveness of the model. The uncertainty and the hesitation arising from estimating such imprecise parameters are represented by intuitionistic fuzzy numbers. The MOMILP model with intuitionistic fuzzy parameters is first converted into a crisp MOMILP model, using appropriate defuzzification strategies. Thereafter, the MOMILP is transformed into a single objective problem to yield a compromise solution with an acceptable degree of satisfaction, using suitable scalarisation techniques such as the gamma-connective technique and the minimum bounded sum operator technique. The proposed solution method is applied to several test problems and a multi-objective pharmaceutical supply chain management model with self generated random data.     

氯碱工业盐泥综合利用的模糊优化模型及应用

在氯碱工业生产过程中,处理副产品盐泥的最理想办法是将盐泥综合利用,生产盐泥的下游产品。应用模糊理论,建立了盐泥下游产品选择的基于可信性测度的模糊机会约束目标规划模型,并采用两种方法对模型进行求解。当模糊变量是三角模糊数时,将模糊模型转化为确定意义下的清晰等价模型进行求解;在模型推导的过程中,提出了一个引理和一个定理,并给出了其详细的证明过程。对于那些无法转化为清晰等价形式的复杂情况,设计了一种基于模糊模拟的遗传算法,并给出了详细的模糊模拟和遗传算法的步骤。最后通过实例分析证明该建模思想和算法的可行性和有效性。     

Modified Differential Evolution Algorithm for Solving Dynamic Optimization with Existence of Infeasible Environments

Dynamic constrained optimization is a challenging research topic in which the objective function and/or constraints change over time. In such problems, it is commonly assumed that all problem instances are feasible. In reality some instances can be infeasible due to various practical issues, such as a sudden change in resource requirements or a big change in the availability of resources. Decision-makers have to determine whether a particular instance is feasible or not, as infeasible instances cannot be solved as there are no solutions to implement. In this case, locating the nearest feasible solution would be valuable information for the decision-makers. In this paper, a differential evolution algorithm is proposed for solving dynamic constrained problems that learns from past environments and transfers important knowledge from them to use in solving the current instance and includes a mechanism for suggesting a good feasible solution when an instance is infeasible. To judge the performance of the proposed algorithm, 13 well-known dynamic test problems were solved. The results indicate that the proposed algorithm outperforms existing recent algorithms with a margin of 79.40% over all the environments and it can also find a good, but infeasible solution, when an instance is infeasible.     

Fuzzy bi-objective formulation for a parallel machine scheduling problem with machine eligibility restrictions and sequence-dependent setup times

In this paper, a fuzzy bi-objective mixed-integer linear programming (FBOMILP) model is presented. FBOMILP encompasses the minimisation workload imbalance and total tardiness simultaneously as a bi-objective formulation for an unrelated parallel machine scheduling problem. To make the proposed model more practical, sequence-dependent setup times, machine eligibility restrictions and release dates are also considered. Moreover, the inherent uncertainty of processing times, release dates, setup times and due dates are taken into account and modelled by fuzzy numbers. In order to solve the model for small-scale problems, a two-stage fuzzy approach is proposed. Nevertheless, since the problem belongs to the class of NP-hard problems, the proposed model is solved by two meta-heuristic algorithms, namely fuzzy multi-objective particle swarm optimisation (FMOPSO) and fuzzy non-dominated sorting genetic algorithm (FNSGA-II) for solving large-scale instances. Subsequently, through setting up various numerical examples, the performances of the two mentioned algorithms are compared. When α?=?0.5 (α is a level of risk-taking and when it increases the decision-maker’s risk-taking decreases), FNSGA-II is fairly more effective than FMOPSO and has better performance especially in solving large-sized problems. However, when α rises, it can be stated that FMOPSO moderately becomes more appropriate. Finally, directions for future studies are suggested and conclusion remarks are drawn.     

Multi-objective scheduling problems: Determination of pruned Pareto sets

There are often multiple competing objectives for industrial scheduling and production planning problems. Two practical methods are presented to efficiently identify promising solutions from among a Pareto optimal set for multi-objective scheduling problems. Generally, multi-objective optimization problems can be solved by combining the objectives into a single objective using equivalent cost conversions, utility theory, etc., or by determination of a Pareto optimal set. Pareto optimal sets or representative subsets can be found by using a multi-objective genetic algorithm or by other means. Then, in practice, the decision maker ultimately has to select one solution from this set for system implementation. However, the Pareto optimal set is often large and cumbersome, making the post-Pareto analysis phase potentially difficult, especially as the number of objectives increase. Our research involves the post Pareto analysis phase, and two methods are presented to filter the Pareto optimal set to determine a subset of promising or desirable solutions. The first method is pruning using non-numerical objective function ranking preferences. The second approach involves pruning by using data clustering. The k-means algorithm is used to find clusters of similar solutions in the Pareto optimal set. The clustered data allows the decision maker to have just k general solutions from which to choose. These methods are general, and they are demonstrated using two multi-objective problems involving the scheduling of the bottleneck operation of a printed wiring board manufacturing line and a more general scheduling problem.     

A two-phase computational scheme for solving bang-bang control problems

This paper focuses on numerical methods for solving time-optimal control problems using discrete-valued controls. A numerical Two-Phase Scheme, which combines admissible optimal control problem formulation with enhanced branch-and-bound algorithms, is introduced to efficiently solve bang-bang control problems in the field of engineering. In Phase I, the discrete restrictions are relaxed, and the resulting continuous problem is solved by an existing optimal control solver. The information on switching times obtained in Phase I is then used in Phase II wherein the discrete-valued control problem is solved using the proposed algorithm. Two numerical examples, including a third-order system and the F-8 fighter aircraft control problem, are presented to demonstrate the use of this proposed scheme. Comparing to STC and CPET methods proposed in the literature, the proposed scheme provides a novel method to find a different switching structure with a better minimum time for the F-8 fighter jet control problem.     

遗传算法在单层球壳质量、刚度模糊优化中的应用

在单层球壳的优化设计过程中,必然会遇到大量的不确定性信息和因素,对这些不确定性因素应该使用模糊理论加以分析和处理。同时往往要考虑多个目标如质量最小和整体刚度最大等,而各个目标之间存在矛盾,要使各个目标都达到最优很困难。采用模糊数学的原理建立单层球壳多目标模糊优化模型,通过模糊判决法,将多目标的模糊优化问题转化为单目标的非模糊优化问题,最后利用小生境遗传算法(ANGA算法)对非模糊化的优化模型进行求解。对70 m跨单层球壳进行质量、刚度模糊优化,结果令人满意,验证了该方法的合理性和可行性,说明基于ANGA算法的模糊优化方法可以有效解决优化变量繁多的大中型网格结构多目标模糊优化问题。     

Uncertain multi-objective multi-product solid transportation problems

The solid transportation problem is an important generalization of the classical transportation problem as it also considers the conveyance constraints along with the source and destination constraints. The problem can be made more effective by incorporating some other factors, which make it useful in real life situations. In this paper, we consider a fully fuzzy multi-objective multi-item solid transportation problem and present a method to find its fuzzy optimal-compromise solution using the fuzzy programming technique. To take into account the imprecision in finding the exact values of parameters, all the parameters are taken as trapezoidal fuzzy numbers. A numerical example is solved to illustrate the methodology.     

Multi-objective optimization of fuzzy structural systems

It is recognized that there exists a vast amount of fuzzy information in both the objective and constraint functions of the optimum design of structures. Since most practical structural design problems involve several, often conflicting, objectives to be considered, a multi-objective fuzzy programming method is outlined in this work. The fuzzy constraints define a fuzzy feasible domain in the design space and each of the fuzzy objective functions defines the optimum solution by a fuzzy set of points. A method of solving a fuzzy multi-objective structural optimization problem using ordinary single-objective programming techniques is presented. The computational approach is illustrated with two numerical examples.     

Constrained multi-objective optimization using constrained non-dominated sorting combined with an improved hybrid multi-objective evolutionary algorithm

Constrained multi-objective optimization problems (cMOPs) are complex because the optimizer should balance not only between exploration and exploitation, but also between feasibility and optimality. This article suggests a parameter-free constraint handling approach called constrained non-dominated sorting (CNS). In CNS, each solution in a population is assigned a constrained non-dominated rank based on its constraint violation degree and Pareto rank. An improved hybrid multi-objective optimization algorithm called cMOEA/H for solving cMOPs is proposed. Additionally, a dynamic resource allocation mechanism is adopted by cMOEA/H to spare more computational efforts for those relatively hard sub-problems. cMOEA/H is first compared with the baseline algorithm using an existing constraint handling mechanism, verifying the advantages of the proposed constraint handling mechanism. Then cMOEA/H is compared with some classic constrained multi-objective optimizers, experimental results indicating that cMOEA/H could be a competitive alternative for solving cMOPs. Finally, the characteristics of cMOEA/H are studied.     

Multi-objective hierarchical genetic algorithms for multilevel redundancy allocation optimization

Multilevel redundancy allocation optimization problems (MRAOPs) occur frequently when attempting to maximize the system reliability of a hierarchical system, and almost all complex engineering systems are hierarchical. Despite their practical significance, limited research has been done concerning the solving of simple MRAOPs. These problems are not only NP hard but also involve hierarchical design variables. Genetic algorithms (GAs) have been applied in solving MRAOPs, since they are computationally efficient in solving such problems, unlike exact methods, but their applications has been confined to single-objective formulation of MRAOPs. This paper proposes a multi-objective formulation of MRAOPs and a methodology for solving such problems. In this methodology, a hierarchical GA framework for multi-objective optimization is proposed by introducing hierarchical genotype encoding for design variables. In addition, we implement the proposed approach by integrating the hierarchical genotype encoding scheme with two popular multi-objective genetic algorithms (MOGAs)—the strength Pareto evolutionary genetic algorithm (SPEA2) and the non-dominated sorting genetic algorithm (NSGA-II). In the provided numerical examples, the proposed multi-objective hierarchical approach is applied to solve two hierarchical MRAOPs, a 4- and a 3-level problems. The proposed method is compared with a single-objective optimization method that uses a hierarchical genetic algorithm (HGA), also applied to solve the 3- and 4-level problems. The results show that a multi-objective hierarchical GA (MOHGA) that includes elitism and mechanism for diversity preserving performed better than a single-objective GA that only uses elitism, when solving large-scale MRAOPs. Additionally, the experimental results show that the proposed method with NSGA-II outperformed the proposed method with SPEA2 in finding useful Pareto optimal solution sets.     

A method for unbalanced transportation problems in fuzzy environment

In this paper, we consider the fully fuzzy unbalanced transportation problem in which the total availability/production is more than the total demand and propose a method to solve it. Such problems are usually solved by adding a dummy destination. Since the dummy destination has no existence in reality, the excess availability is not transported at all and is held back at one or more origins. The method proposed in this paper gives the additional information that to which of the destination(s) the excess availability be transported for future demand at minimum cost. The advantage of the proposed method over the existing method is that the fuzzy optimal solution obtained does not involve the dummy destination. The method has been illustrated with the help of an example.     

A heuristic approach on the facility layout problem based on game theory

Facility layout problems are related to the location of all facilities in a plant. Numerous research works related to facility layout have been published. The applicability of these various existing models may be limited by the fact that they all ignore competitive reactions to one's actions. In addition to external competitors, some internal problems of system such as material handling system design affect layout designs. For considering these effects, some researchers have investigated multi-objective approaches that in most cases lead to the optimisation of a weighted sum of score functions. The poor practicability of such an approach is due to the difficulty of normalising these functions and quantifying the weights. To the extent that competitors do react to a firm's actions and also the facility layout problem considers several conflicting objectives by distinct decision makers in the firm, the existing models may be oversimplifications of reality. In this paper, we modelled such a facility layout problem with conflicting objectives under a duopoly Bertrand competition as a game and solved it with a proposed simulated annealing meta-heuristic. Results obtained from solving some numerical examples confirm the effectiveness of the proposed model for the layout design.     

U-OPT: An analysis of exact U-shaped line balancing procedures

The U-shaped assembly line-balancing problem can be solved using optimization procedures or algorithms, including branch-and-bound procedures. This paper considers design elements that should be included in these solution methods for solving the U-shaped assembly line-balancing problem. New solution procedures are proposed and compared experimentally with several existing procedures using a variety of problem sets from the literature. The results show that the substantial improvement in the efficacy of the new solution procedures over existing methods is due primarily to the newly developed 'Paired Tasks' lower bound. Results also show the relative importance of various design elements comprising a branch-and-bound procedure.     

A method for solving partial differential equations via radial basis functions: Application to the heat equation

In this work a technique is proposed for solving partial differential equations using radial basis functions. The approach is different from the traditional schemes. The radial basis functions are very suitable instruments for solving partial differential equations of various types. However, the matrices which result from the discretization of the equations are usually ill-conditioned especially in higher-dimensional problems. In the current paper, a stable method will be proposed for solving the partial differential equations and will be generalized to solve higher-dimensional problems. To the contrast of most existing methods, the new technique provides a closed form approximation for the solution. Another advantage of the developed method is that it can be applied to problems with nonregular geometrical domains.     

Confidence structural robust optimization by non‐linear semidefinite programming‐based single‐level formulation

Structural robust optimization problems are often solved via the so‐called Bi‐level approach. This solution procedure often involves large computational efforts and sometimes its convergence properties are not so good because of the non‐smooth nature of the Bi‐level formulation. Another problem associated with the traditional Bi‐level approach is that the confidence of the robustness of the obtained solutions cannot be fully assured at least theoretically. In the present paper, confidence single‐level non‐linear semidefinite programming (NLSDP) formulations for structural robust optimization problems under stiffness uncertainties are proposed. This is achieved by using some tools such as S‐procedure and quadratic embedding for convex analysis. The resulted NLSDP problems are solved using the modified augmented Lagrange multiplier method which has sound mathematical properties. Numerical examples show that confidence robust optimal solutions can be obtained with the proposed approach effectively. Copyright © 2010 John Wiley & Sons, Ltd.     

Optimizing the multiple constrained resources product mix problem using genetic algorithms

The theory of constraints (TOC) is s a management philosophy for maximizing throughput. Since its introduction, many have criticized it as being inefficient when multiple constrained resources exist. The application of the five steps contained in TOC have been criticized by some researchers on the grounds that the application of five steps of TOC to the product mix decision leads to implicit or unrealizable solutions when multiple resource constraints in a plant exist. This paper views TOC as a management philosophy and a genetic algorithm-based TOC procedure is presented for solving combinatorial problems encountered in practice which cannot be solved using linear-integer programming or similar techniques. For smaller size problems, the results of the proposed procedure are compared with results of optimal methods published in the literature. The results are encouraging and therefore support the use of the proposed approach in an industrial setting.