Export Ready — 

Algorithm design for the fleet sizing problem in grocery retail distribution

Bibliographic Details
Main Author: Tiago Miguel Ladeiras Beleza de Vasconcelos
Publication Date: 2019
Format: Master thesis
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://hdl.handle.net/10216/121371
Summary: 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.
id RCAP_353d9295cd6ee7676a048c1a16da4efd
oai_identifier_str oai:repositorio-aberto.up.pt:10216/121371
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Algorithm design for the fleet sizing problem in grocery retail distributionEngenharia electrotécnica, electrónica e informáticaElectrical engineering, Electronic engineering, Information engineeringFrom 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.2019-07-092019-07-09T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttps://hdl.handle.net/10216/121371TID:202595455engTiago Miguel Ladeiras Beleza de Vasconcelosinfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-02-27T19:17:55Zoai:repositorio-aberto.up.pt:10216/121371Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T23:13:51.716979Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Algorithm design for the fleet sizing problem in grocery retail distribution
title Algorithm design for the fleet sizing problem in grocery retail distribution
spellingShingle Algorithm design for the fleet sizing problem in grocery retail distribution
Tiago Miguel Ladeiras Beleza de Vasconcelos
Engenharia electrotécnica, electrónica e informática
Electrical engineering, Electronic engineering, Information engineering
title_short Algorithm design for the fleet sizing problem in grocery retail distribution
title_full Algorithm design for the fleet sizing problem in grocery retail distribution
title_fullStr Algorithm design for the fleet sizing problem in grocery retail distribution
title_full_unstemmed Algorithm design for the fleet sizing problem in grocery retail distribution
title_sort Algorithm design for the fleet sizing problem in grocery retail distribution
author Tiago Miguel Ladeiras Beleza de Vasconcelos
author_facet Tiago Miguel Ladeiras Beleza de Vasconcelos
author_role author
dc.contributor.author.fl_str_mv Tiago Miguel Ladeiras Beleza de Vasconcelos
dc.subject.por.fl_str_mv Engenharia electrotécnica, electrónica e informática
Electrical engineering, Electronic engineering, Information engineering
topic Engenharia electrotécnica, electrónica e informática
Electrical engineering, Electronic engineering, Information engineering
description 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.
publishDate 2019
dc.date.none.fl_str_mv 2019-07-09
2019-07-09T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/10216/121371
TID:202595455
url https://hdl.handle.net/10216/121371
identifier_str_mv TID:202595455
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833600065807056896

Similar Items