Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/121371| Author(s): | Tiago Miguel Ladeiras Beleza de Vasconcelos |
| Title: | Algorithm design for the fleet sizing problem in grocery retail distribution |
| Issue Date: | 2019-07-09 |
| Abstract: | 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. |
| Subject: | Engenharia electrotécnica, electrónica e informática Electrical engineering, Electronic engineering, Information engineering |
| Scientific areas: | Ciências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática Engineering and technology::Electrical engineering, Electronic engineering, Information engineering |
| DOI: | 10.34626/mk2z-hq51 |
| TID identifier: | 202595455 |
| URI: | https://hdl.handle.net/10216/121371 |
| Document Type: | Dissertação |
| Rights: | openAccess |
| Appears in Collections: | FEUP - Dissertação |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 343998.pdf | Algorithm design for the fleet sizing problem in grocery retail distribution | 420.89 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.