TY  - CONF
AV  - none
CY  - Kuala Lumpur
TI  - Flight connections multi-leg searching by adopting partial Constraint Satisfaction
ID  - scholars1081
KW  - Constraint Satisfaction Problems; Constraint satisfaction techniques; Current practices; Destination network; Itinerary; Over-constrained problem; Partial constraint satisfaction; Searching systems; Web-based prototype
KW  -  Graph theory; Information technology; Research
KW  -  Constraint theory
N2  - 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. © 2010 IEEE.
N1  - cited By 2; Conference of 2010 International Symposium on Information Technology, ITSim'10 ; Conference Date: 15 June 2010 Through 17 June 2010; Conference Code:81915
SN  - 9781424467181
Y1  - 2010///
VL  - 1
A1  - Yusof, S.Z.M.
A1  - Asirvadam, V.S.
A1  - Hassan, M.F.
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-78049387815&doi=10.1109%2fITSIM.2010.5561360&partnerID=40&md5=634a495f38a0828f76d8561fff0e0e9a
ER  -