Advanced search
Start date
Betweenand

An algorithm for the electrical vehicle routin problem

Grant number: 18/25950-5
Support type:Scholarships in Brazil - Master
Effective date (Start): April 01, 2019
Effective date (End): August 31, 2020
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal researcher:Fábio Luiz Usberti
Grantee:Matheus Diógenes Andrade
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
Associated research grant:15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points, AP.TEM

Abstract

This research project intends to investigate the Green Vehicle Routing Problem (G-VRP), an NP-hard problem that generalizes the Vehicle Routing Problem (VRP), with the premiss that vehicles use alternative fuels which may have an impact on the vehicle autonomy. This research project has the objective to propose mathematical formulations with Mixed Integer Linear Programming (MILP) and a solution methodology for the G-VRP using the Variable Neighborhood Search (VNS) metaheuristic. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Academic Publications
(References retrieved automatically from State of São Paulo Research Institutions)
ANDRADE, Matheus Diógenes. Formulações para o problema de roteamento de veículos verdes. 2020. 111 f. Master's Dissertation - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação.

Please report errors in scientific publications list by writing to: cdi@fapesp.br.