The fixed destination MmTSP (multi-depot multiple travelling salesman problem) is an np hard problem, which can’t be solved in polynomial time. Against the traditional TSP problem here there are more travelling salesmen which seek out the cities. Every city is visited by once by any of the...

The aim of this technical report is to present some detailed explanations in order to help to understand and use the Message Passing Interface (MPI) parallel programming for solving several mixed integer optimization problems. We have developed a C++ experimental code that uses the IBM ILOG...