DIFFERENTIAL EVOLUTION FOR SMALL TSPs WITH CONSTRAINTS

Abstract

This paper presents evolution algorithm for solving small (up to 32 nodes) traveling salesman problems with constraints. This new differential evolution algorithm with only two parameters the size of the population and the size of the generations use the Lehmer code of the permutation for the representation of populations. Experience with small instances of TSP with time windows and deadline TSP are discussed.

Topics

    1 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)