助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[30]条 当前为第21条到30条
 

相关语句
启发式算法
    This paper describes the path choice model of the public transport networks, designs a heuristic algorithm for the public transport network multi-path selection based on the Dijkstra's algorithm and the Iterative Penalty Method, and tests the algorithm with a real public transport network.
    建立了公交网络出行路径选择的数学模型,在Dijkstra算法和迭代惩罚法的基础上,设计了公交网络多路径选择的启发式算法,并结合实际公交网络进行了算法的验证。
    A heuristic algorithm which is base on step acceleration method and penalty function method is proposed,and a numerical example is presented.
    最后,设计了一个基于步长加速法和惩罚函数法的启发式算法,并求解算例。
    A practical example is presented,which simulates with real data and decides the optimal freeway toll standard,by using a heuristic algorithm based on step acceleration method and penalty function method.
    结合一个实际案例,通过基于步长加速法和惩罚函数法的启发式算法对模型求解,利用实际数据进行仿真,从而确定最优收费方案;
    Based on the analysis of the features of the city goods delivery and vehicle dispatching,a multi-object decision-making model of the velicle dispatching for the optimal overall benefits was built,and an allocating-saving heuristic algorithm to solve the model was designed.
    在分析城市货物配送和车辆调度特点的基础上,建立了追求总体效益最优的车辆调度多目标决策模型,并设计分派-节约启发式算法求解该模型。
    The allocating heuristic algorithm ensures the maximum satisfaction of the clients,and the saving algorithm ensures the overall optimization.
    通过分派启发式算法保证最大程度地满足客户的要求,再利用节约算法保证了全局最优。
    A model was built for the flexible choice of vehicle routes with a certain departure time,and a heuristic algorithm was proposed.
    建立了该问题的模糊机会规划模型,并给出了一种启发式算法.
    Then the customer districts are assigned to vehicles using the vehicle scheduling model and heuristic algorithm.
    建立车辆调度优化模型,利用启发式算法完成客户区域对车辆的分配.
    A heuristic algorithm for the model was designed.
    提出了模型的一种启发式算法.
    The Clarke-Wright heuristic algorithm was combined with other algorithms to utilize both the package principle theory and the assembly line balancing algorithm. The resulting θRC heuristic algorithm can deal with the two objective vehicle routing problem,which aims to minimize the total distance and balance the workload among trips as much as possible.
    利用C larke-W righ t算法,结合打包原则和装配线线均衡算法的思想,设计出一种称为θRC的启发式算法来处理两个目标的车辆路径优化问题:一是最小化总距离,二是均衡各条线路间负载。
    Then,after introducing the graph model and mathematical model of the problem,we analyze the advantages and disadvantages of the two kinds of models. Besides that,we review four kinds of(algorithms) for VRP,exact algorithm,constructive heuristic algorithm,improving heuristic algorithm and meta-heuristic(algorithm.)
    分四大类讨论求解该问题的算法:精确算法(exact a lgorithm),构造启发式算法(constructive heuristic a lgorithm),改进启发式算法(im prov ing heuristic a lgorithm),和亚启发式算法(m eta-heuristic a lgorithm),评述各类算法适用的问题求解阶段以及各自的优缺点;
 

首页上一页12下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社