A novel method based on reactive Tabu search (RTS) for volt/Var control in electric power distribution systems is proposed, and its comparison with traditional Tabu search (TS) is given.

From the computational result,RTS(reactive tabu search) algorithm in the second phase was improved more when finding the solution in comparison with the algorithm in the first phase.

To solve the time-dependent vehicle routing problem with backhauls,a mathematical model was constructed and a reactive tabu search algorithm was put forward.

This method was a two-phase heuristic method. The original solution was generated through improving traditional heuristic method,and then the initial solutions were optimized by the reactive tabu search algorithm,including the definition of the neighborhood generation mechanism,applying Hash table data structure to store the solution during the search,checking the repetition status of the solution,and the definition of the escaping mechanism from local space.

To this end, we implement a metaheuristic based on reactive tabu search.

We design a reactive tabu search metaheuristic that can check feasibility of proposed moves quickly and reacts to repetitions to guide the search.

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

Reactive Tabu Search and Sensor Selection in Active Structural Acoustic Control Problems

The combinatorial optimization component, based on the Reactive Tabu Search recently proposed by the authors, locates the most promising "boxes", in which starting points for the local minimizer are generated.

A novel method based on reactive Tabu search (RTS) for volt/Var control in electric power distribution systems is proposed, and its comparison with traditional Tabu search (TS) is given. In RTS scheme, the appropriate size of the Tabu list is learned automatically through reactive mechanism, thus the problem of TS's complex parameter tuning for efficient search is resolved. Combined with the escape mechanism, the approach can escape from the local optimum and avoid the probability...

A novel method based on reactive Tabu search (RTS) for volt/Var control in electric power distribution systems is proposed, and its comparison with traditional Tabu search (TS) is given. In RTS scheme, the appropriate size of the Tabu list is learned automatically through reactive mechanism, thus the problem of TS's complex parameter tuning for efficient search is resolved. Combined with the escape mechanism, the approach can escape from the local optimum and avoid the probability of being trapped in large cycle in TS. Results of simulations on two typical distribution systems indicate the invalidity of RTS and its advantages in flexibility and effectiveness over TS.

A new method based on reactive tabu search (RTS) is proposed for volt/var control in electric power distribution systems. Given the day-ahead load forecast, a feasible initial solution for RTS is provided heuristically. In RTS scheme, the appropriate size of the tabu list is learned automatically via reactive mechanism combined with reactive and escape mechanism, thus the approach quickly approximates to the global optimum without being trapped at the local optimum. The results of practical...

A new method based on reactive tabu search (RTS) is proposed for volt/var control in electric power distribution systems. Given the day-ahead load forecast, a feasible initial solution for RTS is provided heuristically. In RTS scheme, the appropriate size of the tabu list is learned automatically via reactive mechanism combined with reactive and escape mechanism, thus the approach quickly approximates to the global optimum without being trapped at the local optimum. The results of practical system simulations verify the proposed method and its advantages in solution rate and effectiveness over the conventional tabu search, genetic algorithm (GA), and simulated annealing (SA). The computing time of RTS is at most half of SA's and GA's.

The model for vehicle routing with time windows and backhauls under the time dependent was presented.In consideration of the conflict between the minimization of total travel time and the minimization of total tardy time,the bi-objective problem was converted into single objective problem by weighted method.The algorithm for the vehicle routing in constant speed context was infeasible at time dependent speed context.The traditional optimization algorithm was improved and the two-phase method proposed.From the...

The model for vehicle routing with time windows and backhauls under the time dependent was presented.In consideration of the conflict between the minimization of total travel time and the minimization of total tardy time,the bi-objective problem was converted into single objective problem by weighted method.The algorithm for the vehicle routing in constant speed context was infeasible at time dependent speed context.The traditional optimization algorithm was improved and the two-phase method proposed.From the computational result,RTS(reactive tabu search) algorithm in the second phase was improved more when finding the solution in comparison with the algorithm in the first phase.A trade-off section between the two objectives can be formed according to weighted values.On the basis of the service demand,the decision-maker can choose appropriate weighted value in this section to attain the feasible vehicle scheduling solution.