An overview of a constraint solving engine with multiple optimization algorithms

被引：0

作者：

Jolevski, I ^{[1
]}

Loskovska, S ^{[1
]}

Chorbev, I ^{[1
]}

Mihajlov, D ^{[1
]}

机构：

[1] Fac Elect Engn, Skopje 1000, Macedonia

来源：

ITI 2005: Proceedings of the 27th International Conference on Information Technology Interfaces | 2005年

关键词：

constraints; heuristic; CSP; constraint satisfaction; traveling salesman; simulated annealing;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This article is concerned with the classes of the Constraint Solving Engine and a Constraint Programming Library for problems that can be defined as Constraint Satisfaction Problems. The theoretical and mathematical foundations of our ideas and the problem solving process are explained Among the first problems that were solved was the Traveling Salesman Problem (TSP). The results and conclusions for TSP solution are given in the closing part of the paper.

引用

页码：637 / 643

页数：7