A TRUST REGION ALGORITHM VIA BILEVEL LINEAR PROGRAMMING FOR SOLVING THE GENERAL MULTICOMMODITY MINIMAL COST FLOW PROBLEMS

This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programming and convex theory,the generalized directional derivative of the general multicommodity minimal cost flow problems is derived.The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.

Solving Load Flow Problems of Power System by Explicit Pseudo-Transient Continuation (E-ψtc) Method

This paper is a further study of two papers [1] and [2], which were related to Ill-Conditioned Load Flow Problems and were published by IEEE Trans. PAS. The authors of this paper have some different opinions, for example, the 11-bus system is not an ill-conditioned system. In addition, a new approach to solve Load Flow Problems, E-ψtc, is introduced. It is an explicit method;solving linear equations is not needed. It can handle very tough and very large systems. The advantage of this method has been fully proved by two examples. The authors give this new method a detailed description of how to use it to solve Load Flow Problems and successfully apply it to the 43-bus and the 11-bus systems. The authors also propose a strategy to test the reliability, and by solving gradient equations, this new method can answer if the solution exists or not.

A WEIGHTED PENALTY FINITE ELEMENT METHOD FOR THE ANALYSIS OF POWER-LAW FLUID FLOW PROBLEMS

In this paper, a new finite element method for the flow analysis of the viscous incompressible power-law fluid is proposed by the use of penalty-hybrid/mixed finite element formulation and by the introduction of an alternative perturbation, which is weighted by viscosity, of the continuity equation. A numerical example is presented to exhibit the efficiency of the method.

Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems

Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.

On solving multi-commodity flow problems： An experimental evaluation

Multi-commodity flow problems（MCFs） can be found in many areas, such as transportation, communication, and logistics. Therefore, such problems have been studied by a multitude of researchers, and a variety of methods have been proposed for solving it. However, most researchers only discuss the properties of different models and algorithms without taking into account the impacts of actual implementation. In fact, the true performance of a method may differ greatly across various implementations. In this paper, several popular optimization solvers for implementations of column generation and Lagrangian relaxation are discussed. In order to test scalability and optimality, three groups of networks with different structures are used as case studies. Results show that column generation outperforms Lagrangian relaxation in most instances, but the latter is better suited to networks with a large number of commodities.

Numerical Solution of 2-D Diffusion Problems Using Discrete Duality Finite Volume Method on General Boundary Conditions

In this paper, we present a discrete duality finite volume (DDFV) method for 2-D flow problems in nonhomogeneous anisotropic porous media under diverse boundary conditions. We use the discrete gradient defined in diamond cells to compute the fluxes. We focus on the case of Dirichlet, full Neumann and periodic boundary conditions. Taking into account the periodicity is the main new ingredient with respect to our recent works. We explain the procedures step by step, for numerical solutions. We develop a matlab code for algebraic equations. Numerical tests were provided to confirm our theoretical results.

An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers

An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.

Migrating Birds Optimization for Flow Shop Sequencing Problem

FSSP is a typical NP-Hard problem which is desired to be minimum makespan. This study consid- ers Migrating Birds Optimization (MBO) which is metaheuristic approach for the solution of Flow Shop Sequencing Problem (FSSP). As the basic MBO algorithm is designed for discrete problems. The performance of basic MBO algorithm is tested via some FSSP data sets exist in literature. Obtained results are compared with optimal results of related data sets.

THE CALCULATION OF EIGENVALUES FOR THE STATIONARY PERTURBATION OF COUETTE－POISEUILLE FLOW

The problem` considered is that of two-dimensional viscous flow in a straightchannel. The decay of a stationary perturbation from the Couette-poiseuille flow in the downstream is sought A differential eigenvahue equation resembling the orr-Sommerfeld equation is solved by using a spectral method and an imitial-vahue method(the compound matuix method )for values of the Reynolds number R between oo and 2000 The eigenvahues are presented for several of interesting cases with differentmeasures of mass flux ,These eigenvalues determine the rate of decay for the purturbation.

THE CALCULATION OF EIGENVALUES FOR THE STATIONARY PERTURBATION OF COUETTE－POlSEUILLEFLOW

The problem considered is that of two-dimensional viscous flow in a straightchannel.The decay of a stationary perturbation from the Couette=Poiseuille flow in the douwnstream is sought.A differential eigenvalue equation resembling the Orr-Sommerfeld equation is solved by using a spectral method and an initial-value method (the compound matrix method)for values of the Reynolds number R between O and 2000.The eigenvalues are presemed for several of interesting cases with differentmeasures of mass flux These eigenvalues derermine the rate of decay for the purturbation.

A LIMITING VISCOSITY APPROACH TO THE RIEMANN PROBLEM FOR TRANSONIC FLOW

In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-than-or-equal-to 0 and u- less-than-or-equal-to u+ by introducing 'artificial' viscosity terms and employing Helley's theorem. The setting under our consideration is a nonstrictly hyperbolic system. our analysis in this article is quite fundamental.

A TIME DOMAIN BOUNDARY ELEMENT METHOD FOR WATER-SOLID IMPACT ANALYSIS

A reciprocal theorem of dynamics for potential flow problems is first derived by means of the Laplace transform in which the compressibility of water is taken into account. Based on this theorem, the corresponding time-space boundary integral equation: is obtained. Then, a set of time domain boundary element equations with recurrence form is immediately formulated through discretization in both time and boundary. After having carried out the numerical calculation two solutions are found in which a rigid semicircular cylinder and a rigid wedge with infinite length suffer normal impact on the surface of a half-space fluid. The results show that the present method is more efficient than the previous ones.

Multi-Mode Resource Constrained Project Scheduling Models for Progress and Equal Time Interval Payments

This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.

PROBLEMS ON COMPUTING SHALLOW WATER CIRCULATION AND SIMULATING THE FLOW PAST ISLANDS IN NEARSHORE WATER

This paper continues discussing the problems of numerically solving the shallow water circulation on the basis of ref. 1, For the numerical method proposed in ref. 1, we applied a storage method with dense matrices, which abandoned usual bandwidth concept and attained the intention of saving interior storage, computing time and amount of preparing work before computing. The circulation considered the effect of small islands was successfully simulated by specially dealing with the bottom friction terms and the boundary conditions. In addition, we discussed the action of bottom friction on the dissipation of tidal energy and its effect on stability of period motion.

An Approach for Establishing a Common Grid Model for Flow-based Market Mechanism Simulations

The discussions on the development of an electricity market model for accommodating cross-border cooperation remains active in Europe.The main interest is the establishment of market couplings without curtailing the fair use of the scarce transmission capacity.However,it is difficult to gain mutual consensus on this subject because of the absence of convincing simulation results for the entire region.To achieve that,researchers need a common grid model(CGM)which is a simplified representation of the detailed transmission model which comprises aggregated buses and transmission lines.A CGM should sufficiently represent the inter-area power flow characteristics.Generally,it is difficult to establish a standard CGM that represents the actual transmission network with a suf-ficient degree of exactness because it requires knowledge on the details of the transmission network,which are undisclosed.This paper addresses the issue and reviews the existing approaches in transmission network approximation,and their shortcomings.Then,it proposes a new approach called the adaptive CGM approximation(ACA)for serving the purpose.The ACA is a datadriven approach,developed based on the direct current power flow theory.It is able to construct a CGM based on the published power flow data between the inter-connected market areas.This is done by solving the issue as a non-linear model fitting problem.The method is validated using three case studies.

Real-Time Hybrid Flow Shop Scheduling Approach in Smart Manufacturing Environment

Smart manufacturing in the“Industry 4.0”strategy promotes the deep integration of manufacturing and information technologies,which makes the manufacturing system a ubiquitous environment.However,the real-time scheduling of such a manufacturing system is a challenge faced by many decision makers.To deal with this challenge,this study focuses on the real-time hybrid flow shop scheduling problem(HFSP).First,the characteristic of the hybrid flow shop in a smart manufacturing environment is analyzed,and its scheduling problem is described.Second,a real-time scheduling approach for the HFSP is proposed.The core module is to employ gene expression programming to construct a new and efficient scheduling rule according to the real-time status in the hybrid flow shop.With the scheduling rule,the priorities of the waiting job are calculated,and the job with the highest priority will be scheduled at this decision time point.A group of experiments are performed to prove the performance of the proposed approach.The numerical experiments show that the real-time scheduling approach outperforms other single-scheduling rules and the back-propagation neural network method in optimizing most objectives for different size instances.Therefore,the contribution of this study is the proposal of a real-time scheduling approach,which is an effective approach for real-time hybrid flow shop scheduling in a smart manufacturing environment.

SOME INVERSE OPTIMIZATION PROBLEMS ON NETWORK

In this paper,the authors consider some inverse problems on network,such as the inverse transport problems with gains(IGTP) and the inverse linear fractional minimum cost flow problem(IFFP).Firstly,the authors give the mathematics model of(IGTP) and an efficient method of solving it under l_1 norm;Secondly,taking advantage of the optimality conditions,the authors consider the(IFFP) and give a simple method of solving it.Finally,an numerical example test is also developed.

Model and Algorithm of Transportation Problem on Network

Transportation problem on network needs to determine the freight quantity and the transportation route between supply point and demand point. Therefore, taken the uncertainty of freight supply and demand into account, a collaborative optimization model is formulated with transportation capacity constraint. In addition, a two-stage genetic algorithm （GA） is put forward. Herein, the first stage of this GA is adopted a priority-based encoding method for determining the supply and demand relationship between different points. Then supply and demand relationship which the supply and the demand are both greater than zero is a minimum cost flow （MCF） problem on network in the second stage. Aim at the purpose to solve MCF problem, a GA is employed. Moreover, this algorithm is suitable for balance and unbalance transportation on directed network or undirected network. At last, the model and algorithm are verified to be efficient by a numerical example.