Search Results for "tabu search heuristic"
Sort By:
Showing 30 open source projects for "tabu search heuristic"
View related business solutions-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Grey Wolf Optimizer for Path Planning
Grey Wolf Optimizer (GWO) path planning/trajectory
...It includes progress visualization to help monitor the optimization process during simulations. Users can adjust objective function weights and experiment with multiple heuristic search strategies to explore optimal solutions. This project demonstrates applications in multi-agent and multi-UAV cooperative path planning, making it useful for research and educational purposes in the field of intelligent optimization and robotics. -
2
StringZilla
10x faster string search, split, sort, and shuffle for long strings
StringZilla is the Godzilla of string libraries, splitting, sorting, and shuffling large textual datasets. StringZilla uses a heuristic so simple it's almost stupid... but it works. It matches the first few letters of words with hyper-scalar code to achieve memcpy speeds. The implementation fits into a single C 99 header file and uses different SIMD flavors and SWAR on older platforms. The Str is designed to replace long Python str strings and wrap our C-level API. On the other hand, the... -
3
Electronic Circuit Optimization
Optimer: a SPICE base electrical/ electronic circuit optimization tool
This project is dedicated to the optimization of (any) electrical and electronic circuits and components using evolutionary and heuristic algorithms incorporated with SPICE simulators (such as HSPICE, ngSPICE, etc.). We provide Optimer, which is a user graphical interface for circuit design and optimization. Website: https://www.circuitoptimization.com/ E-mail: contact@circuitoptimization.com/ -
4
mssolutions
Makes magic squares.
These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or... -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
Adaptive Search
Adaptive Search is a constraint-based Local Search method.
...For each constraint, an error function needs to be defined: it gives, for each tuple of variable values (i.e., a variable assignment), an indication on how much the constraint is violated. The algorithm also uses a short-term adaptive memory in the spirit of Tabu Search to avoid stagnation in local minima and loops. This archive contains the source code of sequential and parallel versions of the Adaptive Search algorithm and its specialization on several examples. -
6
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. ... -
7
PakoSearch64
Quick file search tool
Multi tool for searching files in your disks even without connecting them. Performs FAST keyword and normal searches, shows up duplicated or similar files in a multi panel dialog. All operations done in RAM for the fastest search possible. Uses heuristic algorithms (HAL), TWorm (indexes) and keyword processing to achieve results in some microseconds, 5 magnitude orders fast than typical searchs. Technology written from scratch by the author. It can handle huge filename spaces, and supports pathname/filename lengths upto 8Kbyte (not supported on all filesystems). ... -
8
A collection of open source and public domain software for Java, XML, and Cocoa, primarily. Some projects: ThreadWorker, Xmlizable, Base64, Tabu Search.
-
9
Steepest-descent-like search algorithm
Heuristic search to find 21-variable PW type functions with NL>1047552
(by S. Kavut and S. Maitra) 1) The file "pw21_nlac.zip" contains the source code which computes the nonlinearity and absolute indicator of 21-variable PW type functions obtained from the 4 solutions in Table 1 of our paper (available at http://eprint.iacr.org/2015/1036). See comments in "pw21_nlac.cpp" in the zipped file for details. 2) Steepest-descent-like iterative search algorithm used in the same paper is implemented using the files in "sdl_algo.zip" which are briefly described... -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
Piggydb
Piggydb helps you have more fun with knowledge creation.
Piggydb is a flexible and scalable knowledge building platform that supports a heuristic or bottom-up approach to discover new concepts or ideas based on your input. You can begin with using it as a flexible outliner, diary or notebook, and as your database grows, Piggydb helps you to shape or elaborate your own knowledge. Piggydb is a Web application provided as a self-contained package that contains a Web server and database engine. With Piggydb, you can create highly structured content... -
11
HH-Evolver
A framework for domain-specific, hyper-heuristic evolution
HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain. -
12
codonPhyML uses Markovian codon models of evolution in phylogeny reconstruction. Given a set of species characterized by their DNA sequences as input, codonPhyML will return the phylogenetic tree that best describes their evolutionary relationship. Our paper describing codonPhyML has been published in the journal "Molecular Biology and Evolution" (MBE). For more details, follow the link: http://mbe.oxfordjournals.org/content/30/6/1270. codonPhyML is on the cover of MBE! Check this out...
-
13
JConstraints
Java Framework to implement solutions to solve constraints problems
...Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety of Backjumping algorithms; - A variety of arc-consistency algorithms; - Local search algorithm; - Tabu search algorithm; - Maximize solutions: comming soon; - Minimize solutions: comming soon; The Framework also enables heuristic injections so that the developers can achieve greater performance of algorithms using their own heuristics. Version 1.0: Released! Version 1.1: Coming soon See the tutorial in the Wiki page to learn how to use this Framework. -
14
...The online version of FrameBot is available on http://fungene.cme.msu.edu/FunGenePipeline, tutorial http://rdp.cme.msu.edu/tutorials/framebot/RDPtutorial_FRAMEBOT.html. Updates: FrameBot now uses a kmer pre-filtering heuristic for no-metric-search. This pre-filtering may increase the speed by one to two orders of magnitude. CITATION: Wang, Q., Quensen, J. F., Fish, J. A., Lee, T. K., Sun, Y., Tiedje, J. M., and Cole, J. R. 2013. Ecological patterns of nifH genes in four terrestrial climatic zones explored with targeted metagenomics using FrameBot, a new informatics tool. mBio 4:e00592-13.
-
15
Search Agents - a framework for collaboration of meta-heuristic agents
-
16
Clever Algorithms
Clever Algorithms: Nature-Inspired Programming Recipes
...Each entry follows a consistent template: motivation, strategy, pseudocode, parameter choices, variations, and references, making it easy to compare approaches. The catalog spans evolutionary algorithms, swarm intelligence, immune systems, simulated annealing, tabu search, and other metaheuristics, plus guidance on when and how to tune them. Example implementations and worked problems show how to encode solutions, define fitness, and balance exploration with exploitation. The emphasis is on pragmatism—enough theory to understand why an algorithm works, and enough detail to get it running in your environment. ... -
17
UPPAAL PARMOS
A tool for parametric model checking of UPPAAL models.
UPPAAL PARMOS (UP) is a parameter sweep application built specifically for UPPAAL, with the ability to distribute parameter sweeps across multiple computing resources, such as large clusters or cloud computing resources. UP also provides the ability to direct the parameter sweep using multi-objective heuristic search algorithms to reach optimal or near optimal parameters faster. UP is expandable through the use of plug-ins, with regards to both types of computing resources and search algorithms, and the ability to change storage type is partly implemented. -
18
J-VRPsolver
Solve VRP with 1 warehouse and 1 vehicle type
a simple and effective vehicle routing problem’s solger using metaheuristic algorithms's like Tabu Search and Clark'n Wright. It's specialized in single deposit and singe vehicle's capacity VRP's istances. [mainly for educational purposes] -
19
Heuristic Goal-seeking Framework
Fifteen puzzle, with its own goal-seeking to find the best solution
This project implements the "fifteen puzzle", but it has a twist: the program can solve the puzzle perfectly. The project contains a simple JAVA framework that implements heuristic goal-seeking algorithms. We use this to search for the best solution, but the framework is general-purpose and can be used for similar one-person puzzles. Using this framework will allow developers to focus on a specific domain of interest, while leaving many of the AI concepts and goal-searching concepts to be implemented by the framework The front-end classes use Swing and thus can be run via the Web. ... -
20
Project aims at developing KNIME nodes, which provide tools for solving optimization problems, like TSP and function optimization. Two metaheuristic are available: Tabu Search and Simulated Annealing. Now we are working on: Evolutionary Algorithm.
-
21
SwarmQAP is a Java library of swarm intelligence algorithms for the Quadratic Assignment Problem. Currently, it implements Tabu Search, MAX-MIN Ant System and Consultant-Guided Search algorithms.
-
22
The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.
-
23
XSY# is an open source project to implement multi-formalisms such as Discrete Event System Specification (DEVS) as well as meta-heuristic search techniques such as Genetic Algorithms.
-
24
TabuMusic is a simple program that generates music based on a Tabu Search Metaheuristic. The parameters are given in an input.txt file and the output is an ABC file, which can easily be converted in a MIDI file. Shows promissing results... E-mail me if y
-
25
heuristics is an adaptive heuristic algorithms library written in C++. It features implementations for the Taboo-Search, Genetic-Search, and Simulated Annealing.
