pycombinatorial 2.2.3__tar.gz → 2.2.4__tar.gz

{pycombinatorial-2.2.3/pycombinatorial.egg-info → pycombinatorial-2.2.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pycombinatorial
-Version: 2.2.3
+Version: 2.2.4
 Summary: A library to solve TSP (Travelling Salesman Problem) using Exact Algorithms, Heuristics, Metaheuristics and Reinforcement Learning
 Home-page: https://github.com/Valdecy/pyCombinatorial
 Author: Valdecy Pereira
@@ -36,7 +36,7 @@ _This Google Colab Demo is intended for quick demos only. For the best experienc
 
 **pyCombinatorial** is a Python-based library designed to tackle the classic Traveling Salesman Problem (TSP) through a diverse set of **Exact Algorithms**, **Heuristics**, **Metaheuristics**, and **Reinforcement Learning**. It brings together well-established and cutting-edge methodologies, offering end users a flexible toolkit to generate high-quality solutions for TSP instances of varying sizes and complexities.   
 
-Techniques: **2-opt**; **2.5-opt**; **3-opt**; **4-opt**; **5-opt**; **Or-opt**; **2-opt Stochastic**; **2.5-opt Stochastic**; **3-opt Stochastic**; **4-opt Stochastic**; **5-opt Stochastic**; **Ant Colony Optimization**; **Adaptive Large Neighborhood Search**; **Bellman-Held-Karp Exact Algorithm**; **Bitonic Tour**; **Branch & Bound**; **BRKGA** (Biased Random Key Genetic Algorithm); **Brute Force**; **Cheapest Insertion**; **Christofides Algorithm**; **Clarke & Wright**  (Savings Heuristic); **Concave Hull Algorithm**; **Convex Hull Algorithm**; **Elastic Net**; **Extremal Optimization**; **Farthest Insertion**; **FRNN** (Fixed Radius Near Neighbor); **Genetic Algorithm**; **GA-EAX (Genetic Algorithm with Edge Assembly Crossover)**; **GRASP** (Greedy Randomized Adaptive Search Procedure); **Greedy Karp-Steele Patching**; **Guided Search**; **Hopfield Network**; **Iterated Search**; **Karp-Steele Patching**;  **Large Neighborhood Search**; **Multifragment Heuristic**; **Nearest Insertion**; **Nearest Neighbour**; **Random Insertion**; **Random Tour**; **Randomized Spectral Seriation**; **RL Q-Learning**; **RL Double Q-Learning**; **RL S.A.R.S.A** (State Action Reward State Action); **Ruin & Recreate**; **Scatter Search**; **Simulated Annealing**; **SOM** (Self Organizing Maps); **Space Filling Curve** (Hilbert); **Space Filling Curve** (Morton); **Space Filling Curve** (Sierpinski); **Spectral Seriation Initializer**; **Stochastic Hill Climbing**; **Sweep**; **Tabu Search**; **Truncated Branch & Bound**; **Twice-Around the Tree Algorithm** (Double Tree Algorithm); **Variable Neighborhood Search**; **Zero Suffix Method**.
+Techniques: **2-opt**; **2.5-opt**; **3-opt**; **4-opt**; **5-opt**; **Or-opt**; **2-opt Stochastic**; **2.5-opt Stochastic**; **3-opt Stochastic**; **4-opt Stochastic**; **5-opt Stochastic**; **Ant Colony Optimization**; **Adaptive Large Neighborhood Search**; **Bellman-Held-Karp Exact Algorithm**; **Bitonic Tour**; **Branch & Bound**; **BRKGA** (Biased Random Key Genetic Algorithm); **Brute Force**; **Cheapest Insertion**; **Christofides Algorithm**; **Clarke & Wright**  (Savings Heuristic); **Concave Hull Algorithm**; **Convex Hull Algorithm**; **Elastic Net**; **Extremal Optimization**; **Farthest Insertion**; **FRNN** (Fixed Radius Near Neighbor); **Genetic Algorithm**; **GA-EAX** (Genetic Algorithm with Edge Assembly Crossover); **GRASP** (Greedy Randomized Adaptive Search Procedure); **Greedy Karp-Steele Patching**; **Guided Search**; **Hopfield Network**; **Iterated Search**; **Karp-Steele Patching**;  **Large Neighborhood Search**; **LKH** (Lin-Kernighan-Helsgaun); **Multifragment Heuristic**; **Nearest Insertion**; **Nearest Neighbour**; **Random Insertion**; **Random Tour**; **Randomized Spectral Seriation**; **RL Q-Learning**; **RL Double Q-Learning**; **RL S.A.R.S.A** (State Action Reward State Action); **Ruin & Recreate**; **Scatter Search**; **Simulated Annealing**; **SOM** (Self Organizing Maps); **Space Filling Curve** (Hilbert); **Space Filling Curve** (Morton); **Space Filling Curve** (Sierpinski); **Spectral Seriation Initializer**; **Stochastic Hill Climbing**; **Sweep**; **Tabu Search**; **Truncated Branch & Bound**; **Twice-Around the Tree Algorithm** (Double Tree Algorithm); **Variable Neighborhood Search**; **Zero Suffix Method**.
 
 ## Usage
 
@@ -128,6 +128,7 @@ print('Total Distance: ', round(distance, 2))
 - Iterated Search ([ Colab Demo ](https://colab.research.google.com/drive/1U3sPpknulwsCUQq9mK7Ywfb8ap2GIXZv?usp=sharing)) ( [ Paper ](https://doi.org/10.1063/1.36219)) 
 - Karp-Steele Patching ([ Colab Demo ](https://colab.research.google.com/drive/12xLLDNIk6OOSNQXqYSYtdwhupZ9Kt5xb?usp=sharing)) ( [ Paper ](https://doi.org/10.1137/0208045))
 - Large Neighborhood Search ([ Colab Demo ](https://colab.research.google.com/drive/1t4cafHRRzOLN4xth96jE-2qHoPQOLsn5?usp=sharing)) ( [ Paper ](https://doi.org/10.1007/3-540-49481-2_30))
+- Lin-Kernighan-Helsgaun ([ Colab Demo ](https://colab.research.google.com/drive/1jYtOGgz0nv294GvaDpiPfTkUP4aljd58?usp=sharing)) ( [ Paper ](https://doi.org/10.1016/S0377-2217(99)00284-2))
 - Multifragment Heuristic ([ Colab Demo ](https://colab.research.google.com/drive/1YNHVjS6P35bAnqGZyP7ERNrTnG9tNuhF?usp=sharing)) ( [ Paper ](https://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=08D176AEFA57EF1941645F2B31DF1686?doi=10.1.1.92.1635&rep=rep1&type=pdf))
 - Nearest Insertion ([ Colab Demo ](https://colab.research.google.com/drive/1R4mz604EG-unKktu8ON_Hpoywi3OIRHK?usp=sharing)) ( [ Paper ](https://disco.ethz.ch/courses/fs16/podc/readingAssignment/1.pdf))
 - Nearest Neighbour ([ Colab Demo ](https://colab.research.google.com/drive/1aL1kYXgSjUJYPfYSMy_0SWq4hJ3nrueJ?usp=sharing)) ( [ Paper ](https://doi.org/10.1016/S0166-218X(01)00195-0))

{pycombinatorial-2.2.3 → pycombinatorial-2.2.4}/README.md

@@ -25,7 +25,7 @@ _This Google Colab Demo is intended for quick demos only. For the best experienc
 
 **pyCombinatorial** is a Python-based library designed to tackle the classic Traveling Salesman Problem (TSP) through a diverse set of **Exact Algorithms**, **Heuristics**, **Metaheuristics**, and **Reinforcement Learning**. It brings together well-established and cutting-edge methodologies, offering end users a flexible toolkit to generate high-quality solutions for TSP instances of varying sizes and complexities.   
 
-Techniques: **2-opt**; **2.5-opt**; **3-opt**; **4-opt**; **5-opt**; **Or-opt**; **2-opt Stochastic**; **2.5-opt Stochastic**; **3-opt Stochastic**; **4-opt Stochastic**; **5-opt Stochastic**; **Ant Colony Optimization**; **Adaptive Large Neighborhood Search**; **Bellman-Held-Karp Exact Algorithm**; **Bitonic Tour**; **Branch & Bound**; **BRKGA** (Biased Random Key Genetic Algorithm); **Brute Force**; **Cheapest Insertion**; **Christofides Algorithm**; **Clarke & Wright**  (Savings Heuristic); **Concave Hull Algorithm**; **Convex Hull Algorithm**; **Elastic Net**; **Extremal Optimization**; **Farthest Insertion**; **FRNN** (Fixed Radius Near Neighbor); **Genetic Algorithm**; **GA-EAX (Genetic Algorithm with Edge Assembly Crossover)**; **GRASP** (Greedy Randomized Adaptive Search Procedure); **Greedy Karp-Steele Patching**; **Guided Search**; **Hopfield Network**; **Iterated Search**; **Karp-Steele Patching**;  **Large Neighborhood Search**; **Multifragment Heuristic**; **Nearest Insertion**; **Nearest Neighbour**; **Random Insertion**; **Random Tour**; **Randomized Spectral Seriation**; **RL Q-Learning**; **RL Double Q-Learning**; **RL S.A.R.S.A** (State Action Reward State Action); **Ruin & Recreate**; **Scatter Search**; **Simulated Annealing**; **SOM** (Self Organizing Maps); **Space Filling Curve** (Hilbert); **Space Filling Curve** (Morton); **Space Filling Curve** (Sierpinski); **Spectral Seriation Initializer**; **Stochastic Hill Climbing**; **Sweep**; **Tabu Search**; **Truncated Branch & Bound**; **Twice-Around the Tree Algorithm** (Double Tree Algorithm); **Variable Neighborhood Search**; **Zero Suffix Method**.
+Techniques: **2-opt**; **2.5-opt**; **3-opt**; **4-opt**; **5-opt**; **Or-opt**; **2-opt Stochastic**; **2.5-opt Stochastic**; **3-opt Stochastic**; **4-opt Stochastic**; **5-opt Stochastic**; **Ant Colony Optimization**; **Adaptive Large Neighborhood Search**; **Bellman-Held-Karp Exact Algorithm**; **Bitonic Tour**; **Branch & Bound**; **BRKGA** (Biased Random Key Genetic Algorithm); **Brute Force**; **Cheapest Insertion**; **Christofides Algorithm**; **Clarke & Wright**  (Savings Heuristic); **Concave Hull Algorithm**; **Convex Hull Algorithm**; **Elastic Net**; **Extremal Optimization**; **Farthest Insertion**; **FRNN** (Fixed Radius Near Neighbor); **Genetic Algorithm**; **GA-EAX** (Genetic Algorithm with Edge Assembly Crossover); **GRASP** (Greedy Randomized Adaptive Search Procedure); **Greedy Karp-Steele Patching**; **Guided Search**; **Hopfield Network**; **Iterated Search**; **Karp-Steele Patching**;  **Large Neighborhood Search**; **LKH** (Lin-Kernighan-Helsgaun); **Multifragment Heuristic**; **Nearest Insertion**; **Nearest Neighbour**; **Random Insertion**; **Random Tour**; **Randomized Spectral Seriation**; **RL Q-Learning**; **RL Double Q-Learning**; **RL S.A.R.S.A** (State Action Reward State Action); **Ruin & Recreate**; **Scatter Search**; **Simulated Annealing**; **SOM** (Self Organizing Maps); **Space Filling Curve** (Hilbert); **Space Filling Curve** (Morton); **Space Filling Curve** (Sierpinski); **Spectral Seriation Initializer**; **Stochastic Hill Climbing**; **Sweep**; **Tabu Search**; **Truncated Branch & Bound**; **Twice-Around the Tree Algorithm** (Double Tree Algorithm); **Variable Neighborhood Search**; **Zero Suffix Method**.
 
 ## Usage
 
@@ -117,6 +117,7 @@ print('Total Distance: ', round(distance, 2))
 - Iterated Search ([ Colab Demo ](https://colab.research.google.com/drive/1U3sPpknulwsCUQq9mK7Ywfb8ap2GIXZv?usp=sharing)) ( [ Paper ](https://doi.org/10.1063/1.36219)) 
 - Karp-Steele Patching ([ Colab Demo ](https://colab.research.google.com/drive/12xLLDNIk6OOSNQXqYSYtdwhupZ9Kt5xb?usp=sharing)) ( [ Paper ](https://doi.org/10.1137/0208045))
 - Large Neighborhood Search ([ Colab Demo ](https://colab.research.google.com/drive/1t4cafHRRzOLN4xth96jE-2qHoPQOLsn5?usp=sharing)) ( [ Paper ](https://doi.org/10.1007/3-540-49481-2_30))
+- Lin-Kernighan-Helsgaun ([ Colab Demo ](https://colab.research.google.com/drive/1jYtOGgz0nv294GvaDpiPfTkUP4aljd58?usp=sharing)) ( [ Paper ](https://doi.org/10.1016/S0377-2217(99)00284-2))
 - Multifragment Heuristic ([ Colab Demo ](https://colab.research.google.com/drive/1YNHVjS6P35bAnqGZyP7ERNrTnG9tNuhF?usp=sharing)) ( [ Paper ](https://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=08D176AEFA57EF1941645F2B31DF1686?doi=10.1.1.92.1635&rep=rep1&type=pdf))
 - Nearest Insertion ([ Colab Demo ](https://colab.research.google.com/drive/1R4mz604EG-unKktu8ON_Hpoywi3OIRHK?usp=sharing)) ( [ Paper ](https://disco.ethz.ch/courses/fs16/podc/readingAssignment/1.pdf))
 - Nearest Neighbour ([ Colab Demo ](https://colab.research.google.com/drive/1aL1kYXgSjUJYPfYSMy_0SWq4hJ3nrueJ?usp=sharing)) ( [ Paper ](https://doi.org/10.1016/S0166-218X(01)00195-0))

{pycombinatorial-2.2.3 → pycombinatorial-2.2.4}/pyCombinatorial/algorithm/__init__.py

@@ -1,60 +1,61 @@
-from .aco          import ant_colony_optimization 
-from .alns         import adaptive_large_neighborhood_search
-from .bb           import branch_and_bound
-from .bf           import brute_force_analysis
-from .bhk          import bellman_held_karp_exact_algorithm
-from .brkga        import biased_random_key_genetic_algorithm
-from .bt           import bitonic_tour
-from .christofides import christofides_algorithm
-from .conc_hull    import concave_hull_algorithm
-from .conv_hull    import convex_hull_algorithm
-from .cw           import clarke_wright_savings
-from .eln          import elastic_net_tsp
-from .eo           import extremal_optimization
-from .frnn         import fixed_radius_nn
-from .ga           import genetic_algorithm
-from .ga_eax       import genetic_algorithm_edge_assembly_crossover
-from .grasp        import greedy_randomized_adaptive_search_procedure
-from .gksp         import greedy_karp_steele_patching
-from .hpn          import hopfield_network_tsp
-from .ins_c        import cheapest_insertion
-from .ins_f        import farthest_insertion
-from .ins_n        import nearest_insertion
-from .ins_r        import random_insertion
-from .ksp          import karp_steele_patching
-from .lns          import large_neighborhood_search
-from .mf           import  multifragment_heuristic
-from .nn           import nearest_neighbour
-from .opt_2        import local_search_2_opt
-from .opt_2_5      import local_search_2h_opt
-from .opt_3        import local_search_3_opt
-from .opt_4        import local_search_4_opt
-from .opt_5        import local_search_5_opt
-from .opt_or       import local_search_or_opt
-from .opt_2s       import local_search_2_opt_stochastic
-from .opt_2_5s     import local_search_2h_opt_stochastic
-from .opt_3s       import local_search_3_opt_stochastic
-from .opt_4s       import local_search_4_opt_stochastic
-from .opt_5s       import local_search_5_opt_stochastic
-from .rl_double_ql import double_q_learning
-from .rl_ql        import q_learning
-from .rl_sarsa     import sarsa
-from .rr           import ruin_and_recreate
-from .rss          import randomized_spectral_seriation
-from .rt           import random_tour
-from .s_gui        import guided_search
-from .s_itr        import iterated_search
-from .s_sct        import scatter_search
-from .s_shc        import stochastic_hill_climbing
-from .s_tabu       import tabu_search
-from .s_vns        import variable_neighborhood_search
-from .sa           import simulated_annealing_tsp
-from .som          import self_organizing_maps
-from .spfc_h       import space_filling_curve_h
-from .spfc_m       import space_filling_curve_m
-from .spfc_s       import space_filling_curve_s
-from .ssi          import spectral_seriation_initializer
-from .swp          import sweep
-from .tat          import tat_algorithm
-from .tbb          import truncated_branch_and_bound
-from .zs           import zero_suffix_method
+from .aco          import ant_colony_optimization 
+from .alns         import adaptive_large_neighborhood_search
+from .bb           import branch_and_bound
+from .bf           import brute_force_analysis
+from .bhk          import bellman_held_karp_exact_algorithm
+from .brkga        import biased_random_key_genetic_algorithm
+from .bt           import bitonic_tour
+from .christofides import christofides_algorithm
+from .conc_hull    import concave_hull_algorithm
+from .conv_hull    import convex_hull_algorithm
+from .cw           import clarke_wright_savings
+from .eln          import elastic_net_tsp
+from .eo           import extremal_optimization
+from .frnn         import fixed_radius_nn
+from .ga           import genetic_algorithm
+from .ga_eax       import genetic_algorithm_edge_assembly_crossover
+from .grasp        import greedy_randomized_adaptive_search_procedure
+from .gksp         import greedy_karp_steele_patching
+from .hpn          import hopfield_network_tsp
+from .ins_c        import cheapest_insertion
+from .ins_f        import farthest_insertion
+from .ins_n        import nearest_insertion
+from .ins_r        import random_insertion
+from .ksp          import karp_steele_patching
+from .lns          import large_neighborhood_search
+from .lkh          import lin_kernighan_helsgaun
+from .mf           import  multifragment_heuristic
+from .nn           import nearest_neighbour
+from .opt_2        import local_search_2_opt
+from .opt_2_5      import local_search_2h_opt
+from .opt_3        import local_search_3_opt
+from .opt_4        import local_search_4_opt
+from .opt_5        import local_search_5_opt
+from .opt_or       import local_search_or_opt
+from .opt_2s       import local_search_2_opt_stochastic
+from .opt_2_5s     import local_search_2h_opt_stochastic
+from .opt_3s       import local_search_3_opt_stochastic
+from .opt_4s       import local_search_4_opt_stochastic
+from .opt_5s       import local_search_5_opt_stochastic
+from .rl_double_ql import double_q_learning
+from .rl_ql        import q_learning
+from .rl_sarsa     import sarsa
+from .rr           import ruin_and_recreate
+from .rss          import randomized_spectral_seriation
+from .rt           import random_tour
+from .s_gui        import guided_search
+from .s_itr        import iterated_search
+from .s_sct        import scatter_search
+from .s_shc        import stochastic_hill_climbing
+from .s_tabu       import tabu_search
+from .s_vns        import variable_neighborhood_search
+from .sa           import simulated_annealing_tsp
+from .som          import self_organizing_maps
+from .spfc_h       import space_filling_curve_h
+from .spfc_m       import space_filling_curve_m
+from .spfc_s       import space_filling_curve_s
+from .ssi          import spectral_seriation_initializer
+from .swp          import sweep
+from .tat          import tat_algorithm
+from .tbb          import truncated_branch_and_bound
+from .zs           import zero_suffix_method