Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai
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 g...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Fakulti Teknologi Maklumat dan Sains Kuantitatif
2001
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/11640/ |
| _version_ | 1848803032153718784 |
|---|---|
| author | Annamalai, Muthukkaruppan |
| author_facet | Annamalai, Muthukkaruppan |
| author_sort | Annamalai, Muthukkaruppan |
| building | UiTM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T21:32:47Z |
| format | Article |
| id | uitm-11640 |
| institution | Universiti Teknologi MARA |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T21:32:47Z |
| publishDate | 2001 |
| publisher | Fakulti Teknologi Maklumat dan Sains Kuantitatif |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | uitm-116402016-09-26T05:19:19Z https://ir.uitm.edu.my/id/eprint/11640/ Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai Annamalai, Muthukkaruppan Programming. Rule-based programming. Backtrack programming 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. Fakulti Teknologi Maklumat dan Sains Kuantitatif 2001 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/11640/1/AJ_MUTHUKKARUPPAN%20ANNAMALAI%20JTMSK%2001%201.pdf Annamalai, Muthukkaruppan (2001) Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai. (2001) Jurnal Teknologi Maklumat dan Sains Kuantitatif <https://ir.uitm.edu.my/view/publication/Jurnal_Teknologi_Maklumat_dan_Sains_Kuantitatif.html>, 3 (1). pp. 87-97. ISSN 1823-0822 |
| spellingShingle | Programming. Rule-based programming. Backtrack programming Annamalai, Muthukkaruppan Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai |
| title | Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai |
| title_full | Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai |
| title_fullStr | Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai |
| title_full_unstemmed | Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai |
| title_short | Solving a backtracking intelligently : a case study / Muthukkaruppan Annamalai |
| title_sort | solving a backtracking intelligently : a case study / muthukkaruppan annamalai |
| topic | Programming. Rule-based programming. Backtrack programming |
| url | https://ir.uitm.edu.my/id/eprint/11640/ |