-
公开(公告)号：US10922613B2
公开(公告)日：2021-02-16
申请号：US16593862
申请日：2019-10-04
摘要： A method, system and computer program product for generating a solution to an optimization problem. A received structured set of data is analyzed with the prescriptive domains to identify one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms. A user selection of one of the presented possible prescriptive intentions from the intention templates in the identified one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms is received. A prescriptive model is then generated from the prescriptive domain containing the selected prescriptive intention. The prescriptive model is translated into a technical prescriptive model using a set of mapping rules. Furthermore, the technical prescriptive model is translated into an optimization model. The optimization model is solved and an output defining a solution from the solved optimization model is presented.
-
公开(公告)号：US10521721B2
公开(公告)日：2019-12-31
申请号：US15223120
申请日：2016-07-29
摘要： A method, system and computer program product for generating a solution to an optimization problem. A received structured set of data is analyzed with the prescriptive domains to identify one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms. A user selection of one of the presented possible prescriptive intentions from the intention templates in the identified one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms is received. A prescriptive model is then generated from the prescriptive domain containing the selected prescriptive intention. The prescriptive model is translated into a technical prescriptive model using a set of mapping rules. Furthermore, the technical prescriptive model is translated into an optimization model. The optimization model is solved and an output defining a solution from the solved optimization model is presented.
-
公开(公告)号：US20170293871A1
公开(公告)日：2017-10-12
申请号：US15218283
申请日：2016-07-25
发明人： Xavier Ceugniet , Alain Chabrier , Stephane Michel
CPC分类号： G06Q10/067 , G06F17/2881 , G06N5/045
摘要： A method, system and computer program product for generating an optimization model. A prescriptive model including a structured set of data and instance(s) of templates of a technical and/or business prescriptive domain is received, where the instances of the templates define goals and/or constraints for the structured set of data. The business prescriptive domain extends the technical prescriptive domain defining a generic optimization problem and the business prescriptive domain defines a more specific business problem. The prescriptive model is translated into a technical prescriptive model using a set of mapping rules to translate the instance(s) of the templates of the business prescriptive domain into instance(s) of the templates of the technical prescriptive domain from which the business prescriptive domain extends. Furthermore, the technical prescriptive model is translated into an optimization model, where the optimization model is solved. An output defining a solution from the solved optimization model is then presented.
-
公开(公告)号：US20230161629A1
公开(公告)日：2023-05-25
申请号：US17534385
申请日：2021-11-23
发明人： Surya Shravan Kumar Sajja , Kanthi Sarpatwar , Lam Minh Nguyen , Yuan Yuan Jia , Stephane Michel , Roman Vaculin
CPC分类号： G06F9/5038 , G06F9/5088 , G06N7/005 , G06F9/5033 , G06F2209/504 , G06F2209/508
摘要： A computer implemented method using an artificial intelligence (A.I.) module to explain large scale scheduling solutions includes receiving an original instance of a resource constrained scheduling problem. The instance includes a set of tasks and a variety of resource requirements and a variety of constraints. An optimizer process determines a schedule for the set of tasks while minimizing a makespan of the schedule. A minimal set of resource links is generated based on resource dependencies between tasks. The resource links are added to the original instance of scheduling problem, as precedence constraints. All the resource constraints are removed from the original instance of the resource constrained scheduling problem. A set of critical tasks is computed using a non-resource constrained critical path. Schedules are provided with an explanation of an optimized order of the set of tasks based on the use of the non-resource constrained critical path.
-
公开(公告)号：US20210103825A1
公开(公告)日：2021-04-08
申请号：US17125817
申请日：2020-12-17
摘要： A method, system and computer program product for generating a solution to an optimization problem. A received structured set of data is analyzed with the prescriptive domains to identify one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms. A user selection of one of the presented possible prescriptive intentions from the intention templates in the identified one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms is received. A prescriptive model is then generated from the prescriptive domain containing the selected prescriptive intention. The prescriptive model is translated into a technical prescriptive model using a set of mapping rules. Furthermore, the technical prescriptive model is translated into an optimization model. The optimization model is solved and an output defining a solution from the solved optimization model is presented.
-
公开(公告)号：US11132634B2
公开(公告)日：2021-09-28
申请号：US15218221
申请日：2016-07-25
发明人： Xavier Ceugniet , Alain Chabrier , Stephane Michel
摘要： A method, system and computer program product for operating an expert system. Technical prescriptive domains and business prescriptive domains containing one or more templates are accessed, where each template defines an intention, goal or constraint. Furthermore, each technical prescriptive domain defines a generic optimization problem and each business prescriptive domain extends a technical prescriptive domain and defines a more specific business problem. A structure of data is received and analyzed with the technical prescriptive domains and business prescriptive domains to identify technical and/or business prescriptive domains that match the received structure set of data in data structure and/or semantic terms. A prescriptive model from the technical or business prescriptive domain containing a selected prescriptive intention from the intention templates in the identified technical and/or business prescriptive domains that match the received structure set of data in data structure and/or semantic terms is then generated.
-
公开(公告)号：US20200034717A1
公开(公告)日：2020-01-30
申请号：US16593862
申请日：2019-10-04
摘要： A method, system and computer program product for generating a solution to an optimization problem. A received structured set of data is analyzed with the prescriptive domains to identify one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms. A user selection of one of the presented possible prescriptive intentions from the intention templates in the identified one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms is received. A prescriptive model is then generated from the prescriptive domain containing the selected prescriptive intention. The prescriptive model is translated into a technical prescriptive model using a set of mapping rules. Furthermore, the technical prescriptive model is translated into an optimization model. The optimization model is solved and an output defining a solution from the solved optimization model is presented.
-
公开(公告)号：US10387823B2
公开(公告)日：2019-08-20
申请号：US13709517
申请日：2012-12-10
发明人： Amelie Hocquette , Viu-Long Kong , Stephane Michel
IPC分类号： G06Q10/08
摘要： Method and system are provided for automated partitioning of transportation routing problems. The method includes: determining a threshold number of shipments per partition; selecting a geographic center; mapping delivery and/or pickup sites at geographic locations; scanning radially around the geographic center to determine the sparsest or densest region of sites and selecting a starting point in this region; and progressing from the starting point radially around the geographic center aggregating sites into partitions with a maximum of the threshold number of shipments in a partition. The method may include: solving each partitioned instance of a problem to generate one or more optimized routes; and creating a union of all the instances solutions.
-
公开(公告)号：US20170293840A1
公开(公告)日：2017-10-12
申请号：US15223120
申请日：2016-07-29
CPC分类号： G06N5/003 , G06Q30/0201
摘要： A method, system and computer program product for generating a solution to an optimization problem. A received structured set of data is analyzed with the prescriptive domains to identify one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms. A user selection of one of the presented possible prescriptive intentions from the intention templates in the identified one or more prescriptive domains that match the received structure set of data in data structure and/or semantic terms is received. A prescriptive model is then generated from the prescriptive domain containing the selected prescriptive intention. The prescriptive model is translated into a technical prescriptive model using a set of mapping rules. Furthermore, the technical prescriptive model is translated into an optimization model. The optimization model is solved and an output defining a solution from the solved optimization model is presented.
-
公开(公告)号：US20130151435A1
公开(公告)日：2013-06-13
申请号：US13709517
申请日：2012-12-10
发明人： Amelie Hocquette , Viu-Long Kong , Stephane Michel
IPC分类号： G06Q10/08
CPC分类号： G06Q10/08355 , G06Q10/083
摘要： Method and system are provided for automated partitioning of transportation routing problems. The method includes: determining a threshold number of shipments per partition; selecting a geographic centre; mapping delivery and/or pickup sites at geographic locations;scanning radially around the geographic centre to determine the sparsest or densest region of sites and selecting a starting point in this region; and progressing from the starting point radially around the geographic centre aggregating sites into partitions with a maximum of the threshold number of shipments in a partition. The method may include: solving each partitioned instance of a problem to generate one or more optimized routes; and creating a union of all the instances solutions.
摘要翻译： 提供方法和系统用于自动划分运输路线问题。 该方法包括：确定每个分区的出货阈值数量; 选择地理中心; 在地理位置映射传送和/或传送站点; 围绕地理中心径向扫描，以确定最稀疏或最密集的地点，并选择该地区的起点; 并且从地理中心聚集站点的径向起始点进入具有分区中最大出货量的最大值的分区。 该方法可以包括：解决问题的每个分割实例以生成一个或多个优化的路由; 并创建所有实例解决方案的联合。
-
-
-
-
-
-
-
-
-
搜索结果
12 条记录 (耗时 0.05 秒)
