Filters








15,466 Hits in 5.4 sec

Page 248 of The Journal of the Operational Research Society Vol. 54, Issue 3 [page]

2003 The Journal of the Operational Research Society  
First, this problem is formulated as a leaf-constrained minimum spanning tree (lc-MST). Then we develop a tree-based genetic representation to encode the candidate solutions of the lce-MST problem.  ...  topology, such as Steiner : ; : 4.5 tree,” degree-constrained spanning tree,”” and other con- For adaptation to the evolu- develop a ‘ : 6.7 strained spanning trees. ° tionary process, we tree-based genetic  ... 

An Improved Genetic Algorithm for the Large-Scale Rural Highway Network Layout

Changxi Ma, Cunrui Ma, Qing Ye, Ruichun He, Jieyan Song
2014 Mathematical Problems in Engineering  
It encodes the minimum spanning trees of large-scale rural highway network layout with Prufer array, a method which can reduce the length of chromosome; it decodes Prufer array by using an efficient algorithm  ...  For the layout problem of rural highway network, which is often characterized by a cluster of geographically dispersed nodes, neither the Prim algorithm nor the Kruskal algorithm can be readily applied  ...  Acknowledgments The authors are grateful to the three anonymous referees and the editor for their valuable comments on an earlier version of this paper.  ... 
doi:10.1155/2014/267851 fatcat:z6mif5vonvhshi52lp2xjnp5ny

A Solution of Degree Constrained Spanning Tree Using Hybrid GA [article]

Sounak Sadhukhan, Samar Sen Sarma
2014 arXiv   pre-print
Here, we have chosen a minimum degree spanning tree, which can be generated in real time with minimum turnaround time. The problem is NP-complete in nature [1, 2].  ...  In real life, it is always an urge to reach our goal in minimum effort i.e., it should have a minimum constrained path.  ...  Malay Kundu of Indian Statistical Institute, Kolkata, for encouragement and help. We also thank Jadavpur University and University of Calcutta for providing necessary support.  ... 
arXiv:1401.1753v2 fatcat:s5vbcck3d5gf5f4dfwlzkfi6rm

A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem

Günther R. Raidl, Bryant A. Julstrom
2000 Proceedings of the 2000 ACM symposium on Applied computing - SAC '00  
This paper describes a novel coding of spanning trees in a genetic algorithm for the degree-constrained minimum spanning tree problem.  ...  For a connected, weighted graph, this problem seeks to identify the shortest spanning tree whose degree does not exceed an upper bound k ≥ 2.  ...  This paper presents a novel coding for spanning trees in a GA that searches for a degree-constrained minimum spanning tree.  ... 
doi:10.1145/335603.335888 dblp:conf/sac/RaidlJ00 fatcat:32dxoska6zf6ndsipkem2m6pmm

A new evolutionary approach to the degree-constrained minimum spanning tree problem

J. Knowles, D. Corne
2000 IEEE Transactions on Evolutionary Computation  
Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a wellstudied NP-hard problem of importance in communications network design and other network-related problems.  ...  In this paper we describe some previously proposed algorithms for solving the problem, and then introduce a novel tree construction algorithm called the Randomised Primal Method (RPM) which builds degree-constrained  ...  Acknowledgements The work presented in this paper is part of a larger project aimed at developing methods for optimisation in communication networks.  ... 
doi:10.1109/4235.850653 fatcat:4yweork5kzf5pl3no6nm7dmuti

A genetic algorithm approach on tree-like telecommunication network design problem

G Zhou, M Gen
2003 Journal of the Operational Research Society  
First, this problem is formulated as a leaf-constrained minimum spanning tree (lc-MST). Then we develop a tree-based genetic representation to encode the candidate solutions of the lce-MST problem.  ...  A note on genetic algorithm approach to the degree-constrained spanning tree problems. Networks 30: 105-109. Zhou G and Gen M (1998).  ... 
doi:10.1057/palgrave.jors.2601510 fatcat:2dgsvvnkjbb7fl4hmfdphdftva

Edge sets: an effective evolutionary coding of spanning trees

G.R. Raidl, B.A. Julstrom
2003 IEEE Transactions on Evolutionary Computation  
We demonstrate the usefulness of the edge-set encoding in an evolutionary algorithm for the NP-hard degree-constrained minimum spanning tree problem.  ...  Initialization and recombination depend on an underlying random spanning tree algorithm; three choices for this algorithm, based on the minimum spanning tree algorithms of Prim and Kruskal and on random  ...  Acknowledgments The authors would like to thank the anonymous reviewers and David Fogel for their their valueable comments on a previous version of this article.  ... 
doi:10.1109/tevc.2002.807275 fatcat:iaecjournrdanmcuukhqbajx2i

A New Ant Colony Optimization Approach for the Degree-Constrained Minimum Spanning Tree Problem Using Pruefer and Blob Codes Tree Coding [chapter]

Yoon-Teck Bau, Chin-Kuan Ho, Hong-Tat Ewe
2007 Swarm Intelligence, Focus on Ant and Particle Swarm Optimization  
For the remaining tree code A New Ant Colony Optimization Approach for the Degree-Constrained Minimum Spanning Tree Problem Using Prüfer and Blob Codes Tree Coding 45 position value that is starting  ...  There A New Ant Colony Optimization Approach for the Degree-Constrained Minimum Spanning Tree Problem Using Prüfer and Blob Codes Tree Coding 51 Table 2 . 2 Table 3 shows the values of the ACO parameters  ...  Finally, the Blob code may be a useful coding of spanning trees for ants' solution construction in ACO algorithms for the d-MST and lu-dMST problems in terms of computation time.  ... 
doi:10.5772/5096 fatcat:vtn4onfuxjd3td6lrwtf3q2rya

An ant-based algorithm for finding degree-constrained minimum spanning tree

Thang N. Bui, Catherine M. Zrncic
2006 Proceedings of the 8th annual conference on Genetic and evolutionary computation - GECCO '06  
The problem of finding the degree-constrained spanning tree of minimum cost in an edge weighted graph is well known to be NP-hard.  ...  A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree.  ...  We also would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/1143997.1144000 dblp:conf/gecco/BuiZ06 fatcat:c27tmot3srbo5pupq26qwr3yay

Diameter Constrained Fuzzy Minimum Spanning Tree Problem

Sk. Md. Abu Nayeem, Madhumangal Pal
2013 International Journal of Computational Intelligence Systems  
In this paper, we have studied the constrained version of the fuzzy minimum spanning tree problem. Costs of all the edges are considered as fuzzy numbers.  ...  Using the m λ measure, a generalization of credibility measure, the problem is formulated as chance-constrained programming problem and dependent-chance programming problem according to different decision  ...  Acknowledgement The authors are grateful to an anonymous reviewer for pointing out some mistakes and for providing fruitful suggestions.  ... 
doi:10.1080/18756891.2013.816027 fatcat:e5uuqhmutrbj7aqbqo2nj2ldke

Optimizing the CMTS to Improve Quality of Service in Next Generation Networks based on ACO Algorithm

Dac-Nhuong Le
2013 International Journal of Computer Network and Information Security  
the capacitated minimum spanning tree (cMTS) problem in dynamic environment.  ...  To improve QoS of communication network with considering the network provisioning capability and dynamic environment, we formulate this problem with minimizing the communication cost (as a kind of performance  ...  Zhou and Gen presented a note on genetic algorithm approach to the degree-constrained spanning tree problems in [8] [9] .  ... 
doi:10.5815/ijcnis.2013.04.04 fatcat:65akol3mhjh5xnrlfsfgsen4om

A Novel Ant Colony Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem

Nhu Gia Nguyen, Dac-Nhuong Le, Nguyen Dang Le
2013 Journal of clean energy technologies  
The optimal communication spanning tree (OCST) problem finds a spanning tree that connects all node satisfies their communication requirements for a minimum total cost.  ...  Index Terms-Optimal communication spanning tree, node biased encoding, ant colony optimization.  ...  Node Biased Encoding The node biased encodings is among the class of weighted linear chromosome representation for spanning tree optimization problems.  ... 
doi:10.7763/ijcte.2013.v5.739 fatcat:f4seokrzvfawtl3xw75a3q6esu

GA-Based Heuristic Algorithms for Bandwidth-Delay-Constrained Least-Cost Multicast Routing [chapter]

A. T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani
2003 Applications and Innovations in Intelligent Systems X  
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem.  ...  The proposed solutions consist of six different schemes for genotype representation, and also several new heuristic algorithms for mutation, crossover, and creation of random individuals.  ...  Other encoding schemes have been used in other tree-based problems such as minimum spanning tree problems, and degree-constrained minimum spanning tree problems.  ... 
doi:10.1007/978-1-4471-0649-4_4 fatcat:pqztjioznzd23bsxponw3aqpaq

GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani
2004 Computer Communications  
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem.  ...  The proposed solutions consist of six different schemes for genotype representation, and also several new heuristic algorithms for mutation, crossover, and creation of random individuals.  ...  Other encoding schemes have been used in other tree-based problems such as minimum spanning tree problems, and degree-constrained minimum spanning tree problems.  ... 
doi:10.1016/s0140-3664(03)00185-3 fatcat:knbd2nfltfgzpklz5qciffchma

An effective ant-based algorithm for the degree-constrained minimum spanning tree problem

Minh N. Doan
2007 2007 IEEE Congress on Evolutionary Computation  
The minimum spanning tree problem with an added constraint that no node in the spanning tree has the degree more than a specified integer d, is known as the degree-constrained minimum spanning tree problem  ...  Finding the degree-constrained minimum spanning tree of a graph is a well-studied NP-hard problem.  ...  Bui [6] , for providing the benchmark set of problem instances. We also would like to thank Trinh N. D. Huynh, Huong X. D. Vo, and La Ni Le for their help comments.  ... 
doi:10.1109/cec.2007.4424510 dblp:conf/cec/Doan07 fatcat:4i74evbwa5ef7phynlyjleyb4q
« Previous Showing results 1 — 15 out of 15,466 results