雨污处理方案的数学模型

定量分析了雨污分流与混流收集机制对污水处理效果的影响。从污水排放量、费用等角度,对实施清源建设、截排建设或2种措施同时进行的相关效用进行比较,给出了选择不同雨污处理方案的判定条件。最后进行了数值模拟,给出了目标区域的雨污处理方案。     

解偏微分方程的多步-小波-Galerkin方法

推广Lax-Wendroff多步方法,建立一类新的显式和隐式相结合的多步格式,并以此为基础提出了一类显隐多步-小波-Galerkin方法,可以用来求解依赖时间的偏微分方程.不同于Taylor-Galerkin方法,文中的方案在提高时间离散精度时不包含任何新的高阶导数.由于引入了隐式部分,与传统的多步方法相比该方案有更好的稳定性,适合于求解非线性偏微分方程,理论分析和数值例子都说明了方法的有效性.     

基于可变航速的支线集装箱船舶调度优化模型与算法

随着航运市场的竞争不断加剧和集装箱船舶大型化的发展,越来越多的航运企业选择轴-辐式航运网络模式。支线船舶调度问题作为轴-辐式航运网络的重要组成部分受到研究者的高度关注。本文研究了可变航速和经济航速两种情境下的支线船舶调度问题,同时考虑枢纽港和喂给港的取送箱时间窗限制,以航运企业运营成本最小化为目标函数建立非线性混合整数规划模型。首先使用专业的规划求解器进行小规模算例的求解,验证了模型的准确性。同时运用改进的遗传算法对大规模支线船舶优化调度模型进行求解。为了提高求解效果,进一步设计了多智能体进化算法进行求解。数值结果表明,可变航速的运营成本低于经济航速的运营成本;在算法效率方面,改进遗传算法收敛速度较快,多智能体进化算法则可以提高求解精度。     

具有外部扰动的空间刚性机械臂姿态与末端爪手协调运动的Terminal滑模控制算法设计

讨论了载体位置无控、姿态受控情况下,具有外部扰动的漂浮基空间刚性机械臂,载体姿态与末端爪手协调运动的控制算法设计问题．结合系统动量守恒关系及Lagrange方法,建立了漂浮基空间刚性机械臂完全能控形式的系统动力学方程及运动Jacobi关系,并将其转化为状态空间形式的系统控制方程．以此为基础,根据Terminal滑模控制技术,给出了系统相关Terminal滑模面的数学表达式,在此基础上提出了具有外部扰动情况下漂浮基空间刚性机械臂载体姿态与末端爪手协调运动的Terminal滑模控制方案．提出的控制方案不但确保了闭环系统滑模阶段的存在性,同时通过Terminal滑模函数的适当选取,还保证了输出误差在有限时间内的收敛性．此外,由于确保了无论何种情况下系统初始状态均在Terminal滑模面上,从而消除了其它滑模控制方法常有的到达阶段,使得闭环系统具有全局鲁棒性和稳定性．平面两杆空间刚性机械臂的系统数值仿真,证实了方法的有效性．     

多体系统动力学微分-代数方程L-稳定方法

针对多体系统动力学微分-代数方程形式，在时间区间上构造L-稳定方法，分别基于等距节点、Chebyshev节点和Legendre节点等非等距节点建立求解格式，依据Ehle定理及猜想，与Padé逼近式对比得到待定矩阵和向量，从而获得L-稳定求解公式，循环求解过程采用Newton迭代法计算.以平面双连杆机械臂系统为例，使用L-稳定方法进行数值仿真，通过改变时间区间节点数和步长对各个指标结果进行比较，并与经典Runge-Kutta法对比.结果表明，该方法具有稳定性好、精度高等优点，适用于长时间情况下的多体系统动力学仿真.     

一类求解分片延迟微分方程的线性多步法的散逸性

本文研究分片延迟微分方程本身及数值方法的散逸性问题．给出了一个关于此类问题本身散逸性的充分条件,同时得到了一类求解此类问题的线性多步法的数值散逸性结果,此结果表明所考虑的数值方法继承了方程本身的散逸性．数值试验进一步验证了理论结果的正确性．     

求解非线性刚性初值问题的隐显线性多步方法的误差分析

隐显线性多步方法由隐式线性多步方法和显式线性多步法组合而成.本文主要讨论求解满足单边Lipschitz条件的非线性刚性初值问题和一类奇异摄动初值问题的隐显线性多步方法的误差分析.最后,由数值例子验证了所获的理论结果的正确性及方法处理这两类问题的有效性.     

非线性动力系统的自适应显式Magnus数值方法

基于最近发展的矩阵李群上非线性微分方程的显式Magnus展式,给出了非线性动力系统的有效的数值算法,并且在数值求解过程中具有自适应的步长控制特点,可以显著地提高计算效率．最后,通过非线性动力系统典型问题Duffing方程和强刚性的Van derPol方程以及非线性振子的Hamilton方程的数值实验来说明方法的有效性．     

流体饱和多孔隙介质波动方程小波有限差分法

研究流体饱和多孔隙介质中波动方程的数值模拟．针对求解二维弹性波方程问题,提出小波有限差分法．该方法综合了小波多分辨分析计算灵活、计算效率高特性和有限差分易于实现的优点．数值模拟的结果显示,此方法对于求解流体饱和多孔隙介质方程的数值模拟是有效稳定的．     

广义非线性Sine-Gordon方程的两个隐式差分格式

本文对一类非线性Sine-Gordon方程的初边值问题提出了两个隐式差分格式．两个隐式差分格式的精度均为O(τ~2 h~2)．我们用离散泛函分析的方法证明了格式的收敛性和稳定性,并证明了求解格式的追赶迭代法的收敛性,最后给出了数值结果．结果表明本文的格式是有效的和可靠的．     

Dynamics modeling and experiments of wave driven robot

Wave driven robots (WDRs) take ocean energies as the power sources and are often used for long-term monitoring of the marine environment. The unique multi-body joint structure and special operation mechanism of a WDR make the dynamics modeling problem unusual. The dynamic model of a WDR was put forward by taking the interconnection of forces and motions between the float body (float) and the submerged glider (glider) into account. Numerical simulation of longitudinal motion and the comparison between simulation and tank test of reciprocating steering motion of the "Ocean Rambler" WDR were carried out. The dynamic model proposed in this paper was consistent with the motion characteristics of "Ocean Rambler" WDR. Simulations of PID heading control demonstrated the unique control characteristics of the WDR, which proved the significance of the established dynamic model of the WDR in control algorithm design.     

The G4-Heuristic for the Pallet Loading Problem

A new heuristic for the well-known (two-dimensional orthogonal) pallet loading problem (PLP) is proposed in this paper. This heuristic, referred to as G4-heuristic, is based on the definition of the so-called G4-structure of packing patterns. The G4-structure is a generalization of the common used block structure of packing patterns which requires the same orientation of packed boxes within each block. The G4-heuristic yields in approximately 99% of the test instances an optimal solution and solves all instances exactly where at most 50 boxes are contained in an optimal packing. Although the algorithm is pseudo-polynomial the computational experiments reported show that also instances with more than 200 packed boxes in an optimal solution can be handled with a small amount of computational time. Moreover, so far there is not known any instance where the gap between optimal value and the value obtained by the G4-heuristic is larger than one box.     

Heuristics with a new block strategy for the single and multiple containers loading problems

A heuristic algorithm using new block strategy for the heterogeneous single and multiple containers loading problem (CLP) is proposed in this paper. In order to solve the single CLP, this algorithm fills unused spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three child-spaces starting with an empty container. An initial container pattern is first built applying this approach recursively until all boxes are stowed or no unused spaces are left. And then, alternative container patterns are generated after replacing the load-blocks of the pattern-determining spaces in the initial container pattern with the alternative-blocks previously stored. Finally, an improvement procedure compares these alternatives with the initial container pattern to identify an improved container pattern. An algorithm for the multiple CLP uses the single CLP algorithm to generate an initial solution and uses improvement procedures to improve the initial solution. Numerical experiments with 715 test cases for the single CLP and 47 test cases for the multiple the CLP revealed the excellent performance of this algorithm.     

A global optimization approach for solving three-dimensional open dimension rectangular packing problems

The three-dimensional open dimension rectangular packing problem (3D-ODRPP) aims to pack a set of given rectangular boxes into a large rectangular container of minimal volume. This problem is an important issue in the shipping and moving industries. All the boxes can be any rectangular stackable objects with different sizes and may be freely rotated. The 3D-ODRPP is usually formulated as a mixed-integer non-linear programming problem. Most existing packing optimization methods cannot guarantee to find a globally optimal solution or are computationally inefficient. Therefore, this paper proposes an efficient global optimization method that transforms a 3D-ODRPP as a mixed-integer linear program using fewer extra 0–1 variables and constraints compared to existing deterministic approaches. The reformulated model can be solved to obtain a global optimum. Experimental results demonstrate the computational efficiency of the proposed approach in globally solving 3D-ODRPPs drawn from the literature and the practical applications.     

A hybrid placement strategy for the three-dimensional strip packing problem

This paper presents a hybrid placement strategy for the three-dimensional strip packing problem which involves packing a set of cuboids (‘boxes’) into a three-dimensional bin (parallelepiped) of fixed width and height but unconstrained length (the ‘container’). The goal is to pack all of the boxes into the container, minimising its resulting length. This problem has potential industry application in stock cutting (wood, polystyrene, etc. – minimising wastage) and also cargo loading, as well as other applications in areas such as multi-dimensional resource scheduling. In addition to the proposed strategy a number of test results on available literature benchmark problems are presented and analysed. The results of empirical testing of the algorithm show that it out-performs other methods from the literature, consistently in terms of speed and solution quality-producing 28 best known results from 35 test cases.     

LP narrowing: A new strategy for finding all solutions of nonlinear equations

An efficient algorithm is proposed for finding all solutions of systems of n nonlinear equations. This algorithm is based on interval analysis and a new strategy called LP narrowing. In the LP narrowing strategy, boxes (n-dimensional rectangles in the solution domain) containing no solution are excluded, and boxes containing solutions are narrowed so that no solution is lost by using linear programming techniques. Since the LP narrowing is very powerful, all solutions can be found very efficiently. By numerical examples, it is shown that the proposed algorithm could find all solutions of systems of 5000-50,000 nonlinear equations in practical computation time.     

MIP-based approaches for the container loading problem with multi-drop constraints

In this paper, we present approaches based on a mixed integer linear programming model (MIP) for the problem of packing rectangular boxes into a container or truck, considering multi-drop constraints. We assume that the delivery route of the container is already known in advance and that the volume of the cargo is less than or equal to the container volume. Considering the sequence that the boxes should be unloaded, the aim is to avoid additional handling when each drop-off point of the route is reached, as well as ensuring that the boxes do not overlap each other and the cargo loading is stable. Computational tests with the proposed model and the approaches were performed with randomly generated instances and instances from the literature using an optimization solver embedded into a modeling language. The results validate the model and the approaches, but indicate that they are able to handle only problems of a moderate size. However, the model and the approaches can be useful to motivate future research to solve larger problems, as well as to solve more general problems considering integrated vehicle routing and container loading problems.     

A reference length approach for the 3D strip packing problem

In the three-dimensional strip packing problem (3DSP), we are given a container with an open dimension and a set of rectangular cuboids (boxes) and the task is to orthogonally pack all the boxes into the container such that the magnitude of the open dimension is minimized. We propose a block building heuristic based on extreme points for this problem that uses a reference length to guide its solution. Our 3DSP approach employs this heuristic in a one-step lookahead tree search algorithm using an iterative construction strategy. We tested our approach on standard 3DSP benchmark test data; the results show that our approach produces better solutions on average than all other approaches in literature for the majority of these data sets using comparable computation time.     

On the implementation of a log-barrier progressive hedging method for multistage stochastic programs

A progressive hedging method incorporated with self-concordant barrier for solving multistage stochastic programs is proposed recently by Zhao [G. Zhao, A Lagrangian dual method with self-concordant barrier for multistage stochastic convex nonlinear programming, Math. Program. 102 (2005) 1-24]. The method relaxes the nonanticipativity constraints by the Lagrangian dual approach and smoothes the Lagrangian dual function by self-concordant barrier functions. The convergence and polynomial-time complexity of the method have been established. Although the analysis is done on stochastic convex programming, the method can be applied to the nonconvex situation. We discuss some details on the implementation of this method in this paper, including when to terminate the solution of unconstrained subproblems with special structure and how to perform a line search procedure for a new dual estimate effectively. In particular, the method is used to solve some multistage stochastic nonlinear test problems. The collection of test problems also contains two practical examples from the literature. We report the results of our preliminary numerical experiments. As a comparison, we also solve all test problems by the well-known progressive hedging method.     

Cost impact of float loss on a project with adjustable activity durations

Although delays to non-critical activities within the float do not always affect the overall completion time of a project, they commonly cause disputes over the impact cost and apportionment resulting from the complexity of resource utilization in construction projects. Therefore, considerable attention has been focused on providing an effective and reliable method for analysing the effects of float loss. Several recent studies have proposed various methods; however, most of these methods are based on the assumption of a fixed duration for each activity or activity-based cost simulation. Few studies have considered the trade-off between time and costs and the integration of project resources. Using genetic algorithms, this study introduces a critical path method (CPM)-modified resource-integrated optimization model and successfully quantifies the impact of float loss on the total cost of the project. The results provide objective quantification for accurately evaluating the impact of within-float delays and facilitate the analysis of the impact of delay claims on cost and apportionment in construction projects.