A parallel algorithm for solving unfriendly beehive problems

J. D. Rofkar, Yoshiyasu Takefuji

Research output: Contribution to journalArticle

Abstract

This paper presents a general purpose algorithm for solving the Unfriendly Beehive Game. The proposed algorithm will utilize an artificial neural network to solve the problem. The neural network will use a simple partial differential (motion) equation expressed in terms of its natural constraints. Each constraint within the equation represents a simple connection to an artificial neuron. Each connection strength (or synaptic strength) is weighted by multiplicative constants and summed together. The result is an input that is adjusted in the direction that decreases the error or conflict. Using this information, the system derives a simple binary state output in an attempt to solve the puzzle. Given an overall time slot in which to resolve all conflicts, the system iteratively strives to arrive at the state of the global minimum. The proposed algorithm will be able to solve a variety of real-world problems, including: facility layouts for maximizing productivity and safety, classroom assignment for minimizing pupil conflict, crop and plant placement for maximizing yields, and chemical placement within shipping boxes to reduce the possibility of chemical interactions.

Original languageEnglish
Pages (from-to)167-179
Number of pages13
JournalNeurocomputing
Volume4
Issue number3-4
DOIs
Publication statusPublished - 1992
Externally publishedYes

Fingerprint

Parallel algorithms
Neural networks
Pupil
Freight transportation
Information Systems
Neurons
Crops
Equations of motion
Productivity
Safety

Keywords

  • combinatorial optimization
  • Parallel algorithm
  • Unfriendly Beehive Problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Cellular and Molecular Neuroscience

Cite this

A parallel algorithm for solving unfriendly beehive problems. / Rofkar, J. D.; Takefuji, Yoshiyasu.

In: Neurocomputing, Vol. 4, No. 3-4, 1992, p. 167-179.

Research output: Contribution to journalArticle

@article{697aa13469564a4bb4b306b00292a837,
title = "A parallel algorithm for solving unfriendly beehive problems",
abstract = "This paper presents a general purpose algorithm for solving the Unfriendly Beehive Game. The proposed algorithm will utilize an artificial neural network to solve the problem. The neural network will use a simple partial differential (motion) equation expressed in terms of its natural constraints. Each constraint within the equation represents a simple connection to an artificial neuron. Each connection strength (or synaptic strength) is weighted by multiplicative constants and summed together. The result is an input that is adjusted in the direction that decreases the error or conflict. Using this information, the system derives a simple binary state output in an attempt to solve the puzzle. Given an overall time slot in which to resolve all conflicts, the system iteratively strives to arrive at the state of the global minimum. The proposed algorithm will be able to solve a variety of real-world problems, including: facility layouts for maximizing productivity and safety, classroom assignment for minimizing pupil conflict, crop and plant placement for maximizing yields, and chemical placement within shipping boxes to reduce the possibility of chemical interactions.",
keywords = "combinatorial optimization, Parallel algorithm, Unfriendly Beehive Problem",
author = "Rofkar, {J. D.} and Yoshiyasu Takefuji",
year = "1992",
doi = "10.1016/0925-2312(92)90006-B",
language = "English",
volume = "4",
pages = "167--179",
journal = "Neurocomputing",
issn = "0925-2312",
publisher = "Elsevier",
number = "3-4",

}

TY - JOUR

T1 - A parallel algorithm for solving unfriendly beehive problems

AU - Rofkar, J. D.

AU - Takefuji, Yoshiyasu

PY - 1992

Y1 - 1992

N2 - This paper presents a general purpose algorithm for solving the Unfriendly Beehive Game. The proposed algorithm will utilize an artificial neural network to solve the problem. The neural network will use a simple partial differential (motion) equation expressed in terms of its natural constraints. Each constraint within the equation represents a simple connection to an artificial neuron. Each connection strength (or synaptic strength) is weighted by multiplicative constants and summed together. The result is an input that is adjusted in the direction that decreases the error or conflict. Using this information, the system derives a simple binary state output in an attempt to solve the puzzle. Given an overall time slot in which to resolve all conflicts, the system iteratively strives to arrive at the state of the global minimum. The proposed algorithm will be able to solve a variety of real-world problems, including: facility layouts for maximizing productivity and safety, classroom assignment for minimizing pupil conflict, crop and plant placement for maximizing yields, and chemical placement within shipping boxes to reduce the possibility of chemical interactions.

AB - This paper presents a general purpose algorithm for solving the Unfriendly Beehive Game. The proposed algorithm will utilize an artificial neural network to solve the problem. The neural network will use a simple partial differential (motion) equation expressed in terms of its natural constraints. Each constraint within the equation represents a simple connection to an artificial neuron. Each connection strength (or synaptic strength) is weighted by multiplicative constants and summed together. The result is an input that is adjusted in the direction that decreases the error or conflict. Using this information, the system derives a simple binary state output in an attempt to solve the puzzle. Given an overall time slot in which to resolve all conflicts, the system iteratively strives to arrive at the state of the global minimum. The proposed algorithm will be able to solve a variety of real-world problems, including: facility layouts for maximizing productivity and safety, classroom assignment for minimizing pupil conflict, crop and plant placement for maximizing yields, and chemical placement within shipping boxes to reduce the possibility of chemical interactions.

KW - combinatorial optimization

KW - Parallel algorithm

KW - Unfriendly Beehive Problem

UR - http://www.scopus.com/inward/record.url?scp=0026869971&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026869971&partnerID=8YFLogxK

U2 - 10.1016/0925-2312(92)90006-B

DO - 10.1016/0925-2312(92)90006-B

M3 - Article

AN - SCOPUS:0026869971

VL - 4

SP - 167

EP - 179

JO - Neurocomputing

JF - Neurocomputing

SN - 0925-2312

IS - 3-4

ER -