| CitySwap | Its swaps two vertices randomly choosen |
| EdgeXover | Edge Crossover |
| EmptySelection | Special class that describes the case of no selection |
| moAlgo< EOT > | Description of an algorithm of the paradiseo-mo library |
| moAspirCrit< M > | Description of the conditions in which a tabu move could be accepted |
| moBestImprSelect< M > | One of the possible moMoveSelect |
| moCoolingSchedule | This class gives the description of a cooling schedule |
| moExponentialCoolingSchedule | One of the possible moCoolingSchedule |
| moFirstImprSelect< M > | One possible moMoveSelect |
| moFitSolContinue< EOT > | One possible stop criterion for a solution-based heuristic |
| moGenSolContinue< EOT > | One possible stop criterion for a solution-based heuristic |
| moHC< M > | Hill Climbing (HC) |
| moHCMoveLoopExpl< M > | Iterative explorer used by a moHC |
| moImprBestFitAspirCrit< M > | One of the possible moAspirCrit |
| moItRandNextMove< M > | One of the possible moNextMove |
| moLinearCoolingSchedule | One of the possible moCoolingSchedule |
| moLSCheckPoint< M > | Class which allows a checkpointing system |
| moMove< EOT > | Definition of a move |
| moMoveExpl< M > | Description of a move (moMove) explorer |
| moMoveIncrEval< M > | (generally) Efficient evaluation function based a move and a solution |
| moMoveInit< M > | Move (moMove) initializer |
| moMoveLoopExpl< M > | Class which describes an iterative explorer |
| moMoveSelect< M > | Class that describes a move selector (moMove) |
| moNextMove< M > | Class which allows to generate a new move (moMove) |
| moNoAspirCrit< M > | One of the possible aspiration criterion (moAspirCrit) |
| moNoFitImprSolContinue< EOT > | One possible stop criterion for a solution-based heuristic |
| moRandImprSelect< M > | One of the possible moMove selector (moMoveSelect) |
| moRandMove< M > | Random move generator |
| moSA< M > | Simulated Annealing (SA) |
| moSimpleMoveTabuList< M > | Class describing a move tabu list with a limited memory |
| moSimpleSolutionTabuList< M > | Class describing a solution tabu list with limited length |
| moSolContinue< EOT > | Class that describes a stop criterion for a solution-based heuristic |
| moSteadyFitSolContinue< EOT > | One possible stopping criterion for a solution-based heuristic |
| moTabuList< M > | Class describing a tabu list that a moTS uses |
| moTS< M > | Tabu Search (TS) |
| moTSMoveLoopExpl< M > | Explorer for a Tabu Search algorithm |
| OrderXover | Order Crossover |
| PartialMappedXover | Partial Mapped Crossover |
| PartRouteEval | Route Evaluator |
| PartTwoOptInit | It sets the first couple of edges |
| PartTwoOptNext | It updates a couple of edges |
| RouteEval | Route Evaluator |
| RouteInit | |
| TwoOpt | |
| TwoOptIncrEval | |
| TwoOptInit | It sets the first couple of edges |
| TwoOptNext | It updates a couple of edges |
| TwoOptRand | |
| TwoOptTabuList | The table of tabu movements, i.e |
1.4.7