The Quadratic Shortest Path Problem and its Genetic Algorithm

The quadratic shortest path (QSP) problem is to find a path from a node to another node in a given network such that the total cost includes two kinds of costs, say direct cost and interactive cost, is minimum. The direct cost is the cost associated with each arc and the interactive cost occurs when two arcs appear simultaneously in the shortest path. In this paper, the concept of the quadratic shortest path is initialized firstly. Then a spanning tree-based genetic algorithm is designed for solving the quadratic shortest path problem. Finally, a numerical example is given

Fuzzy Random Weighted Weber Problems in Facility Location

This article considers facility location in a Weber problem with weights including both uncertainty and vagueness. By representing its weights as fuzzy random variables, it can be extended to a fuzzy random weighted Weber problem, and then formulated as a fuzzy random programming problem. By introducing possibility and necessity measures and chance constraints, the extended problem is reformulated to new two types of Weber problems. Based upon characteristics of facility location, theorem for solving the reformulated problems are shown

Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables

This paper considers linear programming problems (LPPs) where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables). New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments

Application of Artificial Intelligence (AI) methods for designing and analysis of Reconfigurable Cellular Manufacturing System (RCMS)

This work focuses on the design and control of a novel hybrId manufacturing system: Reconfigurable Cellular Manufacturing System (RCMS) by using Artificial Intelligence (AI) approach. It is hybrid as it combines the advantages of Cellular Manufacturing System (CMS) and Reconfigurable Manufacturing System (RMS). In addition to inheriting desirable properties from CMS and RMS, RCMS provides additional benefits including flexibility and the ability to respond to changing products, product mix and market conditions during its useful life, avoiding premature obsolescence of the manufacturing system. The emphasis of this research is the formation of Reconfigurable Manufacturing Cell (RMC) which is the dynamic and logical clustering of some manufacturing resources, driven by specific customer orders, aiming at optimally fulfilling customers' orders along with other RMCs in the RCMS

A biologically inspired network design model

A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach

A biologically inspired network design model

A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach

Automated decision making and problem solving. Volume 2: Conference presentations

Related topics in artificial intelligence, operations research, and control theory are explored. Existing techniques are assessed and trends of development are determined