Matheus Diógenes Andrade

ORCID: 0000-0003-2282-3238
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Vehicle Routing Optimization Methods
  • Transportation and Mobility Innovations
  • Urban and Freight Transport Logistics
  • Optimization and Packing Problems
  • Sustainable Supply Chain Management
  • Water resources management and optimization
  • Recycling and Waste Management Techniques
  • Transportation Planning and Optimization
  • Smart Parking Systems Research
  • Water-Energy-Food Nexus Studies
  • Electric Vehicles and Infrastructure
  • Electric Power System Optimization

Universidade Estadual de Campinas (UNICAMP)
2006-2023

Hospital de Clínicas da Unicamp
2020

Albert Einstein College of Medicine
2019

This paper is concerned with the performance of stochastic dynamic programming for long term hydrothermal scheduling. Different streamflow models progressively more complex have been considered in order to identify benefits increasing sophistication modeling on programming. The first and simplest model considers inflows given by their average values; second represents independent probability distribution functions; third adopts a Markov chain based lag-one periodical auto-regressive model....

10.1109/pmaps.2006.360203 article EN 2006-06-01

This work aims to investigate the Green Vehicle Routing Problem (G-VRP), which is an NP-Hard problem that generalizes (VRP) and integrates it with green logistics. In G-VRP, electric vehicles limited autonomy can be recharged at Alternative Fuel Stations (AFSs) keep visiting customers. research proposes MILP formulations, valid inequalities, preprocessing conditions.

10.5753/etc.2020.11086 article EN 2020-06-30

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

10.59254/sbpo-2019-106755 article EN Anais do Simpósio Brasileiro de Pesquisa Operacional 2019-01-01

10.14488/enegep2018_tn_sto_263_509_35186 article PT Anais ... Encontro Nacional de Engenharia de Produção/Anais do Encontro Nacional de Engenharia de Produção 2018-11-15

This work provides a theoretical study of the Green Vehicle Routing Problem (G-VRP), which is an NP-hard problem that generalizes (VRP) and integrates it with green logistics. In G-VRP, electric vehicles limited autonomy can recharge at Alternative Fuel Stations (AFSs) to keep visiting customers. was introduced by [3] approached later [4], [5], all consider consecutive AFSs visits are not allowed, i.e., solution cannot have edge between two AFSs. this work, G-VRP versions investigated, (i)...

10.1016/j.procs.2021.11.058 article EN Procedia Computer Science 2021-01-01
Coming Soon ...