In an ideal situation the requirements for a software system should be completely and unambiguously determined before design, coding and testing take place.

ABSTRACT

ABSTRACT

Abstract. Optimal results for the Traveling Salesrep Problem havebeen reported on problems with up to 3038 cities using a GA with Edge Assembly Crossover EAX . This paper rst attempts to independently replicate these results on Padberg's 532 city problem. We then evaluate the performance contribution of the various algorithm components. The incorporation of 2-opt into the EAX GA is also explored. Finally, comparative results are presented for a population-based form of 2-opt that uses partial restarts.

No abstract