Flight connections multi-leg searching by adopting Partial Constraint Satisfaction

This research explores the development of flight connections multi-leg searching. It applies the concept of graph theory and Partial Constraint Satisfaction Problem (Partial CSP). Current practices of information retrieval for flight connections usually provide the users with only one-leg of network...

Full description

Saved in:
Bibliographic Details
Published in2010 International Symposium on Information Technology Vol. 1; pp. 1 - 4
Main Authors Yusof, Siti Zarinah Mohd, Asirvadam, Vijanth Sagayan, Hassan, Mohd Fadzil
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Artificial intelligence
Constraint Satisfaction Problem (CSP)
Fires
Graph theory
Industries
Itinerary
Leg
Partial Constraint Satisfaction (Partial CSP)
Planning
Prototypes
Online AccessGet full text

Cover

More Information
Summary:This research explores the development of flight connections multi-leg searching. It applies the concept of graph theory and Partial Constraint Satisfaction Problem (Partial CSP). Current practices of information retrieval for flight connections usually provide the users with only one-leg of network which restricts the scope of information that users could retrieve in planning their flight itinerary. This research is aimed at developing a flight connections searching system that is able to give suggestion to users of broader destination network for their itinerary. The suggested destinations are selected based on Partial CSP technique. Instead of using Constraint Satisfaction technique, Partial CSP has been proposed to be implemented in this research as its approach could solve over-constrained problem. A web-based prototype has been developed to explain the concept of multi-leg searching. The development will be continued by adopting Partial CSP in future works.
ISBN:1424467152
9781424467150
ISSN:2155-8973
DOI:10.1109/ITSIM.2010.5561360