Using the Simplex Method for a Type of Allocation Problems

In this study we discuss the use of the simplex method to solve allocation problems whose flow matrices are doubly stochastic. Although these problems can be solved via a 0 - 1 integer programming method, H. W. Kuhn [1] suggested the use of linear programming in addition to the Hungarian method. Specifically, we use the existence theorem of the solution along with partially total unimodularity and nonnegativeness of the incidence matrix to prove that the simplex method facilitates solving these problems. We also provide insights as to how a partition including a particular unit may be obtained.

Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method

A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.

On the Quadratic Transportation Problem

We present a direct analytical algorithm for solving transportation problems with quadratic function cost coefficients. The algorithm uses the concept of absolute points developed by the authors in earlier works. The versatility of the proposed algorithm is evidenced by the fact that quadratic functions are often used as approximations for other functions, as in, for example, regression analysis. As compared with the earlier international methods for quadratic transportation problem (QTP) which are based on the Lagrangian relaxation approach, the proposed algorithm helps to understand the structure of the QTP better and can guide in managerial decisions. We present a numerical example to illustrate the application of the proposed method.

Operator Splitting Method for Coupled Problems:Transport and Maxwell Equations

In this article a new approach is considered for implementing operator splitting methods for transport problems, influenced by electric fields. Our motivation came to model PE-CVD (plasma-enhanced chemical vapor deposition) processes, means the flow of species to a gas-phase, which are influenced by an electric field. Such a field we can model by wave equations. The main contributions are to improve the standard discretization schemes of each part of the coupling equation. So we discuss an improvement with implicit Runge- Kutta methods instead of the Yee’s algorithm. Further we balance the solver method between the Maxwell and Transport equation.

Three-dimensional numerical manifold method for heat conduction problems with a simplex integral on the boundary

The three-dimensional numerical manifold method(3D-NMM),which is based on the derivation of Galerkin's variation,is a powerful calculation tool that uses two cover systems.The 3D-NMM can be used to handle continue-discontinue problems and extend to THM coupling.In this study,we extended the 3D-NMM to simulate both steady-state and transient heat conduction problems.The modelling was carried out using the raster methods(RSM).For the system equation,a variational method was employed to drive the discrete equations,and the crucial boundary conditions were solved using the penalty method.To solve the boundary integral problem,the face integral of scalar fields and two-dimensional simplex integration were used to accurately describe the integral on polygonal boundaries.Several numerical examples were used to verify the results of 3D steady-state and transient heat-conduction problems.The numerical results indicated that the 3D-NMM is effective for handling 3D both steadystate and transient heat conduction problems with high solution accuracy.

A Heuristic on Risk Management System in Goods Transportation Model Using Multi-Optimality by MODI Method

Transport risk management is one of the predominant issues to any industry for supplying their goods safely and in time to their beneficiaries. Damaging goods or delaying the shipping both make penalty to the company and also reduce the goodwill of the company. Every way of transportation routes has to be comfy which can make sure the supplies will attain without damaging goods and in time and additionally cost efficiently. In this paper, we find a few not unusual risks which might be concerned about all types of way of routes which include Highway, Waterway, Airway, Railway and so forth. Additionally, we proposed a technique to attain multiple optimal solutions by using Modified Distribution Method (MODI) of a transportation problem. Finally, we reduce the risks by minimizing the possible number of transportation routes using multi-optimality technique of the transportation problem.

Solution of the finite slab criticality problem using an alternative phase function with the second kind of Chebyshev polynomials

The critical size of a finite homogenous slab is investigated for one-speed neutrons using the alternative phase function(AG, Anli-Gungor) in place of the scattering function of the transport equation. First of all, the neutron angular flux expanded in terms of the Chebyshev polynomials of second kind(UN approximation) together with the AG phase function is applied to the transport equation to obtain a criticality condition for the system.Then, using various values of the scattering parameters, the numerical results for the critical half-thickness of the slab are calculated and they are tabulated in the tables together with the ones obtained from the conventional spherical harmonic(PN) method for comparison. They can be said to be in good accordance with each other.

ON ALTERNATIVE OPTIMAL SOLUTIONS TO QUASIMONOTONIC PROGRAMMING WITH LINEAR CONSTRAINTS

In this paper, the nonlinear programming problem with quasimonotonic （ both quasiconvex and quasiconcave ）objective function and linear constraints is considered. With the decomposition theorem of polyhedral sets, the structure of optimal solution set for the programming problem is depicted. Based on a simplified version of the convex simplex method, the uniqueness condition of optimal solution and the computational procedures to determine all optimal solutions are given, if the uniqueness condition is not satisfied. An illustrative example is also presented.

Multiple optimal solutions to a sort of nonlinear optimization problem

The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.

TRANSPORTATION NETWORKS:OLD AND NEW

This paper shows a number of Problems in pure and applied mathematicsthat are solved by constructing transportation networks.Moreover,it also shows thatall the solutions are characterized by forbidden configurations which are not minors.However,all the characterizations are much related to the graphic method which wasfound by Chinese for solving a kind of the transportation problem in the fifties.

New Approach to Solve Cubic Objective Function Programming Problem

In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also reported the algorithm of the usual simplex method. Application talks about how the developed algorithm can be used to unravel non-linear. The proposed technique, modification simplex technique, can be used with the constructed numerical examples an illustrative numerical problems are given to demonstrate the algorithms.

Location Evaluation of Childcare Facilities Focusing on Transportation in Japanese Urban Areas

In recent Japan, as there has been an increase of dual-income households and the demand for childcare facilities has especially increased especially in urban areas, childcare facilities and workers are lacking and it leads to the serious issue of children on waiting lists. Based on the background mentioned above, using statistical method, geographical information system (GIS) and public open data, scenario analysis to select transportation, the present study aimed to propose a method to quantitatively evaluate the current location of childcare facilities in Japanese urban areas. In the present study, the model of the p-median problem used to obtain the optimal location of facilities was modified, and a method to evaluate the current situation concerning the shortage or overage of childcare facilities by district was proposed. As evaluations are conducted using quantitative data such as the specialization coefficient of person trip for transportation and the distance between childcare facilities and districts, the evaluation results are also quantitative, making it an effective indicator for evaluating the locations of childcare facilities. Additionally, the specialization coefficient of person trip for transportation and the distance between childcare facilities and districts were calculated based on public open data. Therefore, the evaluation method in the present study has a high temporal reproducibility as well as spatial reproducibility.

稳态及瞬态中子输运模型的JFNK求解方法研究

三维全堆芯pin-by-pin中子输运模型的高效加速方法是核反应堆高精度计算的重点和难点。本文有效融合课题组开发的并行多维离散纵坐标(S_(N))中子输运程序comeSn和Jacobian-Free Newton Krylov(JFNK)通用求解框架comeJFNK的高效并行特性、鲁棒性和强收敛性,开发了一套三维稳态及瞬态中子输运模型的JFNK并行求解程序comeSn_JFNK。为了提高计算效率,选择中子标通量密度(而非中子角通量密度)作为JFNK全局求解变量,并利用基于空间区域并行的KBA输运扫描方法和物理预处理方法,分别构建了稳态及瞬态模型的JFNK统一残差计算模型。计算结果表明,comeSn_JFNK相比于comeSn,计算效率具有显著优势,对于三维pin-by-pin稳态KAIST-3A算例,加速比为10倍以上;对于栅元均匀化的二维七群瞬态C5G7-TD2系列基准算例,加速比约为30倍。

面向资源约束的电动公交车充电调度策略

为减少公交运营成本、合理制定插入式充电模式下公交总站的电动公交车充电调度方案,本文基于帝国竞争算法提出了一种面向资源约束的公交车充电调度策略(RCO-CSS)。基于电动公交车运营的时空特点和充放电特性,应用多技能资源约束多项目调度问题(MSRC-MPSP)运筹规划思想对电动公交车充电问题进行抽象建模,以车队规模与充电桩数量为主要资源参数,以最小化充电成本和日均设备购置成本为目标,构建资源约束充电调度模型,进而设计一种二阶段演化帝国竞争算法(TSE-ICA)对模型进行求解,输出最佳的充电调度方案及匹配的行车运营计划。采用4个分别包含5、10、20和36条线路的公交运行实例对RCO-CSS进行了性能评估与有效性验证。在实例探讨中,首先运用Taguich法对资源参数进行了敏感性分析,发现资源越宽裕,模型输出的日充电费用越小,但车辆与充放电设备平摊至每日的购置成本越大;其次,将TSE-ICA与其他4种先进的元启发式算法进行实验数值对比,验证了所提算法的寻优性能;最后,通过与无序充电调度策略和常规有序充电调度策略进行比较,证明了RCO-CSS能够更好地降低用电成本、设备购置成本和电池充放电次数。基于MSRC-MPSP和TSE-ICA的RCO-CSS为公交运营商制定充电调度方案和行车运营计划提供了一种可行且敏捷高效的新思路。

粒子群自进化算法求解物流装箱问题

为了解决当今物流行业中装载货物类型为强异构的情况,提高装载填充率和效率,提出了一种求解三维装箱问题的元启发式算法——粒子群自进化算法。算法包含两部分:极限点构造启发式算法和粒子群自进化规则。极限点构造启发式算法引入了极限点的概念,利用新的极值点思想推导出了三维装箱问题的启发式算法。粒子群自进化规则提出了在货物装载序列中表示粒子的方法,推导了粒子间交叉、变异算子,在极限点构造启发式算法的基础上不断迭代进化完成货物的装载。通过不同结果的比对,证明该算法显著提高了物流装载的空间利用率,强异构货物的平均装载率达到了85%,验证了算法在强异构货物下的有效性与优越性,并给出了货物装载的三维模型。由于实际测试集的缺少,分别为机腹仓装载类和集装板类模型提出了实例生成器,通过生成器的测试集验证了算法在实际应用中的紧凑性、实用性和快捷性。

施工场地平整成本降低方法研究

为科学制定土方调配方案,降低工程成本和造价,首先通过方格网法计算土方工程量,然后运用运筹学中的运输问题建立模型,再运用表上作业法进行土方调配方案的优化,从而明确挖方与填方区的土方调配方向和数量,最终达到满足设计标高的同时成本最低。最后在充分考虑调配方案目标的基础上,提出相应的目标规划模型。

基于两阶段法的地铁货物运输中转点选址研究

利用地铁剩余运能承担货物运输,可在一定程度上减轻道路交通压力。文中建立基于两阶段法的城市地铁货物运输中转站选址模型;通过改进的层次分析法和并行突变免疫算法,求解出地铁货物运输中转站的最优位置。通过算例分析得到:当地铁货物运输中转站的选址数量设为4个时,有5个方案可以选择;当地铁货物运输中转站的选址数量设为5个时,仅有1个方案可以选择。研究结果表明:两阶段法可以定性定量地研究地铁货物运输中转站选址问题,有利于最优方案的选择。

单纯形模拟退火算法反演地下水污染源强度

基于单纯形模拟退火混合算法(SMSA混合算法),结合污染物迁移问题的解析解反演地下水污染源的强度变化历时曲线.SMSA混合算法结合了单纯形法的确定性搜索和模拟退火算法的全局概率搜索机制,是一种高效的混合优化算法;同时采用Yeh提出的解析解,它具有可靠性强、易于编程实现和扩展性强的特点.计算结果显示,1维、2维、3维情形下点污染源的反演浓度均较好地再现了真实的污染物释放过程,这表明基于SMSA混合算法和Yeh解析解的反演方法是一种有效的地下水污染源重建方法.

带时间约束的运输问题简便解法

带时间约束的运输问题的传统解法通常是用多目标规划法。多目标规划法虽可解运输问题,但比较繁琐,不便于掌握和实际应用与推广。为了克服这一缺欠,提出新的解法。简便解法利用简单的数学方法把多目标规划法简化为单一目标,简化为传统运输问题模型。此外在此基础上还给出快捷法求解运输问题,使得带时间约束的运输问题的求解更加简捷、更加便于掌握和实际应用与推广。

单纯形—模拟退火混合算法反求水文地质参数及其并行求解

本文利用单纯形法局部搜索速度快和模拟退火算法全局寻优的特点,同时为了克服各自算法的弊病,提出采用单纯形—模拟退火混合算法(SMSA)进行水文地质逆问题的求解。论文详细描述了SMSA算法的具体操作算子的实现,并将该算法应用于一个大型水源地的地下水模拟反演。计算结果表明,SMSA算法在水文地质参数反演计算具有求解速度快,精度高的特点,而且易于实现并行运算。