Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Antoon W. J. Kolen"'
Autor:
Antoon W. J. Kolen
Publikováno v:
Statistica Neerlandica. 61:4-15
We describe a genetic algorithm for the partial constraint satisfaction problem. The typical elements of a genetic algorithm, selection, mutation and cross-over, are filled in with combinatorial ideas. For instance, cross-over of two solutions is per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e4060bbb767f4e45e0146ab000c7a6a
https://doi.org/10.1111/j.1467-9574.2007.00357.x
https://doi.org/10.1111/j.1467-9574.2007.00357.x
Publikováno v:
Networks. 40:170-180
In this paper, we describe a computational study to solve hard partial constraint satisfaction problems (PCSPs) to optimality. The PCSP is a general class of problems that contains a diversity of problems, such as generalized subgraph problems, MAX-S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4856b11347f5c645aa1fc0e881ec2a6b
https://doi.org/10.1002/net.10046
https://doi.org/10.1002/net.10046
Publikováno v:
Journal of the Operational Research Society. 51:1238-1247
We consider a real-life cutting stock problem with two types of orders. All orders have to be cut from a given number of raws (also known as stock unit, master reel or jumbo). For each order the width of the final (also known as reels or units) and t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b0dc242425f3f6ea60b66d6675d2123
https://doi.org/10.1057/palgrave.jors.2601023
https://doi.org/10.1057/palgrave.jors.2601023
Publikováno v:
European Journal of Operational Research. 127:189-202
In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satisfied by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. We prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0175297d06027af2e4721d711ebc9408
https://doi.org/10.1016/s0377-2217(99)00340-9
https://doi.org/10.1016/s0377-2217(99)00340-9
Publikováno v:
Electronic Notes in Discrete Mathematics. 3:102-105
In this extended abstract we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b423d94c1d3325204bb3758ccfcbcd7
https://doi.org/10.1016/s1571-0653(05)80034-4
https://doi.org/10.1016/s1571-0653(05)80034-4
Autor:
Wil H.G.J. Hennen, Antoon W. J. Kolen
Publikováno v:
IFAC Proceedings Volumes. 28:79-83
The method and tool FUZZY-DETECTOR has been developed to enable fast and easy building of knowledge-based systems (rule-based) for domains where data are qualitative and uncertain. The method is based on the fuzzy set theory and membership functions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c939c00a006a16b978ee0495fcb530b6
https://doi.org/10.1016/s1474-6670(17)45544-3
https://doi.org/10.1016/s1474-6670(17)45544-3
Publikováno v:
Operations-Research-Spektrum. 16:193-202
Constraint-basierte Logikprogrammierung ist ein neues und auch fur das Operations Research vielversprechendes Gebiet der Kunstlichen Intelligenz. Eine logikorientierte Programmiersprache generiert zulassige Losungen eines Constraint-Satisfaction-Prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fcd8646262dccff07f50bfec2716b06
https://doi.org/10.1007/bf01720708
https://doi.org/10.1007/bf01720708
Autor:
Erwin Pesch, Antoon W. J. Kolen
Publikováno v:
Discrete Applied Mathematics. 48:273-284
The most common application of genetic algorithms to combinatorial optimization problems has been restricted to the traveling salesman problem. We review some of these ideas and present some new results, especially in the case that severe time constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbdd2e1f1aebaf30a0380269f4ba0cc0
https://doi.org/10.1016/0166-218x(92)00180-t
https://doi.org/10.1016/0166-218x(92)00180-t
Publikováno v:
Discrete Applied Mathematics, 55(2), 145-162. Elsevier
When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list is assumed here to be determin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70a5ed7ece77b2b8da88ecdfa03d6e0d
https://research.tue.nl/en/publications/7a4be145-1715-454d-99c1-fb27aaa5f344
https://research.tue.nl/en/publications/7a4be145-1715-454d-99c1-fb27aaa5f344
Autor:
Leo Kroon, Antoon W. J. Kolen
Publikováno v:
European Journal of Operational Research, 79(3), 417-430. Elsevier
In this paper we consider a generalization of the Fixed Job Schedule Problem (FJSP) which appears in the aircraft maintenance process at an airport. A number of jobs must be carried out where each job requires processing from a fixed time to a fixed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f51cce96871bee37e6a09eef7d105bb9
https://pure.eur.nl/en/publications/1e765990-0909-4ab1-8703-27b0ee95e49a
https://pure.eur.nl/en/publications/1e765990-0909-4ab1-8703-27b0ee95e49a