Dynamics of Alopex Process: Application to Optimization Problems

E. Harth and A. S. Pandya
Additional contact information
E. Harth: Syracuse University, Physics Department
A. S. Pandya: Syracuse University, Physics Department

A chapter in Biomathematics and Related Computational Problems, 1988, pp 459-471 from Springer

Abstract: Abstract The Alopex process has been applied to a variety of problems in which maxima or minima of functions of many parameters are to be determined. We present here different forms of the algorithm and a simple theory of the dynamics of the process. Computer simulations of several applications are presented to illustrate the versatility of the method. An artificial visual system is described in which partial stimuli are completed and patterns are created out of noise with only a scalar cost function to guide the process.

Keywords: Cost Function; Travel Salesman Problem; Travel Salesman Problem; Lateral Geniculate Nucleus; Stimulus Pattern (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-2975-3_41

Ordering information: This item can be ordered from
http://www.springer.com/9789400929753

DOI: 10.1007/978-94-009-2975-3_41

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().