Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020193334 - EFFICIENT ROUTING

Publication Number WO/2020/193334
Publication Date 01.10.2020
International Application No. PCT/EP2020/057534
International Filing Date 18.03.2020
IPC
G06Q 10/04 2012.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
QDATA 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
10Administration; Management
04Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
G06Q 10/06 2012.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
QDATA 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
10Administration; Management
06Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
CPC
G06Q 10/047
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
QDATA 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
10Administration; Management
04Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
047Optimisation of routes, e.g. "travelling salesman problem"
G06Q 10/0631
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
QDATA 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
10Administration; Management
06Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
063Operations research or analysis
0631Resource planning, allocation or scheduling for a business operation
Applicants
  • BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY [GB]/[GB]
Inventors
  • GLOVER, Timothy
  • MCCORMICK, Alistair
  • STARKEY, Andrew
  • CONWAY, Anthony
Agents
  • BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY, INTELLECTUAL PROPERTY DEPARTMENT
Priority Data
19164781.723.03.2019EP
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) EFFICIENT ROUTING
(FR) ROUTAGE EFFICIENT
Abstract
(EN)
A computer implemented method of routing a plurality of resource carriers to exchange resources at a plurality of resource exchange points, each resource carrier having a capacity for holding a quantity of a resource such that at least two carriers have different capacities, and each resource exchange point having a geo-location in a space, the method comprising: iterating a genetic algorithm modelling usage of proper subsets of the resource carriers, the genetic algorithm having at least one stopping condition based on a characteristic of the subset indicative of a cost of the subset, wherein, for each iteration of the genetic algorithm, the method further comprises: a) defining, for each resource carrier in the subset, a set of resource exchange points for the carrier based on geo-locations of the exchange points, an objective exchange point for the carrier, and the capacity of the carrier, the objective exchange point being an exchange point that the carrier must visit; b) evaluating the characteristic for the subset of carriers; and c) responsive to the evaluated characteristic, selecting the subset as a prospective optimal subset and determining, for each carrier in the prospective optimal subset, an optimum route through the set of resource exchange points for the carrier including the objective exchange point, wherein the prospective optimal subset is selected over multiple iterations of the genetic algorithm such that, on termination of the genetic algorithm, a current prospective optimal subset is selected as an optimal subset of carriers having associated an optimum route for each carrier in the optimal subset.
(FR)
L'invention concerne un procédé, mis en œuvre par ordinateur, de routage d'une pluralité de supports de ressources pour échanger des ressources en une pluralité de points d'échange de ressources, chaque support de ressources ayant la capacité de contenir une certaine quantité d'une ressource de telle façon qu'au moins deux supports présentent des capacités différentes, et chaque point d'échange de ressources possédant une géolocalisation dans un espace, le procédé comportant les étapes consistant à: itérer sur un algorithme génétique modélisant l'utilisation de sous-ensembles propres des supports de ressources, l'algorithme génétique possédant au moins une condition d'arrêt basée sur une caractéristique du sous-ensemble indicative d'un coût du sous-ensemble, le procédé comportant en outre, pour chaque itération de l'algorithme génétique, les étapes consistant à: a) définir, pour chaque support de ressources dans le sous-ensemble, un ensemble de points d'échange de ressources pour le support d'après des géolocalisations des points d'échange, un point d'échange d'objectif pour le support, et la capacité du support, le point d'échange d'objectif étant un point d'échange que le support doit visiter; b) évaluer la caractéristique pour le sous-ensemble de supports; et c) en réaction à la caractéristique évaluée, sélectionner le sous-ensemble en tant que sous-ensemble optimal potentiel et déterminer, pour chaque support dans le sous-ensemble optimal potentiel, un itinéraire optimal à travers l'ensemble de points d'échange de ressources pour le support incluant le point d'échange d'objectif, le sous-ensemble optimal potentiel étant sélectionné au fil d'itérations multiples de l'algorithme génétique de telle façon que, suite à l'arrêt de l'algorithme génétique, un sous-ensemble optimal potentiel actuel soit sélectionné en tant que sous-ensemble optimal de supports auquel est associé un itinéraire optimal pour chaque support dans le sous-ensemble optimal.
Latest bibliographic data on file with the International Bureau