Optimal sequencing of skip collections and deliveries

Abstract

AbstractThe purpose of this paper is to model and solve a complex routing problem associated with the collection and delivery of skips. This study is motivated by a real-life problem encountered by a skip rental firm in Belgium. Two simple heuristics as well as an exact enumerative algorithm are developed for the problem. Computational experiments carried out on both randomly generated and real-life data confirm the efficiency of the proposed approach.Keywords: vehicle routingskipssavingstransportation problembranch-and-bound