Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/53067
Título: | Variable neighborhood search algorithms for pickup and delivery problems with loading constraints |
Autor(es): | Pinto, Telmo Alves, Cláudio Valério de Carvalho, José Manuel |
Palavras-chave: | Backhauls Loading constraints Routing Variable neighborhood search |
Data: | Abr-2017 |
Editora: | Elsevier B.V. |
Revista: | Electronic Notes in Discrete Mathematics |
Resumo(s): | In this paper, we explore a capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls. The problem belongs to the subclass of pickup and delivery problems. To solve this problem, we describe a set of variable neighborhood search approaches whose shaking and local search phases rely on different neighborhood structures. Some of these structures were specially developed for this problem. All the strategies were implemented and exhaustively tested. The results of this computational study are discussed at the end of this paper. |
Tipo: | Artigo |
URI: | https://hdl.handle.net/1822/53067 |
DOI: | 10.1016/j.endm.2017.03.015 |
ISSN: | 1571-0653 |
Versão da editora: | https://www.sciencedirect.com/science/article/pii/S1571065317300513 |
Arbitragem científica: | yes |
Acesso: | Acesso restrito autor |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
VNS for pdp with loading constraints.pdf Acesso restrito! | 135,1 kB | Adobe PDF | Ver/Abrir |