Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Vue Injector 3.3
Spectrum Analyzer pro Live 2019
Devart Excel Add-in for HubSpot 2.1
RentALLScript - Airbnb clone 2.2
SuiteCRM Theme Customization 7.11.6
iScripts NetMenus 3.1
iScripts EasyIndex 2.2
iScripts EasySnaps 2.0
Australia MyPost shipping For Magento 2 1.0.0
Australia Post eParcel For Magento 1.1.1
Source Control for SQL Server 2.0
Answers phpSoftPro 3.12
Exlcart 2.0
School College ERP 1.3.2
White-label Grocery Delivery App Solution 2.0
Top Code
EzBitmap 2.1
NES Rom Maker 1.0
Php-princess.net
Entrepreneur News Portal 1.6
PAWS 0.2
Top Rated
phpEnter 5.1.
Quick Maps For Dynamics CRM 3.1
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script 1.1
File ID: 87032






Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script 1.1
Download Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script 1.1http://www.mathworks.com/Report Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 5
Submit Rating:
Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script 1.1 Description
Description: 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 first point, and ends at the last point, but travels to a unique set of cities in between (none of them close their loops by returning to their starting points).

Each city is visited by exactly one salesman, except for the first and last.

License: Freeware

Related: salesman, cities, Point, Unique, Close, travels, Optimal, starts, Solution, finds, loops, visited, pointseach, returning, starting

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 5



More Similar Code

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 ends at the first point, but travels to a unique set of cities in between.

Except for the first, each city is visited by exactly...



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...



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...



The user has to supply the fixed ending points before the script can be ran.



The algorithm computes the optimal route from a fixed predetermined starting point to all other cities without returning to the starting point.



The user is presented with the near-optimal solution and performance chart in a dialog window.



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...



This program demonstrates the optimization by genetic algorithm to find the global maximum height for thee dimensional multiple peak surface. The GA operates by real coding method with elitism



The Genetic Algorithm Utility Library (or, GAUL for short) is a flexible programming library designed to aid in the development of applications that use genetic, or evolutionary, algorithms. It provides data structures and functions for handling...



Use the mixed-integer genetic algorithm to solve an engineering design problem.
Designs often require that components come from a list of available sizes. In this example, we show how the Genetic Algorithm can be used to find values for the...

User Review for Fixed Endpoints Open Multiple Traveling Salesmen Problem - Genetic Algorithm Script
- required fields
     

Please enter text on the image