Open AccessUsing Heuristic-based Search for Zinc Models
Author(s) -
Reza Rafeh,
Roya Rashidi
Publication year - 2013
Publication title -
international journal of intelligent systems and applications
Language(s) - English
Resource type - Journals
eISSN - 2074-9058
pISSN - 2074-904X
DOI - 10.5815/ijisa.2013.10.02
Subject(s) - computer science , backtracking , beam search , set (abstract data type) , search algorithm , heuristic , beam stack search , incremental heuristic search , local search (optimization) , theoretical computer science , guided local search , programming language , artificial intelligence
The Zinc modelling language provides a rich set of constraints, data structures and expressions to support high-level modelling. Zinc is the only modelling language that supports all solving techniques: constraint programming, mathematical methods, and local search. By providing search patterns, it allows users to implement their search methods in a declarative way. There are currently three search patterns implemented in Zinc: backtracking search, branch and bound search, and local search. In this paper we explain how Zinc efficiently implements user-defined local search algorithms
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom