Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai

Annamalai, Muthukkaruppan (2001) Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai. Jurnal Teknologi Maklumat dan Sains Kuantitatif, 3 (1). pp. 87-97. ISSN 1823-0822

Abstract

This paper studies a special kind of Constraint Satisfaction Problem (CSP) related to a case of resource allocation. It attempts to study the procedure of allocating a collection of resources to a group of contenders, in a satisfactory manner. In this study, we have modeled the CSP as a constraint graph. This allows us to device an augmented backtracking algorithm that could be employed to find a solution for this CSP. There are three important features of this algorithm that we would like to highlight here, namely I) minimally backtracking to resolve the constraint violation, II) making use of the information associated with a failed search to prune the search space and III) not repeating a computation. This algorithm was tested on the New Vehicle Sales System application (Mohd Zamri, 1998) and has been found to consistently produce the desired result.

Metadata

Item Type: Article
Creators:
Creators
Email / ID Num.
Annamalai, Muthukkaruppan
mk@tmsk.itm.edu.my
Subjects:
Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Programming. Rule-based programming. Backtrack programming
Divisions: Universiti Teknologi MARA, Shah Alam > Faculty of Computer and Mathematical Sciences
Journal or Publication Title: Jurnal Teknologi Maklumat dan Sains Kuantitatif
ISSN: 1823-0822
Volume: 3
Number: 1
Page Range: pp. 87-97
Keywords: Constraint satisfaction problem; Ordered intelligent graph; Intelligent backtracking
Date: 2001
URI: https://ir.uitm.edu.my/id/eprint/11640
Edit Item
Edit Item

Download

[thumbnail of AJ_MUTHUKKARUPPAN ANNAMALAI JTMSK 01 1.pdf] Text
AJ_MUTHUKKARUPPAN ANNAMALAI JTMSK 01 1.pdf

Download (625kB)

ID Number

11640

Indexing

|

Statistic

Statistic details