Variable neighborhood decomposition search for the optimization of power plant cable layout

Journal of Intelligent Manufacturing

Volumn 13, Issue 5, 2002, Pages 353-365

  Costa, M C ^a   Monclar, F R ^b   Zrikem, M ^a  

^a Bioinformatique et Chimie Moléculaire   (France)

^b EDF R AND D   (France)

Author keywords

Cable lay out; Integer min cost; Metaheuristic; Min. multipath; Multicommodity flow; VNS

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ELECTRIC POWER PLANTS; GRAPH THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; OPTIMIZATION;

CABLE LAYOUT PROBLEM; INTEGER MIN-COST MULTICOMMODITY FLOW PROBLEM; LAGRANGIAN RELAXATION METHOD; POWER PLANT DESIGN; VARIABLE NEIGHBORHOOD DECOMPOSITION SEARCH; VARIABLE NEIGHBORHOOD METHOD;

ELECTRIC CABLE LAYING;

EID: 0036792626     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019980525722     Document Type: Article

References (19)

1. Aarts, E.H.L. and Lenstra, J.K. (1997) Local Search in Combinatorial Optimization, Wiley, London,
2. Ahuja, R.K., Magnanti, T.L. and Orlin, J. (1993) Networks Flows, Theory, Algorithms, Applications, Prentice Hall, Englewood Cliffs, NJ.
3. Barnhart, C., Hane, C. and Vance, P. (1998) Using branch-and price to solve origin-destination integer multi-commodity flow problem. Operations Research, 32(3), 208-220.
4. Brunetta, L., Conforti, M. and Fischetti, M. (2000) A polyhedral approach to an integer multicommodity flow problem. Discrete Applied Mathematics, 101, 13-36.
5. Costa, M.C. and Péletan, N. (1997) Solving the Shortest edge disjoint or capacitated undirected paths problems, in International Symposium on Mathematical Programming (ISMP'97), Lausanne.
6. Costa, M.-C., Hertz, A., and Mittaz, M. (2002) Bounds and heuristics for the shortest capacitated paths problem. Journal of Heuristics, 8(4), 449-465.
7. Frank, A. (1991) Packing paths, circuits and cuts: a survey, in Korte B., Lovasz L., Promel H. J. and Schrijver A., eds., Paths, Flows and VLSI-layout, pp. 47-100, Springer-Verlag, Heidelberg.
8. Glover, F. (1989) Tabu Search, Part 2. ORSA Journal on Computing, 1, 190-206.
9. Glover, F. (1990) Tabu Search, Part 1. ORSA Journal on Computing, 1, 4-32.
10. Gondran, M. and Minoux, M. (1995), (revision of previous editions 1971, 1985) Graphes et Algorithmes, Eyrolles, Paris (in French). Graphs and Algorithms, Wiley (in English, 1984).
11. Hansen, P. and Mladenoviç N. (1999) An introduction to variable neighborhood search, in I.H. Osman, S. Voss, S. Martello, C. Roucairol, eds, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433-458, Kluwer, Boston.
12. Hansen, P. and Mladenoviç, N. (2001) Variable neighborhood search: principles and applications. European Journal of Operational Research, 130(3), 449-470.
13. Hansen, P., Mladenoviç, N. and Perez-Brito, D. (2001) Variable neighborhood decomposition search. Journal of Heuristics, 7(4), 335-350.
14. Klein, P., Plotkin, S., Stein, C. and Tardos, E. (1994) Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal of Computing, 23, 466-487.
15. Minoux, M. (1975) Résolution des Problèmes de Multiflots en Nombres Entiers dans les Grands Réseaux. RAIRO Opns. Res., 3, 21-40.
16. Schrijver, A. (1991) Homotopic routing method, in Korte B., Lovas. L., Promel H.J. and A. Schrijver eds., Paths, Flows and VLSI-layout, pp. 329-371, Springer-Verlag, Heidelberg.
17. Sidi-Moussa, R. (1999) Optimisation du routage des câbles de centrales nucléaires par la méthode de génération de colonnes, Mémoire de DEA, Université de Paris Dauphine et EDF, France.
18. Turki, I. (1997) Optimisation d'itinéraires de câbles électriques. Mémoire de DEA, CNAM-IIE, France.
19. Zrikem, M. (2000) Modélisation des changements de directions pour l'optimisation du câblage des centrales, EDF Technical Report HE72-00/008, France.