Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
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...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/53067 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/53067 |