Smart approach to constraint programming: intelligent backtracking using artificial intelligence Online publication date: Mon, 01-Jul-2024
by Heng Du
International Journal of Internet Protocol Technology (IJIPT), Vol. 16, No. 4, 2023
Abstract: Constrained programming is the concept used to select possible alternatives from an incredibly diverse range of candidates. This paper proposes an AI-assisted Backtracking Scheme (AI-BS) by integrating the generic backtracking algorithm with Artificial Intelligence (AI). The detailed study observes that the extreme dual ray associated with the infeasible linear program can be automatically extracted from minimum unfeasible sets. Constraints are used in artificial intelligence to list all possible values for a group of variables in a given universe. To put it another way, a solution is a way of assigning a value to each variable that these values satisfy all constraints. Furthermore, this helps the study reach a decreased search area for smart backtracking without paying high costs. The evaluation results exhibit that the IB-BC algorithm-based smart electricity schedule controller performs better electricity bill during the scheduled periods than comparison approaches such as binary backtracking and binary particle swarm optimiser.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook