Download all versions of chips-n-salsa JAR files with all dependencies
chips-n-salsa from group org.cicirello (version 2.8.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.8.0
Last update 05. March 2021
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.8.0
Last update 05. March 2021
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.7.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.7.0
Last update 25. February 2021
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.7.0
Last update 25. February 2021
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.6.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.6.0
Last update 25. January 2021
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.6.0
Last update 25. January 2021
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.5.2)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.5.2
Last update 11. November 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.5.2
Last update 11. November 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.5.1)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.5.1
Last update 05. November 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.5.1
Last update 05. November 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.5.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.5.0
Last update 02. November 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.5.0
Last update 02. November 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.4.1)
<p>Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.</p>
<p>Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.</p>
Artifact chips-n-salsa
Group org.cicirello
Version 2.4.1
Last update 15. October 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.4.1
Last update 15. October 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.4.0)
<p>Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.</p>
<p>Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.</p>
Artifact chips-n-salsa
Group org.cicirello
Version 2.4.0
Last update 15. October 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.4.0
Last update 15. October 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 2.3.0)
chips-n-salsa from group org.cicirello (version 2.2.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. The library most extensively supports
simulated annealing. It includes several classes for representing
solutions to a variety of optimization problems. For example, the
library includes a BitVector class that implements vectors of bits,
as well as classes for representing solutions to problems where we
are searching for an optimal vector of integers or reals. For each
of the built-in representations, the library provides the most common
mutation operators for generating random neighbors of candidate
solutions. Additionally, the library provides extensive support for
permutation optimization problems, including implementations of many
different mutation operators for permutations, and utilizing the
efficiently implemented Permutation class of the JavaPermutationTools
(JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
Artifact chips-n-salsa
Group org.cicirello
Version 2.2.0
Last update 24. September 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Group org.cicirello
Version 2.2.0
Last update 24. September 2020
Tags: customizable using restarts implementations supports optimal reals beyond temperature threads search initial accelerate hill creating problems support form searching adaptive portfolio random optimization concurrently many neighbors enabling constructive permutation each ways different additionally common most lengths self instances running extensively across algorithm execution extensive simpler length built classes chips restart implemented stochastic process including what implements bitvector library annealing integers solutions candidate salsa where type same more varying permutations parameters algorithms instance schedules such class efficiently providing integrating tune modified vectors optimize that climbers representing generated than multistart several example hybrid climber simulated generic other mutation well adapt includes solution metaheuristics sampling vector bits making operators representations types multiple forms parallel with javapermutationtools hybridizable provides problem generating iterative variety schedule which provided java local also utilizing
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 1
Dependencies jpt,
There are maybe transitive dependencies!
Page 4 from 5 (items total 42)