Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem

Abstract

This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation and combinatorial optimization methods to improve the execution time in dynamic optimization problems. It allows obtaining new high quality solutions in subsequent iterations using… (More)
DOI: 10.1007/978-3-540-31996-2_17

Topics

8 Figures and Tables

Slides referencing similar topics