Synthesis of Mathematical Programming Constraints with Genetic Programming
[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] pracownik
2017
rozdział w monografii naukowej / referat
angielski
- linear programming
- constraint acquisition
- business process
EN We identify a novel application of Genetic Programming to automatic synthesis of mathematical programming (MP) models for business processes. Given a set of examples of states of a business process, the proposed Genetic Constraint Synthesis (GenetiCS) method constructs well-formed constraints for an MP model. The form of synthesized constraints (e.g., linear or polynomial) can be chosen accordingly to the nature of the process and the desired type of MP problem. In experimental part, we verify syntactic and semantic fidelity of the synthesized models to the actual benchmark models of varying complexity. The obtained symbolic models of constraints can be combined with an objective function of choice, fed into an off-shelf MP solver, and optimized.
15.03.2017
178 - 193
20
70
WoS (15)