非洲商业法规一体化组织负责监督执行八部商业法规（一般商业法、安全交易法、公司法、仲裁法、债务回收法、破产法、核算法、货物公路运输法）。
OHADA oversees eight business laws (general commercial, secure transactions, company law, arbitration, debt recovery, bankruptcy, accounting and transportation of goods by road).
由于simplex算法的出现，线性编程已经在工业界、银行界、教育界、林业、石油行业以及运输业界中广泛地用来解决优化问题。
Since the development of the simplex algorithm, linear programming has been used to solve optimization problems in industries as diverse as banking, education, forestry, petroleum, and trucking.
利用网络流算法对广义运输问题进行求解。
In this paper, generalized transportation problem was solved by using networks method.
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.
在利用串行调度启发式方法解决资源受限的运输任务调度问题（RCTTSP）的基础之上，提出了一种混合遗传算法（HGA）。
This paper proposes a Hybrid Genetic Algorithm(HGA) based on a serial scheduling heuristic method to solve the Resource-Constrained Transport Task Scheduling Problem(RCTTSP).
众所周知，1958年我国工作者提出的关于运输问题的图上作业法并不是一个完善的算法。
The graphical method of transportation problem is a well know, but not mature, algorithm arisen in 1958.
带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
本文用网络方法研究了广义的运输问题，给出了有效的算法。
In this paper, the generalized transportation problem is studied by networks method. A networks algorithm is proposed for the problem.
通过交通运输网络示例和实验对算法进行验证，对比分析算法性能。
Through the transportation network of sample and experiment verified, the algorithm is compared and analyzed.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.
本文在现代物流技术基础，特别是车辆调度和蚁群算法的基础理论指导下，针对现代物流运输车辆的调度优化问题，进行了理论、方法与模型的研究工作。
Based on the modern logistic technology, especially the vehicle scheduling and the ant algorithm theories, this paper make a research in theories, methods and models aiming at the present problems.
第五，大规模随机运输网络优化建模及算法。
Fifthly, optimization model and its algorithm for large-scale stochastic transportation network are studied.
在此基础上以运输成本最小化为二级目标建立模型，将其转化成带有分层的网络流模型，用最小费用最大流算法进行求解。
On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimum cost maximum flow algorithm.
对于非满载运输，借鉴改进的C - W节约算法的基本思想等。
Draw on improved C-W saving algorithm for non-full load transportation.
在建立货物配装的数学模型之后，根据货物运输的特点并结合组合理论设计了算法。
According to the characteristics of the goods transportation and the combination theory, the computer algorithm was proposed after the mathematic model of goods loading set up.
为使运输与吊装过程中箱形梁严格保持水平，设计中综合采用了位置同步控制和力跟踪控制算法，实现了4个油缸同步运动且受力平均。
Position synchronization control method combined with force tracing control algorithm was put forward to keep the girder horizontal and supported by 4 cylinders averagely.
构造了多目标多约束水平(MC2)动态运输问题的数学模型，开发了求解这一模型的迭代算法。
In this paper, a dynamic transportation model with multiple criteria and multiple constraint levels (DMC2) is formulated. An algorithm is developed to solve such DMC2 transportation problems.
介绍了采用反算法计算悬挂运输设备轨道的容许集中荷载标准值的公式及其应用图表。
Formula for calculating standard values of allowable concentrated loads in railway of hanging lifting equipment is introduced by using reversed calculation and their application.
本文探讨了铲土运输机械作业稳定性的失稳机理，对机械作业的极限工况进行了动态分析，并给出了简便算法。
This paper discusses the theory of destabilized operation of earthmoving machinery and describes the dynamic analysis of marginal operation conditions. A simple calculation method is given.
算法面向实际的运输网络，利用顶点间存在的路径关系，对个体进行优化，从而加速了算法收敛速度。
For a practical transport network, the algorithm used the relations among the points to optimize the individuals. Thus the procedure of the evolution was accelerated.
对应用于工程、交通运输、商业等领域中的一类优化问题给出一确定性水平集算法。
A deterministic level set algorithm is proposed for solving a class of optimization problems which arise in many fields such as engineering, traffic, business and other fields.
本文针对受时间约束的运输问题，提出了一种基于表上作业法的优化求解算法，并用算例说明了该算法的求解过程。
Aiming at the transportation problem with time constrained, a kind of optimized arithmetic based on table-working method is presented in this paper.
本文对运输问题的原设-对偶算法运用推拉流思想进行改进，得到一个拟多项式时间算法。
Based on the N-person cooperative game theory, this paper puts forward a model of the minimum cost allocation of transportation problem.
本文对运输问题的原设-对偶算法运用推拉流思想进行改进，得到一个拟多项式时间算法。
Based on the N-person cooperative game theory, this paper puts forward a model of the minimum cost allocation of transportation problem.
应用推荐