The impact of food perishability issues in the vehicle routing problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://repositorio.inesctec.pt/handle/123456789/3516 http://dx.doi.org/10.1016/j.cie.2013.11.006 |
Resumo: | Highly perishable food products can lose an important part of their value in the distribution process. We propose a novel multi-objective model that decouples the minimization of the distribution costs from the maximization of the freshness state of the delivered products. The main objective of the work is to examine the relation between distribution scenarios and the cost-freshness trade-off. Small size instances adapted from the vehicle routing problem with time windows are solved with an epsilon-constraint method and for large size instances a multi-objective evolutionary algorithm is implemented. The computational experiments show the conflicting nature of the two objectives. |
id |
RCAP_82056fcc912fda3b751c16f3ff2f4b64 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/3516 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
The impact of food perishability issues in the vehicle routing problemHighly perishable food products can lose an important part of their value in the distribution process. We propose a novel multi-objective model that decouples the minimization of the distribution costs from the maximization of the freshness state of the delivered products. The main objective of the work is to examine the relation between distribution scenarios and the cost-freshness trade-off. Small size instances adapted from the vehicle routing problem with time windows are solved with an epsilon-constraint method and for large size instances a multi-objective evolutionary algorithm is implemented. The computational experiments show the conflicting nature of the two objectives.2017-11-20T10:35:26Z2014-01-01T00:00:00Z2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/3516http://dx.doi.org/10.1016/j.cie.2013.11.006engPedro AmorimBernardo Almada-Loboinfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:57Zoai:repositorio.inesctec.pt:123456789/3516Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:50.015052Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
The impact of food perishability issues in the vehicle routing problem |
title |
The impact of food perishability issues in the vehicle routing problem |
spellingShingle |
The impact of food perishability issues in the vehicle routing problem Pedro Amorim |
title_short |
The impact of food perishability issues in the vehicle routing problem |
title_full |
The impact of food perishability issues in the vehicle routing problem |
title_fullStr |
The impact of food perishability issues in the vehicle routing problem |
title_full_unstemmed |
The impact of food perishability issues in the vehicle routing problem |
title_sort |
The impact of food perishability issues in the vehicle routing problem |
author |
Pedro Amorim |
author_facet |
Pedro Amorim Bernardo Almada-Lobo |
author_role |
author |
author2 |
Bernardo Almada-Lobo |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Pedro Amorim Bernardo Almada-Lobo |
description |
Highly perishable food products can lose an important part of their value in the distribution process. We propose a novel multi-objective model that decouples the minimization of the distribution costs from the maximization of the freshness state of the delivered products. The main objective of the work is to examine the relation between distribution scenarios and the cost-freshness trade-off. Small size instances adapted from the vehicle routing problem with time windows are solved with an epsilon-constraint method and for large size instances a multi-objective evolutionary algorithm is implemented. The computational experiments show the conflicting nature of the two objectives. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-01-01T00:00:00Z 2014 2017-11-20T10:35:26Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://repositorio.inesctec.pt/handle/123456789/3516 http://dx.doi.org/10.1016/j.cie.2013.11.006 |
url |
http://repositorio.inesctec.pt/handle/123456789/3516 http://dx.doi.org/10.1016/j.cie.2013.11.006 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131611929772032 |