Tsp
Hornil StylePix is a lightweight and professional image editing software. Now, through it you can create PC, internet and mobile contents.
Convenient working environment
- Supports png, jpg, bmp, tif, gif, tga file formats and tsp(StylePix own file forma).
- Multi-level undo/redo...
Platforms: Windows
License: Freeware | Size: 2.07 MB | Download (249): Hornil StylePix Download |
The Legion of the Bouncy Castle Java Cryptography API provides a lightweight cryptography API in Java. A provider for the JCE and JCA, a clean-room implementation of the JCE 1.2.1, generators for Version 1 and Version 3 X.509 certificates, generators for Version 2 X.509 attribute certificates,...
Platforms: *nix
License: Freeware | Size: 21.2 MB | Download (171): Legion of the Bouncy Castle Java Cryptography API Download |
Hornil StylePix is a lightweight and professional image editing software. Now, through it you can create PC, internet and mobile contents.
Convenient working environment
- Supports png, jpg, bmp, tif, gif, tga file formats and tsp(StylePix own file forma).
- Multi-level undo/redo...
Platforms: Windows
License: Freeware | Size: 2.63 MB | Download (131): Hornil StylePix Portable Download |
Hornil StylePix, or simply StylePix, is a graphics editing program with a number of advanced features. Stylepix is an acronym for "Style Pictures". This means your pictures with nice style.
Hornil StylePix has intuitive user interface. It is designed to control the selected functions easy and...
Platforms: Windows
License: Freeware | Size: 2.22 MB | Download (62): Hornil StylePix RC Download |
The user has to supply the fixed ending points before the script can be ran. Requirements: - MATLAB 7.6 or higher
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (62): Fixed Endpoints Open Traveling Salesman Problem - Genetic Algorithm Download |
This method produces different results depending on what city is choosen as the starting point.This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes. Requirements: - MATLAB 7.6 or higher
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (60): Traveling Salesman Problem - Nearest Neighbor Download |
JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with...
Platforms: Windows
License: Freeware | Size: 4 MB | Download (59): JOpt.NET - Vehicle Routing Software Library Download |
JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum...
Platforms: Java
License: Freeware | Size: 102.4 KB | Download (56): JOpt.SDK - vehicle routing library Download |
JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with...
Platforms: Windows
License: Freeware | Size: 3.91 MB | Download (56): JOpt.NET - Vehicle Routing Software Libr Download |
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
Platforms: Windows, Mac, Linux
License: Freeware | Size: 6.41 MB | Download (55): NaruGo Go Game Java AI Download |
The script finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities and finally to the end location).Each salesman starts at the...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (54): Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Download |
Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to individual cities and back to the original starting place).Each salesman starts at the first point, and...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (54): Fixed Start/End Point Multiple Traveling Salesmen Problem - Genetic Algorithm Download |
Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (least distance needed for each salesman to travel from the start location to unique individual cities without returning to the starting location).Each salesman starts at the...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (53): Fixed Start Open Multiple Traveling Salesmen Problem - Genetic Algorithm Download |
The script can display how the route rearranges at each script iteration.The input for the program is an Nx2 cities array sorted in the initial traveling path. The output is the cities arranged in a more effective route, index vector of the order the cities should be visited & the total rout...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (52): Another TSP Solver Download |
The script can display how the route rearranges at each script iteration.The input for the program is an Nx2 cities array sorted in the initial traveling path.The output is the cities arranged in a more effective route, index vector of the order the cities should be visited & the total rout length.
Platforms: Matlab
License: Freeware | Size: 10 KB | Download (51): Another TSP Solver Script Download |
It finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations). Each salesman travels to...
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (50): Multiple Variable Traveling Salesmen Problem - Genetic Algorithm Download |
A modeling and simulation tool for Routing problems on Graphs, tccrouter is a java desktop application that provides a 2d map for building graphs and simulating a variety of real world routing solutions: Shortest path, TSP, VRP, VRP-TW.
Platforms: Windows, Mac, Linux
License: Freeware | Size: 3.44 MB | Download (49): tccrouter Download |
simulatedannealing() is an optimization routine for traveling salesman problem. Any dataset from the TSPLIB can be suitably modified and can be used with this routine. A detailed description about the function is included in "Simulated_Annealing_Support_Document.pdf."A GUI is used with the core...
Platforms: Matlab
License: Freeware | Size: 512 KB | Download (49): Traveling Salesman Problem (TSP) using Simulated Annealing Download |
The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point. Requirements: - MATLAB 7.6 or higher
Platforms: Windows, Mac, *nix, Matlab, BSD Solaris
License: Freeware | Download (49): Fixed Start Open Traveling Salesman Problem - Genetic Algorithm Download |
A tool to support individuals and teams using high-maturity, metrics-intensive project management methodologies [such as PSP(SM) and TSP(SM)]. Supports personal and team earned value tracking and forecasting; simplifies metrics collection and analysis.
Platforms: Windows, Mac, Linux
License: Freeware | Size: 13.68 MB | Download (47): Software Process Dashboard Download |