Research Article

Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages

Algorithm 6

Crossovers class ADT.
1  class Crossovers
2  {
3  public:
4  CrossoversGraph(Graph  );
  //Original greedy crossovers function definition.
5  void GX(Tour  , Tour  , Tour  );
  //Another version of greedy crossovers function definition [17, 21].
6  void GX_4(Tour  , Tour  , Tour  );
  //Function definition of another version of GX [17, 21].
7  void GX_4_Pool(Tour  , Tour  , Tour  );
  /  lines  8  to  15  show proposed function definitions of crossovers that proposed in
  [3, 5, 16, 20, 21, 23, 24]  respectively./
8  void VGX(Tour  , Tour  , Tour  );
9  void IGX(Tour  , Tour  , Tour  );
10void DPX(Tour  , Tour  , Tour  );
11void GSX(Tour  , Tour  , Tour  );
12void OX(Tour  , Tour  , Tour  , Tour  );
13void PMX(Tour  , Tour  , Tour  , Tour  );
14void EPMX(Tour  , Tour  , Tour  , Tour  );
15};