The preemptive swapping problem on a tree

Networks ◽  
2011 ◽  
Vol 58 (2) ◽  
pp. 83-94 ◽  
Author(s):  
Shoshana Anily ◽  
Michel Gendreau ◽  
Gilbert Laporte
Keyword(s):  
Swapping Problem

The swapping problem

Networks ◽  
1992 ◽  
Vol 22 (4) ◽  
pp. 419-433 ◽  
Author(s):  
S. Anily ◽  
R. Hassin
Keyword(s):  
Swapping Problem

The Swapping Problem on a Line

1999 ◽  
Vol 29 (1) ◽  
pp. 327-335 ◽  
Author(s):  
Shoshana Anily ◽  
Michel Gendreau ◽  
Gilbert Laporte
Keyword(s):  
Swapping Problem

scholarly journals A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem

2010 ◽  
Vol 158 (15) ◽  
pp. 1599-1614 ◽  
Author(s):  
Güneş Erdoğan ◽  
Jean-François Cordeau ◽  
Gilbert Laporte
Keyword(s):  
Branch And Cut ◽  
Swapping Problem

scholarly journals An Improved Crow Search Algorithm Applied to the Phase Swapping Problem in Asymmetric Distribution Systems

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1329
Author(s):  
Brandon Cortés-Caicedo ◽  
Laura Sofía Avellaneda-Gómez ◽  
Oscar Danilo Montoya ◽  
Lázaro Alvarado-Barrios ◽  
César Álvarez-Arroyo
Keyword(s):  
Power Flow ◽  
Distribution Systems ◽  
System Analysis ◽  
Programming Model ◽  
Search Algorithm ◽  
Mixed Integer ◽  
Asymmetric Distribution ◽  
Nonlinear Programming Model ◽  
Gaussian Probability Distribution ◽  
Swapping Problem

This paper discusses the power loss minimization problem in asymmetric distribution systems (ADS) based on phase swapping. This problem is presented using a mixed-integer nonlinear programming model, which is resolved by applying a master–slave methodology. The master stage consists of an improved version of the crow search algorithm. This stage is based on the generation of candidate solutions using a normal Gaussian probability distribution. The master stage is responsible for providing the connection settings for the system loads using integer coding. The slave stage uses a power flow for ADSs based on the three-phase version of the iterative sweep method, which is used to determine the network power losses for each load connection supplied by the master stage. Numerical results on the 8-, 25-, and 37-node test systems show the efficiency of the proposed approach when compared to the classical version of the crow search algorithm, the Chu and Beasley genetic algorithm, and the vortex search algorithm. All simulations were obtained using MATLAB and validated in the DigSILENT power system analysis software.

A branch-and-cut algorithm for the preemptive swapping problem

Networks ◽  
2011 ◽  
Vol 59 (4) ◽  
pp. 387-399 ◽  
Author(s):  
Charles Bordenave ◽  
Michel Gendreau ◽  
G. Laporte
Keyword(s):  
Branch And Cut ◽  
Swapping Problem

The Time Complexity of the Token Swapping Problem and Its Parallel Variants

2017 ◽  
pp. 448-459 ◽  
Author(s):  
Jun Kawahara ◽  
Toshiki Saitoh ◽  
Ryo Yoshinaka
Keyword(s):  
Time Complexity ◽  
Swapping Problem

A branch-and-cut algorithm for the nonpreemptive swapping problem

2009 ◽  
Vol 56 (5) ◽  
pp. 478-486 ◽  
Author(s):  
Charles Bordenave ◽  
Michel Gendreau ◽  
Gilbert Laporte
Keyword(s):  
Branch And Cut ◽  
Swapping Problem

Heuristics for the mixed swapping problem

2010 ◽  
Vol 37 (1) ◽  
pp. 108-114 ◽  
Author(s):  
Charles Bordenave ◽  
Michel Gendreau ◽  
Gilbert Laporte
Keyword(s):  
Swapping Problem

scholarly journals The uncapacitated swapping problem on a line and on a circle

2013 ◽  
Vol 161 (4-5) ◽  
pp. 454-465 ◽  
Author(s):  
Shoshana Anily ◽  
Aharona Pfeffer
Keyword(s):  
Swapping Problem
Sign in / Sign up

Export Citation Format

Share Document