专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09530109B2 Iterative pattern generation algorithm for plate design problems 有权
标题翻译：板设计问题的迭代模式生成算法
公开(公告)号：US09530109B2
公开(公告)日：2016-12-27
申请号：US13822067
申请日：2011-09-13
申请人： Takayuki Yoshizumi
发明人： Takayuki Yoshizumi
IPC分类号： G06F19/00 , G06G7/48 , G06Q10/04 , G06Q10/06 , B21B37/00 , G05B19/4097
CPC分类号： G06Q10/043 , B21B37/00 , G05B19/4097 , G05B2219/35162 , G06Q10/06313 , G06Q10/06315
摘要： A method to generate a plurality of groups each including at least one of a plurality of elements. The method includes selecting at least one candidate element from the plurality of elements as a candidate to be included in a group, determining whether or not to generate the group including the at least one candidate element selected in the selecting step, based on an element evaluation value associated with each of the at least one candidate element selected in the selecting step, provided that a determination is made to generate the group in the determining step, generating the group including the at least one candidate element selected in the selecting step, and weighting the element evaluation value of each of the at least one element according to how many times the each element is included in already-generated groups to reflect the weighted element evaluation value in next group generation.
摘要翻译：一种生成多个组的方法，每个组包括多个要素中的至少一个。该方法包括从多个元素中选择至少一个候选元素作为要包括在组中的候选，基于元素评估来确定是否生成包括在选择步骤中选择的至少一个候选元素的组如果在确定步骤中确定生成组，则生成包括在选择步骤中选择的至少一个候选元素的组和加权的值，所述值与在选择步骤中选择的至少一个候选元素中的每一个相关联所述至少一个元素中的每一个元素的元素评估值根据已经生成的组中的每个元素的多少次来反映下一组生成中的加权元素评估值。

2. 发明申请

US20090106340A1 Generation of schedule by which physical items to be manufactured are assigned into production slots via reducing non-zero factors within coefficient matrix clusters 有权
标题翻译：通过减少系数矩阵群中的非零因子，生成待制造物理物品的时间表被分配到生产槽中
公开(公告)号：US20090106340A1
公开(公告)日：2009-04-23
申请号：US11875937
申请日：2007-10-21
申请人： Takayuki Yoshizumi
发明人： Takayuki Yoshizumi
IPC分类号： G06F7/38
CPC分类号： G06Q10/04 , G06Q10/06 , G06Q10/06315
摘要： A schedule is generated by which physical items to be manufactured are assigned into production slots. The physical items have constraints governing manufacture of the physical items. The method generates coefficient matrix clusters from a mathematical programming problem based on an actual scheduling problem. Each coefficient matrix cluster defines a variable cluster-constraint cluster pair. A variable cluster of each coefficient matrix cluster defines production slot-physical item pairs. A constraint cluster of each coefficient matrix cluster defines a group of constraints. Each coefficient matrix cluster includes coefficient-binary variable pairs, each pair having a binary variable multiplied by a coefficient. For each coefficient matrix cluster, the method reduces non-zero factors within the cluster. Each non-zero factor within the coefficient matrix cluster is defined as a coefficient-binary variable pair such that the binary variable of the pair multiplied by the coefficient of the pair is non-zero. The schedule is then generated.
摘要翻译：产生一个时间表，通过哪个物理物品被分配到生产槽。物理物品对物理物品的制造有制约因素。该方法基于实际调度问题从数学规划问题生成系数矩阵群集。每个系数矩阵群定义了一个变量簇约束簇对。每个系数矩阵群的变量簇定义了生产槽 - 物理对。每个系数矩阵群的约束簇定义了一组约束。每个系数矩阵簇包括系数二进制可变对，每对具有乘以系数的二进制变量。对于每个系数矩阵群集，该方法减少群集内的非零因子。系数矩阵簇内的每个非零因子被定义为系数二进制可变对，使得该对乘以该对的系数的二进制变量不为零。然后生成计划。

3. 发明申请

US20080255699A1 Technique for Determining Processing Sequence of Steel Plates 失效
标题翻译：确定钢板加工顺序的技术
公开(公告)号：US20080255699A1
公开(公告)日：2008-10-16
申请号：US12038019
申请日：2008-02-27
申请人： Toshiyuki Hama , Takayuki Yoshizumi
发明人： Toshiyuki Hama , Takayuki Yoshizumi
IPC分类号： G06F19/00
CPC分类号： B21B37/00
摘要： A system for determining a processing sequence of steel plates includes a constraint storage unit for storing positional constraints that define ranges of positions into which each type of steel plate is to be inserted when the steel plates are arranged in the processing sequence; a selecting unit for preferentially selecting, as a position into which a new steel plate is to be inserted in an array of steel plates already arranged in the processing sequence, a position having a larger expectation value of the number of steel plates that can be further inserted into the array of steel plates after the insertion of the new steel plate while satisfying the positional constraints; and an inserting unit for inserting the new steel plate into the selected position and for outputting data indicating the array of steel plates after the insertion.
摘要翻译：一种用于确定钢板的处理顺序的系统包括：约束存储单元，用于存储当以所述处理顺序排列所述钢板时限定要插入每种类型的钢板的位置范围的位置约束; 选择单元，用于优选地选择新的钢板插入到已经以处理顺序排列的钢板阵列中的位置，可以进一步选择具有较大钢板数量的期望值的位置在插入新钢板同时满足位置约束的情况下插入钢板阵列中; 以及插入单元，用于将新钢板插入所选择的位置，并用于在插入之后输出指示钢板阵列的数据。

4. 发明授权

US08930142B2 Route selection system, method and program 有权
标题翻译：路线选择系统，方法和程序
公开(公告)号：US08930142B2
公开(公告)日：2015-01-06
申请号：US13989222
申请日：2011-11-08
申请人： Takayuki Yoshizumi
发明人： Takayuki Yoshizumi
IPC分类号： G01C21/34 , G08G1/123
CPC分类号： G01C21/3492 , G01C21/3446
摘要： A method for obtaining a many-to-many route searching process with a reasonable amount of computation. The method includes preparing a graph expressing road segments as edges and route intersections as nodes, the weight of each road segment being approximated by a monotonically increased piecewise linear function, searching the graph for the shortest routes, establishing the obtained routes as a set of routes to be processed, solving an objective function so as to minimize the maximum value obtained by dividing the required time from each departure point to each destination point by the shortest required time with respect to the set of a plurality of departure points and destination points, and removing those routes whose minimum cost is greater than or equal to that of the current best solution, and any unused routes added in the previous iteration, while repeating the solving of the objective function.
摘要翻译：一种用于获得具有合理计算量的多对多路由搜索过程的方法。该方法包括准备表示路段作为边缘和路线交叉点作为节点的图，每个路段的权重通过单调增加的分段线性函数近似，在图中搜索最短路线，将所获得的路线建立为一组路线要处理，解决目标函数，以便将通过将从每个出发点到每个目的地点的所需时间除以相对于多个出发点和目的地点的集合的最短所需时间而获得的最大值最小化，以及删除最小成本大于或等于当前最佳解决方案的路由，以及在前一次迭代中添加的任何未使用的路由，同时重复解析目标函数。

5. 发明授权

US08688599B2 Transportation problem solving device, transportation problem solving method, and program and recording medium therefor 有权
标题翻译：运输问题解决装置，运输问题解决方法，程序和记录介质
公开(公告)号：US08688599B2
公开(公告)日：2014-04-01
申请号：US10936410
申请日：2004-09-08
申请人： Takayuki Yoshizumi
发明人： Takayuki Yoshizumi
IPC分类号： G06Q10/00 , G06Q50/00
CPC分类号： G06Q10/08
摘要： A transportation problem solving device for solving a transportation problem to optimize the end-to-end physical distribution consisting of a regional transportation and an inter-depot transportation, comprising a transformation section for adding a regional representative node representing a plurality of collection and delivery spots belonging to a depot to a model of inter-depot transportation, and incorporating the regional transportation between each of the plurality of collection and delivery spots belonging to the depot and the depot into a part of the model of inter-depot transportation as the inter-depot transportation between the depot and the regional representative node, an inter-depot transportation computing section for solving the transportation problem, based on a transformation model in which the regional transportation is incorporated into the inter-depot transportation, and computing a transportation plan for each delivery order in an inter-depot transportation portion, when a plurality of transport requests are input, and an output section for outputting the transportation plan computed by the inter-depot transportation computing section.
摘要翻译：一种运输问题解决装置，用于解决运输问题，以优化由区域运输和车间运输组成的端对端物理分配，包括：变换部分，用于添加表示多个收集和交付点的区域代表性节点属于仓库运输模式的仓库，并将属于车厂和车厂的多个收集和交付点之间的区域运输纳入作为车间间交通运输模式的一部分，根据区域运输合并到车间运输中的转型模式，计算出每个运输单位的运输计划，在仓库和区域代表性节点之间的仓库运输，一个用于解决运输问题的车间运输运输部门交货期间在仓库内运输 n，当输入多个传送请求时，以及用于输出由站间运输计算部计算出的运送计划的输出部。

6. 发明申请

US20130218627A1 ITERATIVE PATTERN GENERATION ALGORITHM FOR PLATE DESIGN PROBLEMS 有权
标题翻译：用于板设计问题的迭代模式生成算法
公开(公告)号：US20130218627A1
公开(公告)日：2013-08-22
申请号：US13822067
申请日：2011-09-13
申请人： Takayuki Yoshizumi
发明人： Takayuki Yoshizumi
IPC分类号： G06Q10/06
CPC分类号： G06Q10/043 , B21B37/00 , G05B19/4097 , G05B2219/35162 , G06Q10/06313 , G06Q10/06315
摘要： A method to generate a plurality of groups each including at least one of a plurality of elements. The method includes selecting at least one candidate element from the plurality of elements as a candidate to be included in a group, determining whether or not to generate the group including the at least one candidate element selected in the selecting step, based on an element evaluation value associated with each of the at least one candidate element selected in the selecting step, provided that a determination is made to generate the group in the determining step, generating the group including the at least one candidate element selected in the selecting step, and weighting the element evaluation value of each of the at least one element according to how many times the each element is included in already-generated groups to reflect the weighted element evaluation value in next group generation.
摘要翻译：一种生成多个组的方法，每个组包括多个要素中的至少一个。该方法包括从多个元素中选择至少一个候选元素作为要包括在组中的候选，基于元素评估来确定是否生成包括在选择步骤中选择的至少一个候选元素的组如果在确定步骤中确定生成组，则生成包括在选择步骤中选择的至少一个候选元素的组和加权的值，所述值与在选择步骤中选择的至少一个候选元素中的每一个相关联所述至少一个元素中的每一个元素的元素评估值根据已经生成的组中的每个元素的多少次来反映下一组生成中的加权元素评估值。

7. 发明申请

US20120078407A1 PROCESS SCHEDULING SYSTEM, METHOD, AND PROGRAM 有权
标题翻译：过程调度系统，方法和程序
公开(公告)号：US20120078407A1
公开(公告)日：2012-03-29
申请号：US13320406
申请日：2010-05-06
申请人： Toshiyuki Hama , Takayuki Yoshizumi
发明人： Toshiyuki Hama , Takayuki Yoshizumi
IPC分类号： G06F19/00
CPC分类号： B22D11/12 , B21B13/22 , B21B37/00 , B22D11/1206 , B22D11/142 , G05B19/41865 , G05B2219/32298 , G05B2219/32336 , Y02P90/20
摘要： System, method and computer program product for combined scheduling of two different slab sequences by a rational technique. A two-dimensional grid graph having a direct slab sequence as a first dimension and an inventory slab sequence as a second dimension is prepared by processing of a computer as a data structure represented on a memory or a hard disk drive of the computer. A processing program of the computer generates two child nodes corresponding to a direct slab and an inventory slab, in each node of the two-dimensional graph according to a predetermined algorithm. By defining an appropriate weighting function, the processing program of the computer weights edges between nodes in the two-dimensional grid graph. After forming the weighted graph on a storage device of the computer such as the memory or the hard disk drive, the processing program of the computer calculates a path from a start point to an end point as a shortest path search problem.
摘要翻译：通过合理的技术对两种不同板块序列进行组合调度的系统，方法和计算机程序产品。通过将计算机作为在计算机的存储器或硬盘驱动器上表示的数据结构的处理来制备具有作为第一维的直接平板序列和作为第二维的库存板序列的二维网格图。计算机的处理程序根据预定算法在二维图形的每个节点中生成对应于直接平板和库存板块的两个子节点。通过定义适当的加权函数，计算机的处理程序在二维网格图中的节点之间加权边缘。在诸如存储器或硬盘驱动器的计算机的存储设备上形成加权图之后，计算机的处理程序计算从起始点到终点的路径作为最短路径搜索问题。

8. 发明授权

US07890205B2 Technique for determining processing sequence of steel plates 失效
标题翻译：确定钢板加工顺序的技术
公开(公告)号：US07890205B2
公开(公告)日：2011-02-15
申请号：US12038019
申请日：2008-02-27
申请人： Toshiyuki Hama , Takayuki Yoshizumi
发明人： Toshiyuki Hama , Takayuki Yoshizumi
IPC分类号： G06F19/00
CPC分类号： B21B37/00
摘要： A system for determining a processing sequence of steel plates includes a constraint storage unit for storing positional constraints that define ranges of positions into which each type of steel plate is to be inserted when the steel plates are arranged in the processing sequence; a selecting unit for preferentially selecting, as a position into which a new steel plate is to be inserted in an array of steel plates already arranged in the processing sequence, a position having a larger expectation value of the number of steel plates that can be further inserted into the array of steel plates after the insertion of the new steel plate while satisfying the positional constraints; and an inserting unit for inserting the new steel plate into the selected position and for outputting data indicating the array of steel plates after the insertion.
摘要翻译：一种用于确定钢板的处理顺序的系统包括：约束存储单元，用于存储当以所述处理顺序排列所述钢板时限定要插入每种类型的钢板的位置范围的位置约束; 选择单元，用于优选地选择新的钢板插入到已经以处理顺序排列的钢板阵列中的位置，可以进一步选择具有较大钢板数量的期望值的位置在插入新钢板同时满足位置约束的情况下插入钢板阵列中; 以及插入单元，用于将新钢板插入所选择的位置，并用于在插入之后输出指示钢板阵列的数据。

9. 发明授权

US09409230B2 Process scheduling system, method, and program 有权
标题翻译：流程调度系统，方法和程序
公开(公告)号：US09409230B2
公开(公告)日：2016-08-09
申请号：US13320406
申请日：2010-05-06
申请人： Toshiyuki Hama , Takayuki Yoshizumi
发明人： Toshiyuki Hama , Takayuki Yoshizumi
IPC分类号： B22D11/12 , B21B37/00 , B21B13/22 , B22D11/14
CPC分类号： B22D11/12 , B21B13/22 , B21B37/00 , B22D11/1206 , B22D11/142 , G05B19/41865 , G05B2219/32298 , G05B2219/32336 , Y02P90/20
摘要： System, method and computer program product for combined scheduling of two different slab sequences by a rational technique. A two-dimensional grid graph having a direct slab sequence as a first dimension and an inventory slab sequence as a second dimension is prepared by processing of a computer as a data structure represented on a memory or a hard disk drive of the computer. A processing program of the computer generates two child nodes corresponding to a direct slab and an inventory slab, in each node of the two-dimensional graph according to a predetermined algorithm. By defining an appropriate weighting function, the processing program of the computer weights edges between nodes in the two-dimensional grid graph. After forming the weighted graph on a storage device of the computer such as the memory or the hard disk drive, the processing program of the computer calculates a path from a start point to an end point as a shortest path search problem.
摘要翻译：通过合理的技术对两种不同板块序列进行组合调度的系统，方法和计算机程序产品。通过将计算机作为在计算机的存储器或硬盘驱动器上表示的数据结构的处理来制备具有作为第一维的直接平板序列和作为第二维的库存板序列的二维网格图。计算机的处理程序根据预定算法在二维图形的每个节点中生成对应于直接平板和库存板块的两个子节点。通过定义适当的加权函数，计算机的处理程序在二维网格图中的节点之间加权边缘。在诸如存储器或硬盘驱动器的计算机的存储设备上形成加权图之后，计算机的处理程序计算从起始点到终点的路径作为最短路径搜索问题。

10. 发明授权

US07702410B2 Generation of schedule by which physical items to be manufactured are assigned into production slots via reducing non-zero factors within coefficient matrix clusters 有权
标题翻译：通过减少系数矩阵群中的非零因子，生成待制造物理物品的时间表被分配到生产槽中
公开(公告)号：US07702410B2
公开(公告)日：2010-04-20
申请号：US11875937
申请日：2007-10-21
申请人： Takayuki Yoshizumi
发明人： Takayuki Yoshizumi
IPC分类号： G05B15/02 , G06Q10/00
CPC分类号： G06Q10/04 , G06Q10/06 , G06Q10/06315
摘要： A schedule is generated by which physical items to be manufactured are assigned into production slots. The physical items have constraints governing manufacture of the physical items. The method generates coefficient matrix clusters from a mathematical programming problem based on an actual scheduling problem. Each coefficient matrix cluster defines a variable cluster-constraint cluster pair. A variable cluster of each coefficient matrix cluster defines production slot-physical item pairs. A constraint cluster of each coefficient matrix cluster defines a group of constraints. Each coefficient matrix cluster includes coefficient-binary variable pairs, each pair having a binary variable multiplied by a coefficient. For each coefficient matrix cluster, the method reduces non-zero factors within the cluster. Each non-zero factor within the coefficient matrix cluster is defined as a coefficient-binary variable pair such that the binary variable of the pair multiplied by the coefficient of the pair is non-zero. The schedule is then generated.
摘要翻译：产生一个时间表，通过哪个物理物品被分配到生产槽。物理物品对物理物品的制造有制约因素。该方法基于实际调度问题从数学规划问题生成系数矩阵群集。每个系数矩阵群定义了一个变量簇约束簇对。每个系数矩阵群的变量簇定义了生产槽 - 物理对。每个系数矩阵群的约束簇定义了一组约束。每个系数矩阵簇包括系数二进制可变对，每对具有乘以系数的二进制变量。对于每个系数矩阵群集，该方法减少群集内的非零因子。系数矩阵簇内的每个非零因子被定义为系数二进制可变对，使得该对乘以该对的系数的二进制变量不为零。然后生成计划。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式