共查询到20条相似文献,搜索用时 203 毫秒
1.
2.
3.
基于缩减信念状态的Conformant 规划方法 总被引:1,自引:0,他引:1
Conformant 规划问题通常转化为信念状态空间的搜索问题来求解.提出了通过降低信念状态的不确定性来提高规划求解效率的方法.首先给出缩减信念状态的增强爬山算法,在此基础上,提出了基于缩减信念状态的Conformant 规划方法,设计了CFF-Lite 规划系统.该规划器的求解过程包括两次增强爬山过程,分别用于缩减信念状态和搜索目标.首先对初始信念状态作最大程度的缩减,提高启发函数的准确性;然后从缩减后的信念状态开始执行启发式搜索.实验结果表明,CFF-Lite 规划系统通过快速缩减信念状态降低了问题的求解难度,在大多数问题上,求解效率和规划解质量与Conformant-FF 相比,都有显著的提高. 相似文献
4.
针对多无人机协同搜索区域内多运动目标问题,考虑传感器的探测概率与虚警概率、无人机的飞行与避撞约束和目标随机运动等特征,提出基于信息图的多无人机三维协同搜索方法.以无人机搜索的短期收益、长期收益和协调收益的平衡为核心,考虑无人机三维运动的特征,构建多无人机协同搜索的数学规划模型,并设计包含目标存在概率、环境不确定度、重访信息素和搜索增益4个因子的搜索信息图.基于滚动规划架构,整合新提出的剪枝方法进行模型的求解.在典型的协同搜索场景下,通过数值仿真验证所提方法的有效性.仿真结果表明,所提出的方法可以在秒级的时间内做出每架无人机的三维航迹决策,重访信息素和搜索增益因子可以引导无人机捕获更多的目标.对比仿真结果表明,所提出的方法可以在捕获更多目标的同时具有更少的误判次数,有效提升了多无人机协同搜索的任务效能. 相似文献
5.
6.
提出了在二元约束满足问题中以搜索结点个数为衡量标准的求解开销模型,该模型被应用于随机二元约束满足问题的求解开销相变分析中,并且比较了模型所导出的理论开销和实际中的搜索结点个数、约束检查次数、求解时间3种衡量标准的开销之间的相似性.在模型的基础上,探讨了求解启发式减少求解开销的作用,给出了一个新的变量选择启发式. 相似文献
7.
基于混合蚁群优化的卫星地面站系统任务调度方法 总被引:6,自引:0,他引:6
卫星地面站系统任务调度是一个典型的组合优化问题, 优化过程极其复杂. 鉴于此, 提出了一种有效求解该问题的基于蚁群优化算法和导向局部搜索方法的混合优化方法. 该方法将蚁群优化和导向局部搜索有效地结合在一起, 极大地提高了优化绩效. 实例计算结果表明, 该混合方法能有效地求解卫星地面站系统任务调度问题. 相似文献
8.
模块化机器人的重构规划中,由于各模块的目标分配与其轨迹规划之间的耦合关系导致组合爆炸问题.本文提出一种基于简化模型的能量次优规划方法,将重构规划问题转化为最优控制问题,实现目标分配与轨迹规划的解耦.通过求解由Hamilton-Jacobi-Bellman(HJB)方程描述的最优控制问题,得到简化模型的值函数和最优轨迹.各模块的运动目标由值函数的吸引域决定.通过在最优轨迹附近的次优区域内搜索得到实际运动轨迹,提高了搜索效率.仿真实验结果表明,该方法能够选择合适的模块组合,并能在障碍物环境中生成满足机器人动力学约束的运动轨迹. 相似文献
9.
针对物流配送需求大、“最后一公里”交付困难等问题,提出带有动态能耗约束的多车辆与多无人机协同配送问题,并以最小化配送时间为目标建立混合整数规划模型(MIP).为解决该问题,设计K-means聚类和最近邻协同的初始解生成算法,并提出基于问题领域知识的自适应大规模邻域搜索算法(adaptive large neighborhood search,ALNS).在不同规模算例上的实验结果表明,所提出的算法相比于模拟退火算法、变邻域搜索算法和遗传算法在求解质量和求解效率方面都具有一定的优势,求解质量分别平均提升23.8$%$、23.3$%$和5.7$%$,表明ALNS较对比算法能够更好地平衡全局搜索和局部搜索.此外.灵敏度分析实验表明,无人机载重能力和无人机续航能力是影响包裹配送时间的两个关键因素. 相似文献
10.
基于蚁群优化算法的目标拆卸序列规划 总被引:3,自引:0,他引:3
为了能够以较高的效率求解出产品中目标零件的拆卸方案,基于产品中零件间的拆卸优先约束关系,提出并建立目标零件的拆卸层次信息图模型,将目标零件的拆卸序列规划问题转化为对该图模型中具备最优值的路径的搜索和寻优问题.同时,提出一种改进蚁群优化算法,以实现对目标零件拆卸层次信息图的构建和对拆卸方案的搜索与寻优.最后通过实例验证了该方法的可行性和计算效率. 相似文献
11.
汽车装配车间生产计划与调度的同时优化方法 总被引:14,自引:0,他引:14
文中提出三种新方法来解决汽车装配车间生产计划与调度的同时优化问题.首先将汽
车装配线简化为一个Flow shop问题,并建立其混合整数规划模型,以求得使各装配工位的准
备成本和空闲时间尽可能少并尽可能满足产品需求的粗生产计划.然后在粗生产计划的基础上
考虑装配线的细节,用Tabu搜索法与快速调度仿真相结合的三种不同启发式算法使生产计划
与调度同时得到优化,并给出了三种算法的复杂性.大量算例的比较研究表明了这些算法的有
效性和适用性. 相似文献
12.
Geraldo R. Mateus Martín G. Ravetti Maurício C. de Souza Taís M. Valeriano 《Journal of Scheduling》2010,13(3):245-259
We consider here the lot sizing and scheduling problem in single-level manufacturing systems. The shop floor is composed of
unrelated parallel machines with sequence dependent setup times. We propose an integer programming model embedding precise
capacity information due to scheduling constraints in a classical lot-sizing model. We also propose an iterative approach
to generate a production plan taking into account scheduling constraints due to changeover setup times. The procedure executes
two decision modules per iteration: a lot-sizing module and a scheduling module. The capacitated lot-sizing problem is solved
to optimality considering estimated data and aggregate information, and the scheduling problem is solved by a GRASP heuristic.
In the proposed scheme the information flow connecting the two levels is managed in each iteration. We report a set of computational
experiments and discuss future work. 相似文献
13.
基于粗糙规划的不确定加工时间的并行机调度 总被引:1,自引:0,他引:1
针对并行机调度中的不确定工件加工时间,提出用粗糙变量表示不确定量,并由此建立该问题的粗糙期望值规划模型.提出一种应用于调度问题的进化规划算法,改进了针对并行机问题的编码方式和变异方法.采用粗糙模拟的方法计算个体的适应值,即粗糙期望估计值,并加以不同规模的算例进行仿真实验.仿真结果表明,改进进化规划算法得到的解优于遗传算法得到的解. 相似文献
14.
单人负责多台机器的单一工序作业车间场景中,工人由于重复操作机器而产生学习效应.针对考虑依赖工件位置学习效应的单人单工序作业车间最小化最大完工时间的调度问题,建立一种混合整数规划模型.为解决该问题,设计一个考虑学习效应的贪婪算子,利用该算子构造两种贪婪算法,并提出一种基于贪婪的模拟退火算法.为衡量混合整数规划模型、贪婪算法和基于贪婪的模拟退火算法的性能,设计两种规模问题的数据实验.通过实验得出:现代混合整数规划模型求解器可以解决机器数量和工件总数量乘积小于75的小规模问题;基于贪婪的模拟退火算法求解此问题具有有效性,适用于各种规模的问题;间隔插入贪婪算法解决此问题速度较快,效果良好,可以应用于需要快速求解的场景. 相似文献
15.
This paper addresses a ternary-integration scheduling problem that incorporates employee timetabling into the scheduling of machines and transporters in a job-shop environment with a finite number of heterogeneous transporters where the objective is to minimize the completion time of all jobs. The problem is first formulated as a mixed-integer linear programming model. Then, an Anarchic Society Optimization (ASO) algorithm is developed to solve large-sized instances of the problem. The formulation is used to solve small-sized instances and to evaluate the quality of the solutions obtained for instances with larger sizes. A comprehensive numerical study is carried out to assess the performance of the proposed ASO algorithm. The algorithm is compared with three alternative metaheuristic algorithms. It is also compared with several algorithms developed in the literature for the integrated scheduling of machines and transporters. Moreover, the algorithms are tested on a set of adapted benchmark instances for an integrated problem of machine scheduling and employee timetabling. The numerical analysis suggests that the ASO algorithm is both effective and efficient in solving large-sized instances of the proposed integrated job-shop scheduling problem. 相似文献
16.
A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
In this article we investigate the parallel machine scheduling problem with job release dates, focusing on the case that machines are dissimilar with each other. The goal of scheduling is to find an assignment and sequence for a set of jobs so that the total weighted completion time is minimised. This type of production environment is frequently encountered in process industry, such as chemical and steel industries, where the scheduling of jobs with different purposes is an important goal. This article formulates the problem as an integer linear programming model. Because of the dissimilarity of machines, the ordinary job-based decomposition method is no longer applicable, a novel machine-based Lagrangian relaxation algorithm is therefore proposed. Penalty terms associated with violations of coupling constraints are introduced to the objective function by Lagrangian multipliers, which are updated using subgradient optimisation method. For each machine-level subproblem after decomposition, a forward dynamic programming algorithm is designed together with the weighted shortest processing time rule to provide an optimal solution. A heuristics is developed to obtain a feasible schedule from the solution of subproblems to provide an upper bound. Numerical results show that the new approach is computationally effective to handle the addressed problem and provide high quality schedules. 相似文献
17.
F. Jolai M. S. Amalnick M. Alinaghian M. Shakhsi-Niaei H. Omrani 《Journal of Intelligent Manufacturing》2011,22(2):247-261
This paper presents a hybrid memetic algorithm for the problem of scheduling n jobs on m unrelated parallel machines with the objective of maximizing the weighted number of jobs that are completed exactly at their
due dates. For each job, due date, weight, and the processing times on different machines are given. It has been shown that
when the numbers of machines are a part of input, this problem is NP-hard in the strong sense. At first, the problem is formulated
as an integer linear programming model. This model is practical to solve small-size problems. Afterward, a hybrid memetic
algorithm is implemented which uses two heuristic algorithms as constructive algorithms, making initial population set. A
data oriented mutation operator is implemented so as to facilitate memetic algorithm search process. Performance of all algorithms
including heuristics (H1 and H2), hybrid genetic algorithm and hybrid memetic algorithm are evaluated through computational
experiments which showed the capabilities of the proposed hybrid algorithm. 相似文献
18.
树型网格计算环境下的独立任务调度 总被引:17,自引:1,他引:17
任务调度是实现高性能网格计算的一个基本问题,然而,设计和实现高效的调度算法是非常具有挑战性的.讨论了在网格资源计算能力和网络通信速度异构的树型计算网格环境下,独立任务的调度问题.与实现最小化任务总的执行时间不同(该问题已被证明是NP难题),为该任务调度问题建立了整数线性规划模型,并从该线性规划模型中得到最优任务分配方案??各计算节点最优任务分配数.然后,基于最优任务分配方案,构造了两种动态的需求驱动的任务分配启发式算法:OPCHATA(optimization-based priority-computation heuristic algorithm for task allocation)和OPBHATA(optimization-basedpriority-bandwidth heuristic algorithm for task allocation).实验结果表明:在异构的树型计算网格环境下实现大量独立任务调度时,该算法的性能明显优于其他算法. 相似文献
19.
Many embedded or portable devices have large demands on running real-time applications. The designers start to adopt the multicore processors in these devices. The multi-core processors, however, cause much higher power consumption than ever before. To resolve this problem, many researchers have focused their studies on designing the energy-aware task scheduling algorithms for multicore processors. Conventional scheduling algorithms assumed that each core can operate under different voltage levels. However, they have not considered the effects of voltage transition overheads, which may defeat the benefit of task scheduling. In this paper, we aim to resolve this scheduling problem with voltage transition overhead consideration. We formalize this problem by an integer linear programming model and propose a heuristic algorithm for a runtime environment. The experimental results show that the proposed online heuristic algorithm can obtain the comparable results with the optimal scheduling derived by the offline integer linear programming approach. 相似文献