Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

We study a variant of the Probabilistic Travelling Salesman Problem arising when retailers crowdsource last-mile deliveries to their own customers, who can refuse or accept in exchange for reward. A planner must identify which offer, knowing that all need fulfilment, either via crowdsourcing using retailer’s vehicle. formalise problem and position it both literature about among routing problems...

We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling s...