...
首页> 外文期刊>Discrete Applied Mathematics >Improving local search heuristics for some scheduling problems. Part II
【24h】

Improving local search heuristics for some scheduling problems. Part II

机译:针对某些调度问题改进本地搜索启发式。第二部分

获取原文
获取原文并翻译 | 示例
           

摘要

Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on the set of feasible solutions of a discrete optimization problem. For the scheduling problems Pm || Cmax, 1 | prec | ∑ Ui, and a large class of sequencing problems with precedence constraints having local interchange properties we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that are locally optimal. Computational results are presented.
机译:诸如模拟退火和禁忌搜索之类的局部搜索技术基于在离散优化问题的可行解集上定义的邻域结构。对于调度问题Pm || Cmax,1 |精确| ∑ Ui,以及具有优先级约束且具有局部交换属性的一大类排序问题,我们用所有局部最优解集合上的邻域代替简单邻域。这允许在局部最优的解决方案集上进行局部搜索。给出了计算结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号