Skip to content
Parallelization of travelling salesman problem using PyCSP
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.

Parallelization of travelling salesman problem (TSP) using PyCSP

Used as an example in the presentation: "Communicating Sequential Processes (CSP) - An alternative to the actor model"

The implementation models TSP as a complete, undirected weighted graph, and implements the branch-and-bound optimization. The parallelization uses a master-slave pattern, and requires Python 2.6 or 2.7.

How to run sequential version:

python <num_cities>, where

  • num_cities is number of cites/node in TSP
How to run parallel version:

python <num_cities><task depth><num workers>, where

  • num_cities is number of cities/nodes in TSP
  • task depth is the length of sub-routes the master will use as tasks in the parallelization. A larger task depth results in more tasks.
  • num workers is number of workers that will be spawned
  • iter1: Does not use branch-and-bound optimization in parallelization. Less complexity.
  • cluster: Minor modification for using the cluster module in PyCSP.
You can’t perform that action at this time.