几种特殊曲面上的测地线

具体刻画了柱面、锥面、旋转曲面上测地线的几何特征,所得结果一方面匡正了某些文献关于锥面上测地线的错误断言,一方面推广了现有文献关于旋转曲面上测地线几何性质的描述.     

圆环面上测地线的稳定性

通过讨论圆环面上的测地线,研究在纤维缠绕时测地线的稳定性问题,按传统观点,测地线在曲面上是最稳定的,其意为一条弹性柔软的细线,在给定曲面上拉紧时,其形状应是测地线,且不会使曲线变形,上述提法仅在局部领域中成立,从整体角度分析,当拉紧弹性柔软细线时,将有两类不稳定测地线,第一类不稳定产生于过两点可以有多条测地线,另一类是缠绕的测地线位于曲面的凹侧,此时就会产生搭桥现象,这两类不稳定性在纤维缠绕中有着现实的意义,文章将对圆环面的测地线进行具体讨论。     

凸曲面上的测地线的测地法线

<正> §1.引言 在正则曲面上的测地线具有这样的性质,从测地线上的每一点可引与这测地线垂直的测地线.但在任意的凸曲面上的一条测地线L可能具有这样的点,从它不能引与L垂直的测地线.(见[1]中第255—256页.)作者最近发现,L上具有这种特殊性质的点在某种意义上说是极少数.确切言之,L上不能引与L垂直的测地线的点组成一个在L上的零测度集合.本文目的就是给出这个结果的证明.     

确定地球的大小和形状

人们试图测量地球的大小和形状已有悠久的历史。在17世纪,理论研究预言地球的形状是一个扁平的球体,后来有实验研究对此结果提出质疑。到18世纪,为了解决这个问题,人们在不同地点对子午线的弧长作了测量。本模型说明了在地球是一个近似旋转椭球的假设下,如何通过由测量得知的不同纬度的子午线弧长,得出地球的大小和形状。     

一类步数为2(k+1)的次黎曼流形上测地线的研究

构造了一类步数为2(k+1)的次黎曼流形,给出其上连接原点和t轴上一点测地线的条数和相应测地线的长度,同时得到其中最短的测地线.     

关于球面上的短程线

高中数学课本第二册第62页介绍了球面上两点间的最短距离,就是经过这两点的大圆被它们所分成的两段弧中较小一段的弧长(一般称为球面上的短程线或测地线).课本没有进行证明,因为证明要用到变分法的知识,学生对此不易理解.这里,我们提出一个较弱的命题,并且给予初等的证明,供参考.     

平行映射下保测地线的曲面

利用古典微分几何方法,讨论了在平行映射下测地线不变的曲面若干局部性质;研究了该类曲面的测地坐标系,并最终得出满足该条件的曲面只有三类.     

树的笛卡儿积的测地数

图G内的任意两点u和υ,u-υ测地线是指u和υ之间的最短路.I(u,υ)表示位于u一υ测地线上所有点的集合,对于子集S∈V(G),I(s)表示所有,(u,υ)的并,这里u,υ∈S.图G的测地数g(G)是使,I(s):V(G)的点集S的最小基数.本文研究了任意连通图G与树T笛卡儿积的测地数的界,同时,给出了任意两个树T1与T2笛卡儿积的测地数和树T与圈C笛卡儿积的测地数.     

Morse指标和闭测地线的稳定性

令ind(c)为n+1维Riemann流形M上闭测地线c的Morse指标.我们证明:对于闭测地线c,如果它是定向的且n+ind(c)是奇数,或它是非定向的且n+ind(c)为偶数,则c不稳定.Poincaré的一个著名定理说Riemann面上的极小闭测地线是不稳定的,我们的结果是该结论的一个推广.     

关于在极坐标φ=φ(r)形式下定积分的应用

在一般的分析教程中,对极坐标下定积分的应用通常是采用r=r(φ)的形式进行研究的。本文仅对φ=φ(r)的形式进行讨论,并推导出平面图形的面积、平面曲线的弧长、旋转体的体积以及旋转曲面的表面积公     

Weakly bipartite graphs and the Max-cut problem

A new class of graphs, called weakly bipartite graphs, is introduced. A graph is called weakly bipartite if its bipartite subgraph polytope coincides with a certain polyhedron related to odd cycle constraints. The class of weakly bipartite graphs contains for instance the class of bipartite graphs and the class of planar graphs. It is shown that the max-cut problem can be solved in polynomial time for weakly bipartite graphs. The polynomical algorithm presented is based on the ellipsoid method and an algorithm that computes a shortest path of even length.     

Dynamic shortest path problems with time-varying costs

This paper concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time, and parking with a corresponding time-varying cost is allowed at the nodes. The transit times can also take negative values. A general labeling method, as well as several implementations, are presented for finding shortest paths and detecting negative cycles under the assumption that arc traversal costs are piecewise linear and node parking costs are piecewise constant.     

“应召”搜索问题的最优搜索路线

解决了确定性二次搜索（即“应召”搜索）问题的最优搜索路线。在搜索时间期望值最小、最远可能航程最短、最长可能时间最短三个准则下分别找出了相应的最优搜索路线,并从理论上严格证明了三者的统一性。这个结论在军事领域具有很重要的应用价值     

Reducing fuel emissions by optimizing speed on shipping routes

Fuel consumption and emissions on a shipping route are typically a cubic function of speed. Given a shipping route consisting of a sequence of ports with a time window for the start of service, substantial savings can be achieved by optimizing the speed of each leg. This problem is cast as a non-linear continuous program, which can be solved by a non-linear programming solver. We propose an alternative solution methodology, in which the arrival times are discretized and the problem is solved as a shortest path problem on a directed acyclic graph. Extensive computational results confirm the superiority of the shortest path approach and the potential for fuel savings on shipping routes.     

“飞越北极”的数学模型

本文将“飞行时间节约 4小时”的问题 ,在飞行速度恒定的条件下 ,转化为计算飞机航程的问题 .根据题目的要求建立两个模型 .在球体模型 中 ,利用几何知识推出飞机航程和经纬度之间的直接关系 ,进而算得飞行节约的时间为 4 .0 50 4小时 .在旋转椭球体模型 中 ,解法 利用测量学中的贝赛尔方法 ,给出了飞机航程的近似计算公式 ,算得飞行节约的时间为 4 .0 4 1小时 .解法 则构造了一个简单的弧长作为两地间的近似航程 ,利用积分给出了弧长的精确计算公式和近似计算公式 ,算得飞行节约的时间分别为 4 .0 535小时和 4 .0 531小时 .这些结果解释了原题中“节约 4小时”的估计 .     

一种基于Dijkstra算法的机器人避障问题路径规划

移动机器人的避障问题是移动机器人控制领域的研究热点.针对给定的移动机器人避障问题,探讨了最短路径及最短时间路径的路径规划问题.对于最短路径问题,建立了简化的路径网格模型,将其抽象为由节点及边构成的两维图,再使用经典的Dijkstra算法获得可行的最短路径.对于最短时间路径问题,通过分析移动机器人弯道运行的速度曲线,基于几何方法得出了移动时间与过渡圆弧圆心之间严格的数学关系,此后借助MATLAB优化函数获得最佳的移动路径.算法可为类似机器人避障问题的解决提供借鉴.     

Vehicle routing problems with alternative paths: An application to on-demand transportation

The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a weighted complete graph. Each arc of the graph represents the shortest route for a possible origin–destination connection. Several attributes can be defined for one arc (travel time, travel cost, etc.), but the shortest route modeled by this arc is computed according to a single criterion, generally travel time. Consequently, some alternative routes proposing a different compromise between the attributes of the arcs are discarded from the solution space. We propose to consider these alternative routes and to evaluate their impact on solution algorithms and solution values through a multigraph representation of the road network. We point out the difficulties brought by this representation for general vehicle routing problems, which drives us to introduce the so-called fixed sequence arc selection problem (FSASP). We propose a dynamic programming solution method for this problem. In the context of an on-demand transportation (ODT) problem, we then propose a simple insertion algorithm based on iterative FSASP solving and a branch-and-price exact method. Computational experiments on modified instances from the literature and on realistic data issued from an ODT system in the French Doubs Central area underline the cost savings brought by the proposed methods using the multigraph model.     

Parametric resonance in the problem of a heavy rigid body rolling along a straight line on a plane

The problem of the stability of a heavy rigid body, bounded by the surface of an ellipsoid and with a cavity in the form of a coaxial ellipsoid, rolling along a straight line on a horizontal rough plane is investigated. It is shown that in the case of a body that is close to being dynamically symmetrical, parametric resonance always occurs leading to instability of the rolling. Each ellipsoid has its own “individual” resonance angular velocity. In the general case, regions in which the necessary stability conditions are satisfied can be distinguished in parameter space. The problem of calculating the resonance coefficient corresponding to instability for parametric resonance in a reversible third-order system is solved.     

Short separating geodesics for multiply connected domains

We consider the following questions: given a hyperbolic plane domain and a separation of its complement into two disjoint closed sets each of which contains at least two points, what is the shortest closed hyperbolic geodesic which separates these sets and is it a simple closed curve? We show that a shortest geodesic always exists although in general it may not be simple. However, one can also always find a shortest simple curve and we call such a geodesic a meridian of the domain. We prove that, although they are not in general uniquely defined, if one of the sets of the separation of the complement is connected, then they are unique and are also the shortest possible geodesics which separate the complement in this fashion.