Algorithm design for the fleet sizing problem in grocery retail distribution
From the classical Vehicle Routing Problem (VRP) and other extensions as well, our research will focus on constraints within grocery retail distribution. Usually they are tackled in the literature as VRP with multiple compartments and multiple trip VRP. Furthermore, we will cope with time windows an...
| Autor principal: | |
|---|---|
| Formato: | masterThesis |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/121371 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/121371 |
| Resumo: | From the classical Vehicle Routing Problem (VRP) and other extensions as well, our research will focus on constraints within grocery retail distribution. Usually they are tackled in the literature as VRP with multiple compartments and multiple trip VRP. Furthermore, we will cope with time windows and other extensions. In addition, our problem will be stated and a solution proposal will be sketched, both considering heuristic and exact approaches. |
|---|