Iterative improvement methods for a multiperiod network design problem

European Journal of Operational Research

Volumn 110, Issue 1, 1998, Pages 150-165

  Garcia, Bruno Laurent ^a   Mahey, Philippe ^a   LeBlanc, Larry J ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Heuristics; Local search; Multiperiod network expansion; Network programming

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; PROBLEM SOLVING; SIMULATED ANNEALING; STRATEGIC PLANNING;

GENERIC LOCAL IMPROVEMENT TEMPLATE (GLIT); MULTIPERIOD NETWORK EXPANSION PROBLEMS; NETWORK PROGRAMMING;

TELECOMMUNICATION NETWORKS;

EID: 0032188727     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00217-8     Document Type: Article

References (32)

1. J.E. Aronson, A survey on dynamic network flows, Annals of Operations Research 20 (1989) 1-66.
2. A. Balakrisbnan, T.L. Magnanti, P. Mirchandani, A dual-based algorithm for multi-level network design, Management Science 40 (5) (1994) 567-581.
3. M.O. Ball, T.L. Magnanti, C.L. Monna, G.L. Nemhauser (Eds.), Network routing, Handbooks in Operations Research and Management Science, vol. 8, North-Holland, Amsterdam, 1995.
4. J.C. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing 6 (2) (1994) 154-160.
5. L. Bodin, L. Berman, Routing and scheduling of school buses by computer, Transportation Science, 13 (1979) 113-129.
6. S.-G. Chang, B. Gavish, Telecommunication network topological design and capacity expansion: Formulations and algorithms, Telecommunications Systems 1 (1993) 99-131.
7. K. Chari, A. Dutta, Design of private backbone networks in time varying traffic, EJOR 67 (1993) 428-442.
8. J. Cheney, The application of optimisation methods to the design of large scale telecommunication networks, in: IEE Colloquium on Large-Scale and Hierarchical Systems, Digest No. 35 IEE, 1998.
9. J. Chifflet, N. Ikeuchi, P. Lansard, Mican: An algorithm to dimension switching networks with adaptive routing using implied cost methodolgy, in: Proceedings of 13th International Teletraffic Congress, North-Holland, Amsterdam, 1991, pp. 447-451.
10. L. Davis (Ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
11. J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time Constrained Routing and Scheduling, Ch. 2. vol. 8 of Ball et al. [3], 1995.
12. C. Duhamel, B.-L. Garcia, 1996, Glit: A generic autocalibrating iterative improvement method, application to the vehicle routing with time windows problem, Technical Report 95-2, LIMOS, ISIMA, 96.
13. A. Dutta, J.-I. Lim, A multiperiod capacity planning model for backbone computer communication networks, Operations Research 40 (4) (1992) 689-705.
14. M. Fisher, Vehicle Routing, Ch. 1, vol. 8 of Ball et al. [3], 1995.
15. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
16. A. Gersht, R. Weihmayer, An optimization model for multifacility data network evolution planning, in: Proceedings of the 12th International Teletraffic Congress, North-Holland, Amsterdam, 1989, pp. 473-479.
17. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
18. J.J. Holland, Adaptation in Natural and Artifical Systems, University of Michigan, Ann Arbor, 1975.
19. C. Jack, K. Sheng-Roan, A. Shulman, Design and implementation of an interactive optimization system for telephone network planning, Operations Research 40 (1992) 14-25.
20. F.P. Kelly, Routing in circuit switched networks: Optimization, shadow prices and decentralization, Adv. Appl. Probabilities 20 (1988) 112-144.
21. D. Klingman, A. Napier, J. Stutz. A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems, Management Science, 20 (1974) 814-821.
22. S. Lin, Computer solutions of the traveling salesman problem, Bell System Tech. (1964) 2245-2269.
23. M. Minoux, Network synthesis and dynamic network optimisation, in: S. Martello, G. Laporte, M. Minoux, C. Riberto (Eds.), Surveys in Combinatorial Optimisation, North-Holland, Amsterdam, 1987, pp. Ch. 9, 283-324.
24. M. Nakamura, E. Downey Brill, Jr., J. Liebman, Multiperiod design of regional wastewater systems: Generating and evaluation alternative plans, Water Resources Research 14 (1981) 1339-1348.
25. I. Norenkov, Y. Yevstifeyev, V. Manichev, A method for an accelerated analysis of multiperiod electronic circuits, Telecommunications and Radio Engineering, Part 2 Radio Engineering 42 (1987) 123-126.
26. M.V. Pereira, Hydroelectric system planning, Expansion for electrical generating systems, IAEA, Vienna, 1984, Ch. 3.
27. J.Y. Potvin, T. Kervahut, B.L. Garcia, J.M. Rousseau, The Vehicle Routing Problem with Time Windows - Part I: Tabu Search, Informs Journal on Computing, 8 (2) (1996) 158-164.
28. C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993.
29. C.R. Reeves, Genetic Algorithms, Ch. 4, pp. 151-196, in Reeves [28], 1993.
30. R. Vijay, A. Kanda, P. Vrat, Multiperiod capacity expansion of road networks: Formulation and algorithms, Operations Research, 30 (1993) 117-140.
31. D. Woodruff, M.L. Spearman, A framework for diversification in tabu search. Technical Report, Department of Industrial Engineering and Management Sciences, North Western University, 1990.
32. T. Wu, R. Cardwell, M. Boyden, A multi-period design model for survivable network architecture selection for sonet interoffice networks, IEEE Transactions on Reliability, 40 (1991) 417-427.