MartinZone

programming experiments

1 2 3 4 5 6

TGoMaps

Use Google Maps service inside your Delphi application. Easy to use but extremely powerful. You will be able to draw markers, polylines, polygons, directions, kmllayers, labels and many more objects on your map. Many map events like mouse coordinates, polygon click, marker drag...and many many more.

TGoMaps LITE

A small version of TGoMaps with limitated features, FREE for NON-COMMERCIAL application. Try TGoMaps before buy it.

TSPSolver

VCL component to solver the Travelling Salesman Problem,a famous combinatorial optimization problem. 3 different algorithms 2 type of solution (from A to A and from A to B). Available also as DLL library (beta).

MapDown

Small Windows application to captures and assembles maps from most important map providers like Google Maps, Yahoor Maps, Microsoft Live Maps and OpenStreetMap. Create georeference maps for most important maps application like OziExplorer, Gps Tuner 5.x, GPSdash and CompeGPS.

MapDown VCL

MapDown VCL allow to your application captures and assembles maps from most important map providers like Google Maps, Yahoor Maps, Microsoft Live Maps and OpenStreetMap. Besides you will able to create georeference maps for most important maps application like OziExplorer, Gps Tuner 5.x, GPSdash and CompeGPS.

GoSuite

With GoSuite VCL you will use some Google service on your Delphi/C++ Builder application. Full support for Directions (calculates directions between locations), Elevation (provides elevation data for all locations on the surface of the eart) and Geocoding (converting addresses into geographic coordinates and vice versa) services. Use of Google Premier client code.

<< >> Play > Stop

Product Menu

Login

Home

Products

Developer tools

TSPSolver

Overview

With TSPSolver you will solver the Travelling Salesman Problem,a famous combinatorial optimization problem.

The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved.

The TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips. Slightly modified, it appears as a sub-problem in many areas, such as DNA sequencing. In these applications, the concept city represents, for example, customers, soldering points, or DNA fragments, and the concept distance represents travelling times or cost, or a similarity measure between DNA fragments. In many applications, additional constraints such as limited resources or time windows make the problem considerably harder.

Wikipedia

The Travelling Salesman Problem (TSP) is a problem in combinatorial optimization. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. TSPSolver can solve this problem with 2 different way:

find the route from an address A to an address B;
find the route from an address A to the same address A;

tsp

Features

These are the main TSPSolver:

find solution for 2 type of problem (from A to A and from A to B);
uses 3 different algorithms to find the best solution (genetic algorithm, fast algorithm and brute force fast algorithm);
available as Delphi and C++ Builder component or DLL library with limitated features (so you can be easily translate it for use on Visual Basic, C++, PowerBuilder, and other Windows development tools);

The DLL version is a BETA software and with limitatede features. Sometimes it can generate a "memory" exception if you stress it with many call. The Delphi/C++ builder component dosen't have this problem.

TRY IT NOW. Download a demo version of TSPSolver. The packege include both an application developed with the Delphi/C++ Builder component and an application developed with the DLL. NOTE: the trial DLL is about 800 Kb however the full DLL is very small (about 60 Kb).

TSPSolver features are already incorporated in TGoogleMaps component.

Supported Delphi and C++ Builder version

TSPSolver (the Delphi/C++ Builder component) should work with all the last version of Delphi and C++ Builder.

Comparative License Table

	Standard	Professional	Enterprise
Source files
Developer	1	1	All developers of a software house team.
Free update	unlimited	unlimited	unlimited
Free support	6 months	6 months	1 year
Price (euro)	35,00	99,00	contact me
NOTE: the price include both Delphi/C++ Builder version and DLL (beta and with limitated features!) version; free support only for Delphi/C++ Builder version;