A Genetic Algorithm with a Penalty Function in the Selective Travelling Salesman Problem on a Road Network

A Metaheuristic for the Bounded Single-Depot Multiple Traveling Repairmen Problem

“…The advantage of penalty technique is simple to implement. It is used to solve successfully many problem [21]. All infeasible solutions are penalized by a value.…”

Ant Colony Algorithm and Genetic Algorithm for Multiple Travelling Salesmen Problem

“…Then for the next generation most fit candidates are chosen. And when further mutation occurs the fitness of the next generation would increase [29]. There are several routines in application of GA like, crossover routine, measure of fitness routine, and a mutation routine.…”