TIMETABLE-CONSTRUCTION WITH MARKOVIAN NEURAL-NETWORK

被引：28

作者：

KOVACIC, M

机构：

[1] Faculty of Electrical and Computer Engineering, University of Ljubljana, 61000 Ljubljana

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 69卷 / 01期

关键词：

MARKOV PROCESSES; SCHEDULING; OPTIMIZATION; NETWORKS;

D O I：

10.1016/0377-2217(93)90094-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A neural network which efficiently and nearly optimally solves combinatorial optimization problems was applied to the timetable problem. The network was tested on a real-world timetable problem. The results indicate that the Markovian neural network is an efficient and flexible tool for solving real-world combinatorial optimization problems such as construction of a timetable for high schools.

引用

页码：92 / 96

页数：5

共 6 条

[1] THE N-CITY TRAVELING SALESMAN PROBLEM - STATISTICAL-MECHANICS AND THE METROPOLIS ALGORITHM [J].