the research on vehicle routing problem is emphases in the subproblems, so we give a case to prove it 其中重点研究了遗传算法求解带时间窗的vrp问题,并进行了实例验证。
through solving a sequence of subproblems, the current optimal feasible solution can be incessantly renewed and the global optimal solution can be got at last 通过求解一系列的子问题,当前最优解被不断地更新,最终求得全局最优解。
abstract : based on summarization of solving state space problems, the author establishs mechanism of decomposing problems into typical subproblems and solving them 文摘:在对状态空间的问题求解知识进行归纳总结的基础上,建立了将复杂问题分解成典型问题及其求解的机制。
robot motion planning ( rmp ) problem is one of the most necessary and important topics, which is usually divided into two subproblems, i . e ., space path planning and frajectory planning 机器人运动规划问题是机器人领域中最基本、最重要的课题之一。一般将机器人运动规划分为空间路径规划和轨迹规划两部分。
this paper presents a conjugate gradient method using restart strategy for solving trust region subproblems . and the convergence is proved . the numerical results show that this strategy is very effective 摘要给出了用共轭梯度法解信赖域子问题的重新开始策略,并证明了方法的收敛性,数值结果表明该策略可以大大提高算法的收敛速度。