A UML-based Solver Tool for Combinatorial Problems

Résumé du livre

With the increasing of intelligent software requirements, constraint programming has attracted high attention from many areas because of its potential for solving real-life combinatorial problems. Today, users need to solve more complex combinatorial problems with more intelligent solving techniques. A more challenging task is the description of combinatorial problems. In fact, we extend an existing specification language, called OCL (Object Constraint Language), to facilitate the descriptions of complex constraints of combinatorial problems. Therefore, in this thesis, we propose a novel tool to assist end-users in specifying and solving their combinatorial problems. The tool provides generic OCL-based templates that can be customized to describe any combinatorial problem. From the combinatorial problem description, the proposed tool automatically generates the corresponding constraint network composed of a constraint graph and solutions.