基于GIS的城市公交路网最优路线算法研究

利用GIS地理分析的特性,提出了一种较为简单的公交路网的描述方法。同时,设计了合乎乘客心理的最优路线判断标准,并在此基础上,设计了基于公交路线的双向搜索最短路算法,该算法与现有的基于公交站点最短路算法相比,大大地减少了计算时间。     

概念格的分层及逐层建格法

给出了分层概念格重要性质:同层概念不可比和每个概念至少被1个上层的概念覆盖.得到了概念格上的对象映射和属性映射的一般计算公式和在对象化简过程中格结构不变的定理.由上述性质和定理,给出建格算法.此方法以概念格分层为基础,逐层建格.因为在建每层格的节点的过程中同时进行筛选,所以不会生成冗余重复的格节点.     

Application of Auction Algorithm for Shortest Paths to Traffic Assignment

Auction algorithm is a new and simple algorithm for finding shortest paths in a directed graph proposed by Prof. Bertsekas, whose application has been extended to solve a variety of linear network flow problems. In this paper, auction algorithm for shortest paths is introduced and its characteristics are analyzed. The paper compares the auction algorithm with other algorithms widely used such as label-setting algorithm and label-correcting algorithm. The auction algorithm is particularly applicable to parallel computation and to the solution of a large-scale sparse network, which precisely meets the requirements of the traffic assignment. The algorithm is easy to program. Through a variety of measures the basic algorithm can be improved and speeded up and the computation speed can be increased by several times. The auction algorithm can be adopted in various traffic assignment methods. It can be used efficiently in the case of multiple origins and a single destination, and a single origin and multiple destinations. Different origin sets and destination sets are determined in accordance with the requirement of the traffic assignment. It is not required any more to find the shortest paths connecting any node pairs, so a lot of computation can be avoided and the computing time can be reduced by the use of the auction algorithm in the traffic assignment. Auction algorithms can thus be broadly applied in the transportation fields.     

生产管理中一类排序问题的扩展模型及通用算法

讨论了生产管理中将n个零件安排给m台机器加工的一类排序问题。取消了m≤n的限制，允许机制空闲并引入负荷（最大加工零件数）的思想，得出了此类排序问题的扩展模型以及通用求解算法。算便结果表明该扩展模型和求解算法的有效性。     

IMAGE SEGMENTATION BASED ON MARKOV RANDOM FIELD AND WATERSHED TECHNIQUES

IntroductionThere are many methods to perform imagesegmentation and edge detection tasks that incor-porate region- growing and edge detection tech-niques,for example,it is applying edge detectiontechniques to obtain Difference In Strength( DIS)map then employ region growing techniques towork on the map as in Refs.[1 ,2 ]. In the others,combining both special and intensity information inimage segmentation approach based on multi- reso-lution edge detection,region selection and intensi-ty thre…     

对Apriori算法的进一步改进

介绍了关联规则挖掘的情况，并在分析关联规则的数据挖掘算法的基础上，针对Apriori算法和Apriori-1算法进行深入研究，提出了Apriori-2算法，新算法在计算候选大项集支持度所涉及的记录数目将小于事务数据库中原始的记录数目，提高了原算法的效率，具有一定的实用性．     

基于随机相关机会规划的公交调度模型研究

在公交车辆调度问题中，考虑到公交调度中的不确定因素，引入相关机会规划模型厦其相关概念．给出基于随机模拟的遗传算法步骤，能使得调度决策更能尽可能地执行，同时更加接近实际调度情况。     

集装箱码头前沿布局的仿真优化

应用仿真优化方法研究了某集装箱码头前沿布局中泊位数，岸边集装箱装卸桥（岸桥）陆侧轨外侧作业通道数，岸桥及集装箱拖挂车（集卡）配备数量等因素对作业过程及码头通过能力的影响．开发了可生成不同集装箱码头前沿布局方案的参数化仿真模型，建立了仿真结果数据库和多目标多层次的方案综合评价指标体系．把遗传算法与系统仿真相结合，以评价指标体系评价得分作为优化目标，求得了最优方案，供决策者参考．     

社区儿童接送服务车辆的线路优化

以社区儿童接送服务车辆的路线优化问题为研究对象,建立了多目标非线性整数规划模型,其中目标函数包括车辆数最少、车辆行驶的时间最短、所有乘客总旅行时间最短、各辆车的负荷均衡、各辆车的运行时间均衡5个目标.这5个目标分为4个优先级.提出了解决这类问题的新的启发式优化算法.该算法从构造最小生成树开始,找出基本线路;然后通过选择可调单元调整线路得到优化的线路.提出了线路确定后,乘客要求调整线路时应遵循的原则.     

Combining Single（Mixed） Metric Approach and Genetic Algorithm for QoS Routing Problem

A hybrid algorithm for the delay constrained least cost path problem is proposed through combination of single(mixed)metric approach and genetic algorithm．Compared with the known genetic algorithm for the same problem，the new algorithm adopts integral coding scheme and new genetic operator，which reduces the search space and improves the efficiency of genetic operation．Meanwhile，the single(mixed)approach accelerates the convergence speed．Simulation results indicate that the proposed algorithm can find near-optimal even optimal solutions within moderate numbers of generations．