Representing pre-trip transit information as graph with constraints

This research explores the representation of pre-trip transit information as graph with constraints. The research is aimed at representing pre-trip transit information for flight travelers that is able to suggest a number of continuous travel destinations within a route to travelers. It applies maxi...

Full description

Saved in:
Bibliographic Details
Published in2011 National Postgraduate Conference pp. 1 - 6
Main Authors Yusof, S. Z. M., Asirvadam, V. S., Hassan, M. F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2011
Subjects
Constraints Satisfaction Problem
Graph Similarity
Graph theory
Graph-based Knowledge Representation
Knowledge representation
Mathematical model
Maximal Join
Merging
Planning
Transit Information Systems
Transportation
Online AccessGet full text

Cover

Abstract This research explores the representation of pre-trip transit information as graph with constraints. The research is aimed at representing pre-trip transit information for flight travelers that is able to suggest a number of continuous travel destinations within a route to travelers. It applies maximal join concept to merge multiple transit information network which is applied to centralize distributed travel destinations. Graph similarity concept is applied to determine transit node and alternative edges between two nodes. The research also applied Constraint Satisfaction Problems to produce only relevant information to travelers which suggest a destination series to them.
AbstractList This research explores the representation of pre-trip transit information as graph with constraints. The research is aimed at representing pre-trip transit information for flight travelers that is able to suggest a number of continuous travel destinations within a route to travelers. It applies maximal join concept to merge multiple transit information network which is applied to centralize distributed travel destinations. Graph similarity concept is applied to determine transit node and alternative edges between two nodes. The research also applied Constraint Satisfaction Problems to produce only relevant information to travelers which suggest a destination series to them.
Author Asirvadam, V. S.
Yusof, S. Z. M.
Hassan, M. F.
Author_xml – sequence: 1
  givenname: S. Z. M.
  surname: Yusof
  fullname: Yusof, S. Z. M.
  organization: Comput. & Inf. Sci. Dept., Univ. Teknol. Petronas, Tronoh, Malaysia
– sequence: 2
  givenname: V. S.
  surname: Asirvadam
  fullname: Asirvadam, V. S.
  organization: Electr. & Electron. Dept., Univ. Teknol. PETRONAS, Tronoh, Malaysia
– sequence: 3
  givenname: M. F.
  surname: Hassan
  fullname: Hassan, M. F.
  organization: Comput. & Inf. Sci. Dept., Univ. Teknol. Petronas, Tronoh, Malaysia
BookMark eNo1T81KxDAYjKigu_YF9JIX6JovafNzlKKrsKio9yVNvu5G3LQkAfHtLbjOZWZgmGEW5CyOEQm5BrYCYOb22ZbXbsUZwEqCkNyIE1IZpaFplQKtBTsli3_D2QWpcv5kM6RsGy4vSfeGU8KMsYS4o7OsSwoTLcnGHAoNcRjTwZYwRmoz3SU77el3KHvqxpjnVIglX5HzwX5lrI68JO8P9x_dY715WT91d5s6GFbqHrxutTFeSuDzOHgJDQxeOG7QKca89L3m_dB7p8E3TvWKOY-tNSgFF0ty89caEHE7pXCw6Wd7fC1-AUmQTnE
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/NatPC.2011.6136293
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781457718830
9781457718847
1457718847
1457718839
EndPage 6
ExternalDocumentID 6136293
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-b1d85899d66125421d6141fd3c29ec700d6db82bfbdc81d4c7b70cde5a9e6323
IEDL.DBID RIE
ISBN 1457718820
9781457718823
IngestDate Wed Jun 26 19:28:25 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-b1d85899d66125421d6141fd3c29ec700d6db82bfbdc81d4c7b70cde5a9e6323
PageCount 6
ParticipantIDs ieee_primary_6136293
PublicationCentury 2000
PublicationDate 2011-Sept.
PublicationDateYYYYMMDD 2011-09-01
PublicationDate_xml – month: 09
  year: 2011
  text: 2011-Sept.
PublicationDecade 2010
PublicationTitle 2011 National Postgraduate Conference
PublicationTitleAbbrev NatPC
PublicationYear 2011
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000665426
Score 1.5015416
Snippet This research explores the representation of pre-trip transit information as graph with constraints. The research is aimed at representing pre-trip transit...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Constraints Satisfaction Problem
Graph Similarity
Graph theory
Graph-based Knowledge Representation
Knowledge representation
Mathematical model
Maximal Join
Merging
Planning
Transit Information Systems
Transportation
Title Representing pre-trip transit information as graph with constraints
URI https://ieeexplore.ieee.org/document/6136293
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NawMhEJUkp57akpR-46HHbuJ-qOt5aQiFhNAPyC2sOkIoJKUxl_76Ou4mpaWH3tZFRBF84zjvPULuciitq5kLlxwrksLh-y7PbSJB1I5pJ1OObOTpTExei8cFX3TI_YELAwCx-AyG-Bnf8u3G7DBVNgrQIwI8dUlXKtFwtQ75lGijm4nI3eIynLgB2vaSTm0735NmmBrNaj-vGgXPdtQf9ioRXcbHZLqfV1NU8jbceT00n78kG_878RMy-Obx0fkBoU5JB9Z9Uj3F4leIFhEUq0B8ODioR9BaedoqqeJ-0XpLo6A1xWwtNRhKoqOE3w7I8_jhpZokrZVCslLMJzq1JQ83KyswoCmy1AZUTp3NTabASMbQVqrMtNPWhAC2MFJLZizwWoHIs_yM9NabNZwTyrPQPQQxUHJRCO5Urk3BrFEh1oBS1hekj8tfvjdaGct25Zd__74iR02OFmu2rknPf-zgJoC817dxd78A5qykDw
link.rule.ids 309,310,780,784,789,790,796,27925,54758
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwGP2Y86AnlU38bQ4e7ZY2Tdqeh2PqNoZO2G00yRcQYROXXfzrTdJuonjw1pZSUgJ5L1--9x7ADcNcm5Iat8nRIkqNP9_lTEcZitJQabKYezXyaCwGL-nDjM8acLvVwiBiaD7Djr8MZ_l6qda-VNZ10CMcPO3ALk8dz63UWtuKSgjSTURQb_HMrbkO3DamTvU928hmaNEdl3bSqzw86-_-CFgJ-NI_gNFmZFVbyVtnbWVHff4ybfzv0A-h_a3kI5MtRh1BAxct6D2F9lcMIRHE94FYt3QQ62Hr1ZLaS9XPGClXJFhaE1-vJcqTSZ8pYVdteO7fTXuDqA5TiF4LaiMZ65y7vZUWntKkSawdLsdGM5UUqDJKfbBUnkgjtXIUNlWZzKjSyMsCBUvYMTQXywWeAOGJe93RGMy5SAU3BZMqpVoVjm1gnpWn0PK_P3-v3DLm9Z-f_f34GvYG09FwPrwfP57DflWx9R1cF9C0H2u8dJBv5VWY6S--2qdi
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2011+National+Postgraduate+Conference&rft.atitle=Representing+pre-trip+transit+information+as+graph+with+constraints&rft.au=Yusof%2C+S.+Z.+M.&rft.au=Asirvadam%2C+V.+S.&rft.au=Hassan%2C+M.+F.&rft.date=2011-09-01&rft.pub=IEEE&rft.isbn=9781457718823&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FNatPC.2011.6136293&rft.externalDocID=6136293
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781457718823/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781457718823/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781457718823/sc.gif&client=summon&freeimage=true