Paper Info
Title
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints.
Abstract
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.
Year
DOI
Venue
2017
10.1016/j.endm.2017.03.015
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
Routing,loading constraints,backhauls,variable neighborhood search
Vehicle routing problem,Mathematical optimization,Variable neighborhood search,Local search (optimization),Pickup,Mathematics,Delivery problems
Journal
Volume
ISSN
Citations 
58
1571-0653
2
PageRank 
References 
Authors
0.38
4
3
Name
Order
Citations
PageRank
Telmo Pinto1192.51
Cláudio Alves218416.29
José M. Valério De Carvalho316814.06