- Title
- Hybrid simulated annealing and genetic algorithm for degree/diameter problem
- Creator
- Tang, Jianmin; Miller, Mirka; Lin, Yuqing
- Date
- 2005
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/44479
- Identifier
- vital:3772
- Identifier
- ISBN:0646452525
- Abstract
- The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimization solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct larger digraphs, and displays our preliminary results obtained by HSAGA.
- Publisher
- Ballarat, Victoria : University of Ballarat
- Relation
- Paper pesented at Sixteenth Australasian Workshop on Combinatorial Algorithms, AWOCA 2005, Ballarat, Victoria : 18th-21st September 2005 p. 321-331
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0802 Computation Theory and Mathematics; Digraphs; Moore bound; Diameter; Out-degree; Simulated annealing; Genetic algorithm; Degree/diameter problem
- Hits: 1303
- Visitors: 1307
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|