A parallel logic programming approach to combinatorial optimization in design

Authors:
Jim Butler;Hideomi Ohtsubo
Affiliations:
Faculty of Engineering, University of Tokyo;Faculty of Engineering, University of Tokyo
Venue:
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Year:
1990

Citing 3
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Guarded horn clauses

Concurrent Prolog
Fair, biased, and self-balancing merge operators: their specification and implementation in Concurrent Prolog

Concurrent Prolog

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to the solution of combinatorial optimization problems using parallel logic programming is presented. The solution space is divided with a separate process (worker process) assigned to search each subspace. In order to have information regarding the most recent optimal combination available to all worker processes, a tree of manager processes is established to relay discoveries at a given worker process to other worker processes. The performance of this method is tested through the application to a structural design problem. The execution time was measured while varying the number of processors and super-linear speed-up was attained.