Heuristically guided bi-directional search in real-time for solving problems of discrete optimization (Record no. 4936)

MARC details
000 -LEADER
fixed length control field 02187nam a22001697a 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220107122808.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 160301b xxu||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Transcribing agency
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Karthik Manogaran (92213006)
9 (RLIN) 8303
245 ## - TITLE STATEMENT
Title Heuristically guided bi-directional search in real-time for solving problems of discrete optimization
502 ## - DISSERTATION NOTE
Degree type Master of Science in Computational Science
Name of granting institution 2013-2015
Year degree granted EXT
-- T.K Manoj Kumar
-- Ambuj Mahanti (MIS Group)<br/>
Miscellaneous information "Indian Institute Of Management, Calcutta"
520 ## - SUMMARY, ETC.
Summary, etc. For very long time, searching techniques such as A* and IDA* have been used extensively. Search algorithms are widely used in real world problems like Combinatorial Auctions, Flow Shop Scheduling, Robot Navigation, etc. All these applications of heuristic search require optimal solutions. As such, the search technique should be very efficient. The Sliding Tiles Problem of 15-Puzzle has been used as a test-bed for a long time. These algorithms work fine for problems like 15-puzzle problem. However, the standard heuristic that is used for these algorithms the Manhatan heuristic is not the best possible heuristic as it does not account for interaction of tiles. While it would be impossible to account for all tile interactions the Disjoint Additive Pattern Database Heuristic provides us with a better heuristic than Manhattan thereby reducing the number of nodes explored for finding solution.This could be of particular effect on larger instances of the n-puzzle, such as 24-puzzle problem where standard algorithms have proved to be unsuccessful. A*requires huge amount of memory, while IDA* requires huge amount of time.<br/>In this project, a modified version of Bidirectional search has been taken into consid-eration which gives near optimal solution using less time and space. The performance of this search has been compared with the performance of IDA* search. We have taken 15-puzzle into consideration along with Additive Pattern Database heuristic. We have also used a Block depth first search method to find near optimal results for 24-puzzle problems.<br/>
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element THEORY OF COMPUTATION
9 (RLIN) 8304
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element LOGIC
9 (RLIN) 8305
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Total Checkouts Barcode Date last seen Price effective from Koha item type
    Dewey Decimal Classification     IIITM-K Kerala University of Digital Sciences, Innovation and Technology Knowledge Centre 01/03/2016   R-653 01/03/2016 01/03/2016 Project Reports