Parallel Distributed Branch and bound solution in rmi PDF

Running head: PARALLEL DISTRIBUTED BRANCH-AND-BOUND SOLUTION IN RMI
Solving TSP with java’s Remote Invocation Method
Name of student:
University:

Running head: PARALLEL DISTRIBUTED BRANCH-AND-BOUND SOLUTION IN RMI
Solving TSP with java’s Remote Invocation Method
This project involves solving the travelling salesman problem using branch and bound
algorithm. It is implemented in the Java programming language, making use of the Remote
Method invocation API for creating distributed applications. It was implemented on a local
network with eight clients and one server. There are two processes involved; the Server and the
client. Communication from the client to the server is through a java predefined class called a
stub class (Benmammar, B. 2018). An rmic compiler is used to compile the stub class. The
compilation is done on the server. Each client must have access to the stub class. The GUI class
is included to enable the user of the server processor to input the distances between cities and to
calculate the cost of travelling from one city to the next until the salesman returns to the starting
city. Below is the source code of each of the respective classes
TSP Class (server class) code
The following screenshots show the actual source code implementation for the server class.

Running head: PARALLEL DISTRIBUTED BRANCH-AND-BOUND SOLUTION IN RMI

Running head: PARALLEL DISTRIBUTED BRANCH-AND-BOUND SOLUTION IN RMI