The Electric Capacitated Covering Tour Problem

This paper proposes a new problem based on the classic Vehicle Routing Problem (VRP). The problem is called Electric Capacitated Covering Tour Problem (ECCTP) and model a situation where customers can be serviced remotely by covering and only electric vehicles are employed. The ECCTP integrates two research areas: the covering problems and the green logistics. The problem is modeled by Mixed Integer Linear Program (MILP) and solved by a constructive heuristic. A set of benchmark instances is proposed and computational experiments were conducted.