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 摘要给出了用共轭梯度法解信赖域子问题的重新开始策略,并证明了方法的收敛性,数值结果表明该策略可以大大提高算法的收敛速度。
The priority-based wavelength assignment method is employed to meet different operation requests . another rwa algorithm based on the layered-gragh model is used to resolve the two subproblems of routing and wavelength assignment simultaneously 文章还讨论了一种基于分层图模型的rwa算法,它使得光网络的路由和波长分配两个子问题同步解决。
The major features of this mechanism are advantages of generating mechanism of implicit rules to ease difficulty in solving complex problems and decomposing complex problems into typical subproblems to avoid match-retrieve of large scope 主要措施是:利用一类隐含规则的产生机制,来降低问题的求解难度;把复杂问题分解成若干典型问题来加以解决,避免大范围匹配-回溯。
Some properties of the optimal path of trust region methods are shown, and the relationship between dogleg path and optimal path is analysed . this can be used to derive better approximate algorithms for solving trust region subproblems 本文描述了信赖域方法最优曲线在二维子空间内投影的几个性质,分析了几种信赖域折线法与该投影的关系,为推导更好的求解信赖域子问题的折线近似提供理论依据
In order to obtain the solutions to this system, uniform design is introduced to choose the initial points . then based on these points decompose the admitted region into finite subregions, in which an improved hooke-jeeves algorithm is constructed to solve the subproblems 为了求解此系统,以均匀设计方法选初始点,并依此把允许区域分解为有限多个子域,在每个子域上构造了改进的hooke-jeeves优化算法。
The research on vrp before has too much limiting factor, so it is hard to implement . according to operation flow in fact, we put forward a mode of distribution optimization problem base on layers, then analysing subproblems in mode, constructing mathematic mode and giving algorithm 传统的vrp问题研究,多把问题限制在某一较小的范围内,本文结合实际配送业务流程,提出了基于层次的配送优化调度求解模型,分析模型中各子问题,建立数学模型,给出求解算法。