Capacitated Open Vehicle Routing Problem with Time Couplings

Abstract

This paper presents a case study for a real-life Capacitated Open Vehicle Routing Problem with Time Windows problem. The goal function is the sum of travel times of all vehicles. The mathematical model of the problem is presented. In order to take specific road traffic regulations into account, additional time-couplings constraints are formualated. Two heuristic solving methods are proposed: a greedy algorithm and a tabu search metaheuristic. The methods are tested using data from a real-life forwarding company. The results indicate that tabu provides 3.8% improvement compared to the greedy method.