Designing radio-mobile access networks based on synchronous digital hierarchy rings

Computers and Operations Research

Volumn 32, Issue 2, 2005, Pages 379-394

  Billionnet, Alain ^a   Elloumi, Sourour ^b   Djerbi, Leila Grouz ^c  

^a Institut d'Informatique d'Entreprise   (France)

^b Laboratoire CEDRIC   (France)

^c UNIVERSITÉ PARIS OUEST NANTERRE LA DÉFENSE   (France)

Author keywords

Location routing; Minimum capacitated partition problem; Mixed integer programming; SDH SONET network design

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DIGITAL DEVICES; HIERARCHICAL SYSTEMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; PROBLEM SOLVING; SYNCHRONOUS MACHINERY; SYSTEMS ANALYSIS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

LOACATION ROUTING; MINIMUM CAPACITATED PARTITION PROBLEM; MIXED INTEGER PROGRAMMING; SDH NETWORK DESIGN; SONET NETWORK DESIGN; SYNCHRONOUS DIGITAL HIERARCHY (SDH) RINGS;

RADIO COMMUNICATION;

EID: 4544231372     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00242-9     Document Type: Article

References (15)

1. Sexton M, Reid A. Broadband networking: ATM, SDH, and SONET. Norwood, MA: Artech House; 1997.
2. Lagrange X, Godlewski P, Tabbane S. Réseaux GSM-DCS, des principes à la norme. Paris, France, Hermès Science; 1999.
3. Gawande M., Klincewicz J.G., Luss H. Design of sonet ring networks for local access. Advances in Performance Analysis. 2(2):1999;159-173.
4. Shi J., Fonseka J.P. Hierarchical self-healing rings. IEEE/ACM Transactions on Networking. 3(6):1995;690-697.
5. Chamberland S, Marcotte O, Sanso B. Heuristics for ring network design when several types of switches are available. In: IEEE International Conference on Communications, Montreal, Canada; 1997.
6. Chamberland S., Marcotte O., Sanso B. Topological design of two-level telecommunication networks with modular switches. Operations Research. 48(5):2000;745-760.
7. Laporte G., Nobert Y., Pelletier P. Hamiltonian location problems. European Journal of Operational Research. 12:1983;82-89.
8. Laporte G., Nobert Y., Taillefer S. Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science. 22:1988;161-171.
9. Perl J., Daskin M. A warehouse location-routing problem. Transportation Research. 19B:1985;381-396.
10. Hansen P.H., Hegedahl B., Hjortkjr S., Obel B. A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research. 76(1):1994;111-127.
11. Perl J. A unified warehouse location-routing analysis. PhD thesis, Department of Civil Engineering, Northwestern University, Evanston, 1983.
12. Wu T., Low C., Bai J. Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research. 29(10):2002;1393-1415.
13. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulations and traveling salesman problems. Journal of the Association for Computing Machinery. 7:1960;326-329.
14. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research. 12(4):1964;568-581.
15. CPLEX. Using the cplex callable library. Technical Report, ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA, 1998.