WO2016113308A1 - Système et procédé de génération d'itinéraire - Google Patents

Système et procédé de génération d'itinéraire Download PDF

Info

Publication number
WO2016113308A1
WO2016113308A1 PCT/EP2016/050573 EP2016050573W WO2016113308A1 WO 2016113308 A1 WO2016113308 A1 WO 2016113308A1 EP 2016050573 W EP2016050573 W EP 2016050573W WO 2016113308 A1 WO2016113308 A1 WO 2016113308A1
Authority
WO
WIPO (PCT)
Prior art keywords
route
rules
destination
origin
routes
Prior art date
Application number
PCT/EP2016/050573
Other languages
English (en)
Inventor
Alan Cracknell
Original Assignee
Sita Information Networking Computing Uk Limited
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sita Information Networking Computing Uk Limited filed Critical Sita Information Networking Computing Uk Limited
Publication of WO2016113308A1 publication Critical patent/WO2016113308A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Definitions

  • embodiments of the invention aim to avoid building rules on an
  • embodiments of the invention return available connections only if flights can be found that meet specific rules. Further, embodiments of the invention may use a number of leg count to sort travel options. For example, it may be useful to show direct non stop prior to direct stopping services. Thus, embodiments of the invention may differentiate between a connection which refers to transit between different flights on a given date, and a transfer between two hops on a route.
  • a number of different routes from origin Z to destination D may be determined. For example:
  • the process described above for the route from A to D can be carried out for routes from the other points of origin in the carrier network 10 to destination D or other destinations.
  • the results may be cached in a memory and may identify the best routes determined for a given origin and destination.
  • the results are shown in Table 1 :
  • the first route that is determined by the algorithm is usually the best. However, if that route is ignored, the algorithm may determine an alternative, for example, the next shortest route. Thus, the algorithm is efficient because it does not examine all paths, but rather a predetermined number of paths or k shortest paths.
  • embodiments of the invention determine the k shortest paths between a plurality of different origins and destinations. This has the advantage that it is not necessary to determine all of the possible paths between the origins and destinations.
  • the algorithm used by embodiments of the invention may loop through all different origins to all different destinations. For example, the algorithm may determine the k shortest paths from origin represented as AAA to destination represented as AAB. This 3- digit code, such as LHR, may represent an airport. The process may then be repeated from origin AAA to designation AAC and so on. This may be subject to one or more rules, described in further detail below.
  • the CB-RB request 40 may contain one or more of the following fields:
  • the inventory enquirer 406 determines flight connections.
  • the inventory enquirer 406 requests the flight connection builder 404 to determine connections for LHR to SYD on 21 March for airline XS.
  • the connection builder 404 requests routes from the route builder 402 for LHR to SYD as previously described.
  • routing airline code inclusions / exclusions to modify the flights included from a given airline when determining routings, metropolitan areas / cross city travel limitation to allow or deny connections into and out of different airports in a given city; back-haul permission to allow a connecting segment to increase the great- circle distance to the final destination, country return exclusion, for example, once a country has been left on a route, it cannot be re-entered, aircraft type inclusions / exclusions, maximum flight usage; and via city or airport inclusions / exclusions for connecting routes.
  • the system or method of clause 1 further comprising receiving means for receiving an availability request for a connection between the origin and destination wherein the availability request is associated with one or more carriers.
  • any preceding clause further comprising determining one or more flights, in particular BA143, for each hop in each routing based on one or more of time, time range, date, date range, and end to end journey time data such as minimum end to end journey time.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un système et un procédé de détermination d'itinéraire entre une origine et une destination dans un réseau de transporteurs comportant une pluralité de nœuds. Le système comprend un récepteur pour la réception d'une requête pour construire un itinéraire entre l'origine et la destination, la requête comprenant des données définissant l'origine et la destination; et un processeur configuré pour déterminer un ou plusieurs itinéraires entre l'origine et la destination par le biais d'un ou de plusieurs des nœuds, et pour déterminer une ou plusieurs règles d'itinéraires et pour sélectionner un ou plusieurs des itinéraires sur la base des règles d'itinéraires déterminées.
PCT/EP2016/050573 2015-01-14 2016-01-13 Système et procédé de génération d'itinéraire WO2016113308A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GBGB1500588.7A GB201500588D0 (en) 2015-01-14 2015-01-14 Dynamic routing and connections
GB1500588.7 2015-01-14

Publications (1)

Publication Number Publication Date
WO2016113308A1 true WO2016113308A1 (fr) 2016-07-21

Family

ID=52597593

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2016/050573 WO2016113308A1 (fr) 2015-01-14 2016-01-13 Système et procédé de génération d'itinéraire

Country Status (2)

Country Link
GB (1) GB201500588D0 (fr)
WO (1) WO2016113308A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11315067B2 (en) * 2016-10-17 2022-04-26 Airspace Technologies, Inc. Logistical management system
US11319089B2 (en) 2019-05-19 2022-05-03 Air Black Box Technologies Llc Managed connecting service for mass transit baggage

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002005109A2 (fr) * 2000-07-07 2002-01-17 Gf-X Operations Limited Procede, systeme informatique et reseau de systemes informatiques
WO2005019993A2 (fr) * 2003-08-11 2005-03-03 Fareportal, Inc. Procede et systeme de reservation d'itineraires aeriens et d'arrets en cours de voyage

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002005109A2 (fr) * 2000-07-07 2002-01-17 Gf-X Operations Limited Procede, systeme informatique et reseau de systemes informatiques
WO2005019993A2 (fr) * 2003-08-11 2005-03-03 Fareportal, Inc. Procede et systeme de reservation d'itineraires aeriens et d'arrets en cours de voyage

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11315067B2 (en) * 2016-10-17 2022-04-26 Airspace Technologies, Inc. Logistical management system
US11829925B2 (en) 2016-10-17 2023-11-28 Airspace Technologies, Inc. Logistical management system
US11319089B2 (en) 2019-05-19 2022-05-03 Air Black Box Technologies Llc Managed connecting service for mass transit baggage
US11866199B2 (en) 2019-05-19 2024-01-09 Air Black Box Technologies Llc Managed connecting service for mass transit baggage

Also Published As

Publication number Publication date
GB201500588D0 (en) 2015-02-25

Similar Documents

Publication Publication Date Title
EP3318985B1 (fr) Procédé et appareil de mise en correspondance d'itinéraires routiers et support de stockage
TWI735292B (zh) 一種為從源頭位置到目標位置的旅程提供路線的方法
US20200041291A1 (en) Multi-modal method of transportation routing
TW201341759A (zh) 將上下文與歷史資料整合至路線決定之技術
US20090276250A1 (en) Process and system to determine commercial airline arrivals
JP6777151B2 (ja) ルート探索方法及びルート探索装置
US20140188788A1 (en) Multi-modal journey planner
US20120130638A1 (en) Route guiding system, route guiding server, route guiding mediation server, and route guiding method
US11561105B2 (en) Optimized route planning for multiple travelers with the same destination
JP2013545078A (ja) ルート設計デジタル地図を最適化するための方法、システム、およびコンピュータ・プログラム製品
US10274329B2 (en) Method and apparatus for providing a minimum overlapping alternative path
US20140358603A1 (en) Iterative public transit scoring
JP2007114030A (ja) ナビゲーションシステム、携帯端末装置および経路探索サーバ
CN104636457B (zh) 一种位置搜索认知的方法及装置
CN111814070A (zh) 上车点的推荐方法、系统、存储介质及电子设备
CN105574597A (zh) 一种网络订票的实现方法及系统
Reyes-Rubiano et al. Exploration of a disrupted road network after a disaster with an online routing algorithm
WO2016113308A1 (fr) Système et procédé de génération d'itinéraire
Sadanandan et al. A smart transportation system facilitating on-demand bus and route allocation
DE102009056641A1 (de) Verfahren zur Routenbestimmung in einem System zur Vermittlung von Mitfahrgelegenheiten
Ayala et al. A mobile and interactive multiobjective urban tourist route planning system
CN112988933A (zh) 地址信息管理的方法和装置
KR102169109B1 (ko) 일정 추정을 통한 숙소 추천 서비스 제공 시스템 및 방법
EP3884442A1 (fr) Appareil serveur de communication, procédé et système de communication pour la gestion de demande de services liés au transport
KR102472406B1 (ko) Poi 정보 관리 장치 및 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16700573

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16700573

Country of ref document: EP

Kind code of ref document: A1