Nonlinear network optimization - An embedding vector space approach

IEEE Transactions on Evolutionary Computation

Volumn 14, Issue 2, 2010, Pages 206-226

  Carrano, Eduardo G ^a   Takahashi, Ricardo H C ^b   Fonseca, Carlos M ^c,d   Neto, Oriane M ^b  

^a CENTRO FEDERAL DE EDUCAÇÃO TECNOLÓGICA DE MINAS GERAIS   (Brazil)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^c UNIVERSITY OF ALGARVE   (Portugal)

^d INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Continuous space embedding; Evolutionary computation; Genetic algorithms; Network optimization

Indexed keywords

ANT COLONY ALGORITHMS; CONTINUOUS SPACES; CONTINUOUS VARIABLES; EVOLUTIONARY OPERATORS; MINIMUM SPANNING TREES; NETWORK OPTIMIZATION; OPTIMAL COMMUNICATION; VECTOR REPRESENTATIONS;

ELECTRIC POWER DISTRIBUTION; ENCODING (SYMBOLS); EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 78650609286     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2009.2028330     Document Type: Article

References (59)

1. D. G. Luenberger, Optimization by Vector Space Methods, NY: Willey, chs. 2 and 3, 1969, pp. 11-54.
2. D. G. Luenberger, Linear and Nonlinear Programming, Reading, MA: Addison-Wesley, chs. 6-9, 1984, pp. 168-288.
3. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. Berlin, Germany: Springer-Verlag, ch. 5, 1996, pp. 95-105.
4. J. Kennedy, "The particle swarm: Social adaptation of knowledge," in Proc. IEEE Int. Conf. Evolut. Comput., Indianapolis, IN, 1997, pp. 303-308.
5. P. N. Suganthan, "Particle swarm optimiser with neighborhood operator," in Proc. IEEE Int. Conf. Evolut. Comput., WA, 1999, pp. 1958-1962.
6. R. Storn and K. Price, "Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces," J. Global Optimization, vol. 11, no. 4, pp. 341-359, Dec. 1997.
7. D. K. Smith and G. A. Walters, "An evolutionary approach for finding optimal trees in undirected networks," Eur. J. Oper. Res., vol. 120, no. 3, pp. 593-602, Feb. 2000.
8. G. Duan and Y. Yu, "Problem-specific genetic algorithms for power transmission system planning," Elec. Power Syst. Res., vol. 61, no. 1, pp. 41-50, Feb. 2002.
9. E. G. Carrano, L. A. E. Soares, R. H. C. Takahashi, R. R. Saldanha, and O. M. Neto, "Electric distribution multiobjective network design using a problem-specific genetic algorithm," IEEE Trans. Power Del., vol. 21, no. 2, pp. 995-1005, Apr. 2006.
10. M. Christodoulakis, C. S. Iliopoulos, K. Park, and J. S. Sim, "Implementing approximate regularities," Math. Comput. Model., vol. 42, nos. 7-8, pp. 855-866, Oct. 2005.
11. C. Lafage and J. Lang, "Propositional distances and compact preference representation," Eur. J. Oper. Res., vol. 160, no. 3, pp. 741-761, Feb. 2005.
12. A. Galton, "Two topologies for discrete space," in Proc. Leeds Spatial Reasoning Workshop, Leeds, U.K., 1999, pp. 1-5.
13. A. Galton, "Continuous motion in discrete spaces," in Proc. Int. Conf. Principles Knowledge Representation Reason., San Francisco, CA, 2000, pp. 26-37.
14. L. J. Billera, S. P. Holmes, and K. Vogtmann, "Geometry of the space of phylogenetic trees," Adv. Appl. Math., vol. 27, no. 4, pp. 733-767, Nov. 2001.
15. H. L. Willis, H. Trans, and L. F. M. V. Engel, "Selecting and applying distribution optimization methods," IEEE Comput. Appl. Power, vol. 9, no. 1, pp. 12-17, Jan. 1996.
16. L. Araujo, H. Ramos, and S. Coelho, "Pressure control for leakage minimisation in water distribution systems management," Water Resour. Manage., vol. 20, no. 1, pp. 133-149, Feb. 2006.
17. Y. Wu, K. K. Lai, and Y. Liu, "Deterministic global optimization approach to steady-state distribution gas pipeline networks," Optimization Eng., vol. 8, no. 3, pp. 259-275, Jul. 2007.
18. A. Cohn, M. Daveya, L. Schkadea, A. Siegela, and C. Wonga, "Network design and flow problems with cross-arc costs," Eur. J. Oper. Res., vol. 189, no. 3, pp. 890-901, Jul. 2007.
19. C. Srivaree-ratana, A. Konak, and A. E. Smith, "Estimation of all-terminal network reliability using an artificial neural network," Comput. Oper. Res., vol. 29, no. 7, pp. 849-868, Jun. 2002.
20. R. E. Burkard, "Efficiently solvable special cases of hard combinatorial optimization problems," Math. Program., vol. 79, nos. 1-3, pp. 55-69, Oct. 1997.
21. I. Ramírez-Rosado and J. Bernal-Agustín, "Genetic algorithms applied to the design of large power distribution systems," IEEE Trans. Power Syst., vol. 13, no. 2, pp. 696-702, May 1998.
22. T. S. Chung, K. K. Li, G. J. Chen, J. D. Xie, and G. D. Tang, "Multi-objective transmission network system planning by hybrid GA approach with fuzzy decision analysis," Int. J. Elec. Power Energy Syst., vol. 25, no. 3, pp. 187-192, Mar. 2003.
23. E. G. Carrano, R. H. C. Takahashi, E. P. Cardoso, R. R. Saldanha, and O. M. Neto, "Optimal substation location and energy distribution network design using a hybrid GA-BFGS algorithm," IEEE Proc. Generat., Transmission Distribut., vol. 152, no. 6, pp. 919-926, Nov. 2005.
24. E. G. Carrano, R. H. C. Takahashi, C. M. Fonseca, and O. M. Neto, "Bi-objective combined facility location and network design," in Proc. 4th Int. Conf. Evolutionary Multi-Criterion Optimization (EMO), LNCS 4403. Berlin, Germany: Springer, 2007, pp. 486-500.
25. A. Augugliaro, L. Dusonchet, S. Mangione, and E. R. Sanseverino, "Fast solution of radial distribution networks with automated compensation and reconfiguration," IEEE Trans. Power Del., vol. 56, no. 2, pp. 159-165, Nov. 2002.
26. J. Z. Zhu, "Optimal reconfiguration of electrical distribution network using the refined genetic algorithm," Elect. Power Syst. Res., vol. 62, no. 1, pp. 37-42, May 2002.
27. F. N. Abuali, D. A. Schoenefeld, and R. L. Wainwright, "Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees," in Proc. ACM Symp. Appl. Comput., Phoenix, AZ, 1994, pp. 242-246.
28. J. Arabas and S. Kozdrowski, "Applying an evolutionary algorithm to telecommunication network design," IEEE Tran. Evol. Comput., vol. 5, no. 4, pp. 309-322, Aug. 2001.
29. D. C. Dietz, A. J. Elcan, and D. E. Skipper, "Optimization models for ATM network planning," Comput. Oper. Res., vol. 30, no. 4, pp. 625-641, Apr. 2003.
30. P. Chakroborty, "Genetic algorithms for optimal urban transit network design," Computer-Aided Civil Infrastruct. Eng., vol. 18, no. 3, pp. 184-200, Mar. 2003.
31. B. M. Baker and M. A. Ayechew, "A genetic algorithm for vehicle routing problem," Comput. Oper. Res., vol. 30, no. 5, pp. 787-800, Apr. 2003.
32. K. P. Ferentinos, K. G. Arvanitis, and N. Sigrimos, "Heuristic optimization methods for motion planning of autonomous agricultural vehicles," Jo. Global Optimization, vol. 23, no. 2, pp. 155-170, Jun. 2002.
33. B. A. Julstrom, "Very greedy crossover in a genetic algorithm for the traveling salesman problem," in Proc. ACM Sympos. Appl. Comput., Nashville, TN, 1995, pp. 324-328.
34. I. Wegener and C. Witt, "On the optimization of monotone polynomials by simple randomized search heuristics," Comb., Probab. Comput., vol. 14, no. 1, pp. 225-247, Jan. 2005.
35. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: Overview and conceptual comparison," ACM Comput. Surveys, vol. 35, no. 3, pp. 268-308, Sep. 2003.
36. T. C. Hu, "Optimum communication spanning trees," SIAM J. Comput., vol. 3, no. 3, pp. 188-195, Sep. 1974.
37. S. Soak, D. W. Corne, and B. Ahn, "The edge-window-decoder representation for tree-based problems," IEEE Trans. Evol. Comput., vol. 10, no. 2, pp. 124-144, Apr. 2006.
38. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W. H. Freeman, appen. A2, 1979, pp. 206-207.
39. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci., vol. 43, pp. 425-440, Dec. 1991.
40. R. Dechter and J. Pearl, "Generalized best-first search strategies and the optimality of A*," J. Assoc. Comput. Mach., vol. 32, no. 1, pp. 505-536, Jul. 1985.
41. E. G. Carrano, C. M. Fonseca, R. H. C. Takahashi, L. C. A. Pimenta, and O. M. Neto, "A preliminary comparison of tree encoding schemes for evolutionary algorithms," in Proc. IEEE Int. Conf. Syst. Man. Cybernet., Vancouver, Canada, Oct. 7-10 2007, pp. 1969-1974.
42. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," in Proc. IEEE Int. Conf. Evol. Comput. Intell., vol. 1, Orlando, FL, Jun. 1994, pp. 379-384.
43. G. R. Raidl and B. A. Julstrom, "Edge-sets: An effective evolutionary encoding of spanning trees," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 225-239, Jun. 2003.
44. R. H. C. Takahashi, J. A. Vasconcelos, J. A. Ramirez, and L. Krahenbuhl, "A multiobjective methodology for evaluating genetic operators," IEEE Trans. Magn., vol. 39, no. 3, pp. 1321-1324, May 2003.
45. R. M. Ramos, R. R. Saldanha, R. H. C. Takahashi, and F. J. S. Moreira, "The real-biased multiobjective genetic algorithm and its application to the design of wire antennas," IEEE Trans. Magn., vol. 39, no. 3, pp. 1329-1332, May 2003.
46. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Am. Math. Soc., vol. 7, no. 1, pp. 48-50, Feb. 1956.
47. J. E. Baker, "Reducing bias and inefficiency in the selection algorithm," in Proc. Int. Conf. Genet. Algorithms, MA, 1987, pp. 14-21.
48. J. F. Gómez, H. M. Khodr, P. M. De Oliveira, L. Ocque, J. M. Yusta, R. Villasana, and A. J. Urdaneta, "Ant Colony System algorithm for the planning of primary distribution circuits," IEEE Trans. Power Syst., vol. 19, no. 2, pp. 996-1004, May 2004.
49. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms, 2nd ed. Berlin, Germany: Springer-Verlag, ch. 6, 2005, pp. 171-177.
50. H. Prüfer, "Neuer Beweis eines Satzes über Permutationen," Arch. Math. Phys., vol. 27, pp. 742-744, 1918.
51. F. Routhlauf, D. Goldberg, and A. Heinzl, "Network random key: A tree network representation scheme for genetic and evolutionary algorithms," Evol. Comput., vol. 10, no. 1, pp. 75-97, Mar. 2002.
52. S. Pemmaraju and S. Skiena, Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Cambridge, U.K.: Cambridge Univ. Press, chs. 2 and 3, 2003, pp. 55-109.
53. M. Ehrgott, Multicriteria Optimization, Berlin, Germany: Springer-Verlag, ch. 2, 2000, pp. 19-52.
54. A. Assad and W. Xu, "The quadratic minimum spanning tree problem," Nav. Res. Logist., vol. 39, no. 3, pp. 399-417, Apr. 1992.
55. W. Xu, "On the quadratic minimum spanning tree problem," in Proc. Int. Conf. Genet. Algorithms, 1995, pp. 141-148.
56. P. E. Gill, W. Murray, and M. A. Saunders, "SNOPT: An SQP algorithm for large-scale constrained optimization," Soc. Ind. Appl. Math. (SIAM) Review, vol. 47, no. 1, pp. 99-131, Feb. 2005.
57. A. R. Conn, N. I. M. Gould, and P. L. Toint, Trust-Region Methods. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), ch. 1, 2000, pp. 1-12.
58. J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), ch. 2, 2001, pp. 21-54.
59. E. G. Carrano, F. G. Guimaraes, R. H. C. Takahashi, O. M. Neto, and F. Campelo, "Electric distribution network expansion under load-evolution uncertainty using an immune system inspired algorithm," IEEE Trans. Power Syst., vol. 22, no. 2, pp. 851-861, May 2007.