151
|
Grigorjev AV, Mironov AA. Mapping DNA by stochastic relaxation: schedule for optimal annealing. DNA SEQUENCE : THE JOURNAL OF DNA SEQUENCING AND MAPPING 1991; 1:221-6. [PMID: 1806038 DOI: 10.3109/10425179109020776] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/28/2022]
Abstract
The analysis of the various cooling schedules for the simulated annealing algorithm is made towards the restriction map construction. Algorithm behaviour under control of three different cost functions is considered and the discrete cost function is found to handle successfully experimental data with realistic error sizes. A program using this function has been derived from the algorithm to construct linear and circular DNA maps.
Collapse
Affiliation(s)
- A V Grigorjev
- Department of Biotechnology, Institute for Genetics of Microorganisms, Moscow, USSR
| | | |
Collapse
|
152
|
Mühlenbein H. Parallel genetic algorithms, population genetics and combinatorial optimization. PARALLELISM, LEARNING, EVOLUTION 1991. [DOI: 10.1007/3-540-55027-5_23] [Citation(s) in RCA: 26] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/11/2023]
|
153
|
Mühlenbein H. Evolution in Time and Space – The Parallel Genetic Algorithm. FOUNDATIONS OF GENETIC ALGORITHMS 1991. [DOI: 10.1016/b978-0-08-050684-5.50023-9] [Citation(s) in RCA: 116] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/11/2023]
|
154
|
Sibani P, Pedersen JM, Hoffmann KH, Salamon P. Monte Carlo dynamics of optimization problems: A scaling description. PHYSICAL REVIEW. A, ATOMIC, MOLECULAR, AND OPTICAL PHYSICS 1990; 42:7080-7086. [PMID: 9904022 DOI: 10.1103/physreva.42.7080] [Citation(s) in RCA: 18] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 04/11/2023]
|
155
|
Peterson C. Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem. Neural Comput 1990. [DOI: 10.1162/neco.1990.2.3.261] [Citation(s) in RCA: 70] [Impact Index Per Article: 2.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/04/2022]
Abstract
We present and summarize the results from 50-, 100-, and 200-city TSP benchmarks presented at the 1989 Neural Information Processing Systems (NIPS) postconference workshop using neural network, elastic net, genetic algorithm, and simulated annealing approaches. These results are also compared with a state-of-the-art hybrid approach consisting of greedy solutions, exhaustive search, and simulated annealing.
Collapse
Affiliation(s)
- Carsten Peterson
- Department of Theoretical Physics, University of Lund, Sölvegatan 14A, S-22362 Lund, Sweden
| |
Collapse
|
156
|
BOZER YAVUZA, SCHORN ELLENC, SHARP GUNTERP. Geometric Approaches to Solve the Chebyshev Traveling Salesman Problem. ACTA ACUST UNITED AC 1990. [DOI: 10.1080/07408179008964179] [Citation(s) in RCA: 29] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/23/2022]
|
157
|
|
158
|
|
159
|
Robertazzi TG, Schwartz SC. An Accelerated Sequential Algorithm for Producing D-Optimal Designs. ACTA ACUST UNITED AC 1989. [DOI: 10.1137/0910022] [Citation(s) in RCA: 24] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022]
|
160
|
|
161
|
van Oudheusden DL, Tzen YJJ, Ko HT. Improving storage and order picking in a person-on-board as/r system: A case study. ACTA ACUST UNITED AC 1988. [DOI: 10.1016/0167-188x(88)90013-4] [Citation(s) in RCA: 20] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
|
162
|
|
163
|
|
164
|
Moore MA. Zero-temperature scaling and combinatorial optimization. PHYSICAL REVIEW LETTERS 1987; 58:1703-1706. [PMID: 10034513 DOI: 10.1103/physrevlett.58.1703] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/23/2023]
|
165
|
Golden BL, Skiscim CC. Using simulated annealing to solve routing and location problems. ACTA ACUST UNITED AC 1986. [DOI: 10.1002/nav.3800330209] [Citation(s) in RCA: 116] [Impact Index Per Article: 3.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
|
166
|
Baldi P, Baum EB. Bounds on the size of ultrametric structures. PHYSICAL REVIEW LETTERS 1986; 56:1598-1600. [PMID: 10032718 DOI: 10.1103/physrevlett.56.1598] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/23/2023]
|
167
|
Baker EK, Schaffer JR. Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints. ACTA ACUST UNITED AC 1986. [DOI: 10.1080/01966324.1986.10737197] [Citation(s) in RCA: 16] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]
|
168
|
|
169
|
Vannimenus J, Mézard M. On the statistical mechanics of optimization problems of the travelling salesman type. ACTA ACUST UNITED AC 1984. [DOI: 10.1051/jphyslet:0198400450240114500] [Citation(s) in RCA: 55] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
|
170
|
Book Reviews. J Am Stat Assoc 1983. [DOI: 10.1080/01621459.1983.10477050] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
171
|
|
172
|
|
173
|
Golden BL, Alt FB. Interval estimation of a global optimum for large combinatorial problems. ACTA ACUST UNITED AC 1979. [DOI: 10.1002/nav.3800260108] [Citation(s) in RCA: 73] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
|
174
|
Corneil D, Mathon R. Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations. ALGORITHMIC ASPECTS OF COMBINATORICS 1978. [DOI: 10.1016/s0167-5060(08)70319-4] [Citation(s) in RCA: 22] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/19/2023]
|
175
|
McQuillan JM. Graph theory applied to optimal connectivity in computer networks. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 1977. [DOI: 10.1145/1024857.1024860] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]
Abstract
This is a report on some of the research that has been carried out in applying graph theoretical results to communications networks. The networks that we wish to investigate here consist of computers at various sites which are linked together by telecommunications circuits.
Many of the results of graph theory may be applied to such networks; we will restrict ourselves to the consideration of connectivity. In designing a computer communications network, it is desirable to provide good connectivity among all sites at reasonable cost. For this reason, extremes like the fully-connected network (too expensive) and the star network (only as reliable as its center) are usually not considered. The connectivity constraints or reliability measures can be stated in different ways, and analytic techniques have been developed for some of these measures. Further, procedures for the synthesis of well-connected networks have also been invented.
The reliability of communications networks is an important issue in their design and operation. Telecommunications circuits become noisy and unusable, and the communications computers may also fail. This report is a survey of that part of applied graph theory which is useful in the study of the connectivity of communications networks.
Collapse
|
176
|
|
177
|
A rapid heuristic algorithm for the approximate solution of the traveling salesman problem. ACTA ACUST UNITED AC 1975. [DOI: 10.1016/0041-1647(75)90055-6] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022]
|
178
|
|
179
|
Camerini PM, Fratta L, Maffioli F. On improving relaxation methods by modified gradient techniques. NONDIFFERENTIABLE OPTIMIZATION 1975. [DOI: 10.1007/bfb0120697] [Citation(s) in RCA: 179] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/13/2022]
|
180
|
|
181
|
|
182
|
|
183
|
|
184
|
|
185
|
|