A deterministic annealing algorithm for simultaneous routing of loaded and empty containers

Abstract

This paper addresses a full truckload vehicle routing problem for transporting loaded and empty containers in drayage operations. The objective is to minimize first the number of trucks used and then the total distance traveled. Two solution approaches, a sequential and an integrated approach, are presented. A deterministic annealing algorithm is proposed to solve the problem. Results show that for both solution approaches good solutions are obtained in a small amount of time.