Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation

► A new formulation to the network design problems with relays is developed. ► The problem is separated into two distinct problems as the path and relay problems. ► A genetic algorithm is used to solve the path problem. ► The relay problem is formulated and solved as a set covering problem. ► The pr...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 218; no. 3; pp. 829 - 837
Main Author:	Konak, Abdullah
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.05.2012 Elsevier Elsevier Sequoia S.A
Subjects:	Applied sciences Commodities Computer networks Computer science; control theory; systems Computer systems and distributed systems. User interface Covering Crossovers Design engineering Economics Exact sciences and technology Flows in networks. Combinatorial problems Formulations General aspects Genetic algorithms Heuristics Logistics Network design Network topologies Networks Operational research and scientific management Operational research. Management science Optimization algorithms Relay assignment Routing Software Studies Network design Relay assignment Heuristics Genetic algorithms Costs Covering problem Telecommunication Coverage Raw materials Consumer good Distributed system Communication network Set constraint Origin destination model Optical fiber network Genetic algorithm Heuristic method Set covering Localization Distribution network Optical fiber
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!