Noon-Bean Transformation

Version 1.0.0.0 (1.83 KB) by Neil
Noon-Bean Transformation to transform a GTSP instance to an ATSP instance
299 Downloads
Updated 25 Nov 2013

View License

The function is an implementation of the Noon-Bean Transformation to transform an instance of the Generalized Travelling Salesman Problem (GTSP) to an equivalent instance of the Asymmetric Travelling Salesman Problem (ATSP).

Definitions:
GTSP: Consider a graph with its vertices partitioned into mutually exclusive vertex sets. Find the shortest path that visits one vertex in each set.

The Noon Bean Transformation convert a GTSP instance into a ATSP instance such that the optimal solution to the ATSP can be used to extract the optimal solution to the GTSP.

Inputs:
1. Full adjacency matrix for the GTSP
2. Set Mapping

Outputs:
1. ATSP adjacency matrix

Cite As

Neil (2024). Noon-Bean Transformation (https://www.mathworks.com/matlabcentral/fileexchange/44467-noon-bean-transformation), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2012a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.0.0.0