Author(s)

E. Taniguchi, T. Yamada, M. Tamaishi & M. Noritake

Abstract

This paper presents a mathematical model developed for investigating the effects of designated time windows on urban pickup/delivery truck routing and scheduling. Three heuristic techniques, Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Search (TS) were applied to obtain approximate optimal solutions for the urban pickup/delivery truck routing and scheduling problem with time windows. The performance of each of these techniques was compared using a small road network. Each of these techniques generally produced good solutions within a short computation t

Keywords