Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
| Autor: | Cláudio Alves, José Manuel Valério de Carvalho, Telmo Pinto |
|---|---|
| Přispěvatelé: | Universidade do Minho |
| Rok vydání: | 2017 |
| Předmět: |
Mathematical optimization
021103 operations research Backhauls business.industry Applied Mathematics 0211 other engineering and technologies Loading constraints 02 engineering and technology Set (abstract data type) Delivery problems Vehicle routing problem 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics 020201 artificial intelligence & image processing Local search (optimization) Pickup Routing (electronic design automation) business Variable neighborhood search Routing Mathematics |
| Zdroj: | Repositório Científico de Acesso Aberto de Portugal Repositório Científico de Acesso Aberto de Portugal (RCAAP) instacron:RCAAP |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2017.03.015 |
| Popis: | 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. Supported by FEDER funding through the Programa Operacional Factores de Competitividade COMPETE and through the Portuguese Science and Technology Foundation (FCT): project UID/CEC/00319/2013 and grant SFRH/BD/73584/2010. info:eu-repo/semantics/publishedVersion |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect