论文信息 - Variable Neighborhood Search for the Optimization of Cable Layout Problem

Variable Neighborhood Search for the Optimization of Cable Layout Problem

The cable layout problem is met at Electricit´e de France (EDF) in the design of power plants. Giventhe plan of the buildings, the location of the equipments and a structure of cable supports of ﬁxedcapacities, also called shelves, cables of all kind have to be routed: voltage, communication, control,etc. The Cable Layout Problem (

Marie-Christine Costa | Maria Zrikem | Francois-Regis Monclar

[1] Marie-Christine Costa,et al. Solving the shortest edge disjoint or capacited undirected paths problems , 1997 .

[2] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[3] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[4] Michel Minoux,et al. Graphes et algorithmes , 1995 .

[5] Pierre Hansen,et al. Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[6] Nenad Mladenović,et al. An Introduction to Variable Neighborhood Search , 1997 .

[7] Alain Hertz,et al. Bounds and Heuristics for the Shortest Capacitated Paths Problem , 2002, J. Heuristics.