Example Code

Travelling Salesman Problem- Brute Force Optimization Approach Using LabVIEW

Products and Environment

This section reflects the products and operating system used to create the example.

To download NI software, including the products shown below, visit ni.com/downloads.

    Software

  • LabVIEW

Code and Documents

Attachment

Overview:

This VI solves the so-called "Travelling Salesman" optimization problem for small or large sets of randomly generated points using an iterative brute-force method. 

 

Description:

The goal is to find the shortest path that visits each point only once and returns to the origin.  For more information on the problem itself, refer to Wikipedia or another reference that discusses the problem.

 

Requirements:

LabVIEW 2012( (or compatible))

 

Steps to Implement or Execute Code

1. Run the vi.

 

Notes:This program was built with two OpenG VIs, which are freely available for download, but if you do not wish to install the palettes, the missing functions (generate random integer within limits and factorial function) can be replaced with any equivalent series of functions

 

**This document has been updated to meet the current required format for the NI Code Exchange.**

 

Tom L.

Example code from the Example Code Exchange in the NI Community is licensed with the MIT license.

Comments
SwapsG
Member
Member
on

save for 2011 ver.

users
Member
Member
on

i have given  the numeric values of Kp and Ti parameters, how to find minimum IAE using brute force method in labview

武汉理工大学
Member
Member
on

   so cool, amazing, triple six~~