首页> 外国专利> METHOD FOR SOLVING PARTIAL CONSTRAINT SATISFACTION PROBLEMS FOR SEQUENCING TASKS

METHOD FOR SOLVING PARTIAL CONSTRAINT SATISFACTION PROBLEMS FOR SEQUENCING TASKS

机译:解决任务排序的部分约束满足问题的方法

摘要

The present invention provides a method utilizing evolutionary processes for solving partial constraint satisfaction problems in order to produce a near-optimal or optimal sequence of products for manufacture. More specifically, a computer implemented method for generating an optimized sequence of 'N' number of products for manufacture is provided, where said products are of 'M' number of distinct types with a fixed number ('Nt') of each type being desired and each product type comprising an array ('Q') of distinct features, wherein said manufacture is optionally constrained by one or more of the following constraints: the production requirement for each product type, feature-based position equations, and feature-based position inequalities, wherein each of said constraints is individually designated as either a hard constraint which cannot be violated, or as a soft constraint which can be violated at a predetermined cost; said method comprising: generating an initial population of chromosomes, wherein each chromosome represents a feasible sequence of products of various types for manufacture, feasibility depending on satisfaction of all of said hard constraints; associating a fitness value with each chromosome, said fitness value being a function of the predetermined cost associated with the degree of violation of each of said soft constraints; sorting said chromosomes based on the fitness value associated with each chromosome; and applying iteratively to the population of chromosomes a reproductive process, comprising (1) selection of a genetic operator, (2) selection of one or two chromosomes, the number of chromosomes to be selected correlating with the selected genetic operator, (3) application of the selected genetic operator to the selected one or two chromosomes to cause generation of one or two offspring, (4) insertion of one offspring chromosome into the sorted population, and (5) discard of one of the least desirable chromosomes in the population; said iterative process being continuously run until the fitness value for the best chromosome satisfies a known criterion or until a pre-determined time has elapsed.
机译:本发明提供了一种利用进化过程来解决部分约束满足问题的方法,以产生接近最优或最优的制造产品序列。更具体地,提供了一种计算机实现的方法,该方法用于生成用于制造的“ N”个产品的优化序列,其中所述产品是“ M”个不同类型的产品,并且希望每种类型的固定数量为“ Nt”以及每个产品类型均包含具有不同特征的数组('Q'),其中,上述制造过程可能会受到以下一个或多个约束的约束:每个产品类型的生产要求,基于特征的位置方程式以及基于特征的位置不等式,其中每个所述约束分别指定为不能违反的硬约束或可以以预定成本违反的软约束;所述方法包括:产生染色体的初始种群,其中每个染色体代表用于制造的各种类型的产品的可行序列,可行性取决于对所有所述硬约束的满足;以及将适应度值与每个染色体相关联,所述适应度值是与违反每个所述软约束的程度相关联的预定成本的函数;根据与每个染色体相关的适应度值对所述染色体进行分类;并将繁殖过程迭代地应用于染色体群体,该过程包括(1)选择遗传操作员,(2)选择一个或两个染色体,待选择的染色体数目与所选择的遗传操作员相关,(3)应用选定的遗传算子对选定的一或两个染色体造成一个或两个后代的产生;(4)将一个后代染色体插入已分类的种群中;(5)丢弃种群中最不希望的染色体之一;所述迭代过程将持续进行,直到最佳染色体的适应度值满足已知标准为止或直到经过预定时间为止。

著录项

  • 公开/公告号WO0036523A1

    专利类型

  • 公开/公告日2000-06-22

    原文格式PDF

  • 申请/专利权人 XIAO JING;

    申请/专利号WO1999US29492

  • 发明设计人 XIAO JING;

    申请日1999-12-13

  • 分类号G06F15/18;

  • 国家 WO

  • 入库时间 2022-08-22 01:50:16

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号