The Electric Capacitated Covering Tour Problem

Vol 51, 2019 - 107967
Trabalho completo (oral)
Download
Favorite this paper
How to cite this paper?
Abstract

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.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Programme
15:00 to 15:40 on 09/03/2019
UL06
Institutions
  • 1 Instituto de Computação / Universidade Estadual de Campinas
  • 2 Instituto de Computação - Unicamp
  • 3 UFC
Track
  • OC – Otimização Combinatória
Keywords
Electric capacitated covering tour problem
Green vehicle routing problem
Green logistics