
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Constraint programming (CP) is one of the most effe
ctive techniques for solving practical
operational problems. The outstanding feature of th
e method is a set of constraints affecting a
solution of a problem can be imposed without a need
to explicitly defining a linear relation
among variables, i.e. an equation. Nevertheless, th
e challenge of paramount importance in
using this technique is how to present the operatio
nal problem in a solvable Constraint
Satisfaction Problem (CSP) model. The problem model
ling is problem independent and could be
an exhaustive task at the beginning stage of proble
m solving, particularly when the problem is a
realworld practical problem. This paper investigat
es the application of a simple grid puzzle
game when a player attempts to solve a practical sc
heduling problem. The examination
scheduling is presented as an operational game. The
game‘s rules are set up based on the
operational practice. CP is then applied to solve t
he defined puzzle and the results show the
success of the proposed method. The benefit of usin
g a grid puzzle as the model is that the
method can amplify the simplicity of CP in solving
practical problems.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment