Processing

Please wait...

Settings

Settings

1. WO2020005600 - PLANNING FOR GOODS ALLOCATION

Publication Number WO/2020/005600
Publication Date 02.01.2020
International Application No. PCT/US2019/037409
International Filing Date 17.06.2019
IPC
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
Q
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
10
Administration; Management
06
Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
Q
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
30
Commerce, e.g. shopping or e-commerce
02
Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
Q
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
10
Administration; Management
04
Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
G06Q 10/06 (2012.01)
G06Q 30/02 (2012.01)
G06Q 10/04 (2012.01)
CPC
G06Q 10/04
G06Q 10/0631
G06Q 30/0205
Applicants
  • MICROSOFT TECHNOLOGY LICENSING, LLC [US/US]; One Microsoft Way Redmond, Washington 98052-6399, US
Inventors
  • MA, Weidong; US
  • YANG, Feidiao; US
  • BIAN, Jiang; US
  • LIU, Tie-Yan; US
Agents
  • MINHAS, Sandip S.; US
  • CHEN, Wei-Chen Nicholas; US
  • HINOJOSA, Brianna L.; US
  • HOLMES, Danielle J.; US
  • SWAIN, Cassandra T.; US
  • WONG, Thomas S.; US
  • CHOI, Daniel; US
  • HWANG, William C.; US
  • WIGHT, Stephen A.; US
  • CHATTERJEE, Aaron C.; US
  • JARDINE, John S.; US
  • GOLDSMITH, Micah P.; US
Priority Data
201810701086.929.06.2018CN
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) PLANNING FOR GOODS ALLOCATION
(FR) PLANIFICATION D'ATTRIBUTION DE MARCHANDISES
Abstract
(EN)
Attributes of sets of goods are determined, the attributes indicating amount of goods in respective sets of goods from the sets of goods, and goods in a set of goods from the sets of goods having a same origin and a same destination. A path of the sets of goods in a time-space network is determined based on the attributes of the sets of goods. The time-space network includes nodes indicating respective places at respective time points and sides connecting the nodes, the nodes comprising a starting node and a ending node corresponding to the origin and the destination and intermediate nodes between the starting node and the ending node. The path includes a subset of sides of the sides connecting the starting node and the ending node and represents planning for allocating the goods from the origin to the destination.
(FR)
Dans la présente invention, des attributs d'ensembles de marchandises sont déterminés, les attributs indiquant la quantité de marchandises dans des ensembles respectifs de marchandises provenant des ensembles de marchandises, et des marchandises dans un ensemble de marchandises provenant des ensembles de marchandises ayant la même origine et la même destination. Un trajet des ensembles de marchandises dans un réseau espace-temps est déterminé sur la base des attributs des ensembles de marchandises. Le réseau espace-temps comprend des nœuds indiquant des lieux respectifs à des instants respectifs, et des côtés reliant les nœuds, les nœuds comprenant un nœud de départ et un nœud de fin correspondant à l'origine et à la destination et des nœuds intermédiaires entre le nœud de départ et le nœud de fin. Le trajet comprend un sous-ensemble de côtés des côtés reliant le nœud de départ et le nœud de fin et représente une planification de l'attribution des marchandises de l'origine à la destination.
Latest bibliographic data on file with the International Bureau