A local search algorithm for plug-and-play reconfiguration of interconnected systems

2016 ◽  
Vol 64 (12) ◽  
Author(s):  
Sven Bodenburg ◽  
Jan Lunze

AbstractThis paper proposes a novel method to organise the reconfiguration process of decentralised controllers after actuator failures have occurred in an interconnected system. If an actuator fails in a subsystem, only the corresponding control station should be reconfigured, although the fault has effects on other subsystems through the physical couplings. The focus of this paper is on the organisation of the reconfiguration process without a central coordinator. Design agents exist for each of the subsystems which store the subsystem model. A local algorithm is presented to gather models from neighbouring design agents with the aim to set-up a model which describes the behaviour of the faulty subsystem including its neighbours. Furthermore, local reconfiguration conditions are proposed to design a virtual actuator so as to guarantee stability of the overall system. As a consequence, the design agents “play” together to gather the model of the faulty subsystem before the reconfigured control station is “plugged-in” the control hardware. Plug-and-play reconfiguration is illustrated by an interconnected tank system.

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Carolina Lagos ◽  
Guillermo Guerrero ◽  
Enrique Cabrera ◽  
Stefanie Niklander ◽  
Franklin Johnson ◽  
...  

A novel matheuristic approach is presented and tested on a well-known optimisation problem, namely, capacitated facility location problem (CFLP). The algorithm combines local search and mathematical programming. While the local search algorithm is used to select a subset of promising facilities, mathematical programming strategies are used to solve the subproblem to optimality. Proposed local search is influenced by instance-specific information such as installation cost and the distance between customers and facilities. The algorithm is tested on large instances of the CFLP, where neither local search nor mathematical programming is able to find good quality solutions within acceptable computational times. Our approach is shown to be a very competitive alternative to solve large-scale instances for the CFLP.


2018 ◽  
Vol 69 (6) ◽  
pp. 849-863 ◽  
Author(s):  
Ruizhi Li ◽  
Shuli Hu ◽  
Peng Zhao ◽  
Yupeng Zhou ◽  
Minghao Yin

2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.


Sign in / Sign up

Export Citation Format

Share Document