The Traveling Salesman Problem provides an opportunity to explore whether attempts to optimize an algorithm in fact succeed or fail. Attempted optimizations themselves have time penalties in their execution and those time penalties may be greater than the improvements provided to the algorithm. When approaching the Traveling Salesman Problem not as a graph traversal problem but as a backtrackin...

The double traveling salesman problem is a variation of the basic traveling salesman problem where targets can be reached by two salespersons operating in parallel. The real problem addressed by this work concerns the optimization of the harvest sequence for the two independent arms of a fruit-harvesting robot. This application poses further constraints, like a collision-avoidance function. The...

In this paper a one-machine scheduling model is analyzed where n different jobs are classified into K groups depending on which additional resource they require. The changeover time from one job to another consists of the removal time or of the set-up time of the two jobs. It is sequence-dependent in the sense that the change-over time is determined by whether or not the two jobs belong to the ...

In the recently published book on the Traveling Salesman Problem, half of Chapter 6 [18] is devoted to domination analysis (DA) of heuristics for the Traveling Salesman Problem. Another chapter [16] is a detailed overview of the whole area of DA. Both chapters are of considerable length. The purpose of this paper is to give a short introduction to results and applications of DA. While we do not...

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutatio...

In memory ofPaolo Camerini Local search is a well-known and a well·investigated solution approach for the traveling salesman problem. It is not obvious, however, how local search for the TSP has to be implemented efficiently when each city has to be visited within one or more given time windows.1bis is particularly true when parallel computer architectures are available. We consider these quest...

this paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. gaining an optimal s...

The Generalized Traveling Salesman Problem is one of a well known complex combinatorial optimization problems. Equality-Generalized Traveling Salesman Problem is a particular case of it. Themain objective of the problem it is to find a minimum cost tour passing through exactly one node from each cluster of a large-scale undirected graph. Multi-agent approaches are successfully used nowadays for...