|
|
using metaheuristic algorithms for solving a hub location problem: application in passive optical network planning
|
|
|
|
|
نویسنده
|
rabbani masoud ,ravanbakhsh mohammad ,farrokhi-asl hamed ,taheri mahyar
|
منبع
|
international journal of supply and operations management - 2017 - دوره : 4 - شماره : 1 - صفحه:15 -32
|
چکیده
|
Nowadays, fiber-optic are counted as one of the most important tools for data transfer due to having greater bandwidth and being more efficient compared with other similar technologies,. in this article, an integrated mathematical model for a three-level fiber-optic distribution network is presented with consideration of simultaneous backbone and local access networks the backbone network is a ring and the access networks has a star-star topology. the aim of the model is to determine the location of the central offices and splitters, the type of connection between central offices, and allocation of each demand node to a splitter or central office in a way that the wiring cost of fiber optical and concentrator installation are minimized. moreover, each user’s desired bandwidth should be provided efficiently. then, the proposed model is validated by gams software in small-sized problems, afterwards the model is solved by two meta-heuristic methods including differential evolution (de) and genetic algorithm (ga) in large-scaled problems and the results of two algorithms are compared with respect to computational time and objective function obtained value. finally, a sensitivity analysis is provided.
|
کلیدواژه
|
fiber-optic ,telecommunication network ,hub-location ,passive splitter ,three-level network
|
آدرس
|
university of tehran, college of engineering, school of industrial engineering, ایران, university of tehran, college of engineering, school of industrial engineering, ایران, iran university of science & technology, school of industrial engineering, ایران, university of tehran, college of engineering, school of industrial engineering, ایران
|
پست الکترونیکی
|
mah.taheri24@ut.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|