Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search

Hoff, Arild; Løkketangen, Arne

doi:10.1007/s10100-006-0164-7

Cited by 20 publications

(16 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lasso solutions were found to be beneficial in combating the load-shuffling problem, because their structure means that free space is created on the initial deliveries-only route segment (Hoff and Løkketangen 2006).…”

Section: Research Issues In the Vrpddpmentioning

confidence: 99%

“…The experiments do not show a clear indication for the benefits of splitting. Hoff and Løkketangen (2006) investigated the TSPDDP with restricted mixing. In their model, a mixture of delivery and pickup goods is only allowed if there is sufficient free space to combat the loadshuffling problem.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The tabu search metaheuristic of Gribkovskaia et al (2007) is also modified to cater for this model. Hoff et al (2009) extend the model of Hoff and Løkketangen (2006) to the case of several vehicles. A tabu search metaheuristic creating lasso solutions is proposed based on the operators shift and swap, and 2-opt as postoptimiser.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Merging our lines of research in this paper and in Nagy, Wassan, and Salhi (2013), we wish to investigate the VRPDDP with restricted mixing. This model, introduced by Hoff and Løkketangen (2006), forces customers to be served separately to avoid situations where there is a mixture of delivery and pickup goods on board, but not enough space to have access to both kinds of goods.…”

Section: Conclusion and Suggestionsmentioning

confidence: 99%

See 3 more Smart Citations

The Vehicle Routing Problem with Divisible Deliveries and Pickups

Nagy

Wassan

Speranza

et al. 2015

Transportation Science

View full text Add to dashboard Cite

T he vehicle routing problem with divisible deliveries and pickups is a new and interesting model within reverse logistics. Each customer may have a pickup and delivery demand that have to be served with capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits. The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup and delivery quantities to be served separately with respect to the case where the quantities have to be served simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem structure and an average estimation of the savings due to the possibility of serving pickup and delivery quantities separately.

show abstract

Section: Research Issues In the Vrpddpmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Conclusion and Suggestionsmentioning

confidence: 99%

See 2 more Smart Citations

The Vehicle Routing Problem with Divisible Deliveries and Pickups

Nagy

Wassan

Speranza

et al. 2015

Transportation Science

View full text Add to dashboard Cite

show abstract

“…Customers along the loop are only visited once. Hoff and Løkketangen (2006) also study lasso solutions but restricted to the single vehicle case. They develop a tabu search algorithm on the basis of a 2-opt neighborhood.…”

Section: Divisible Delivery and Pickup (Tspddp Vrpddp)mentioning

confidence: 99%

A survey on pickup and delivery problems

Parragh

Doerner

Hartl

2008

Journal für Betriebswirtschaft

531

166

View full text Add to dashboard Cite

This paper is the first part of a comprehensive survey on pickup and delivery problems. Basically, two problem classes can be distinguished. The first class, discussed in this paper, deals with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. This class is denoted as Vehicle Routing Problems with Backhauls (VRPB). Four subtypes can be considered, namely the Vehicle Routing Problem with Clustered Backhauls (VRPCB -all linehauls before backhauls), the Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB -any sequence of linehauls and backhauls permitted), the Vehicle Routing Problem with Divisible Delivery and Pickup (VRPDDP -customers demanding delivery and pickup service can be visited twice), and the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP -customers demanding both services have to be visited exactly once). The second class, dealt with in the second part of this survey, refers to all those problems where goods are transported between pickup and delivery locations. These are the Pickup and Delivery Vehicle Routing Problem (PDVRP -unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP -paired pickup and delivery points), and the Dial-A-Ride Problem (DARP -passenger transportation between paired pickup and delivery points and user inconvenience taken into consideration). Single as well as multi vehicle versions of the mathematical problem formulations are given for all four VRPB types, the corresponding exact, heuristic, and metaheuristic solution methods are discussed. Zusammenfassung Der vorliegende Artikel ist Teil I einer umfassendenÜberblicks-arbeit in zwei Teilenüber pickup and delivery Probleme. Grundsätzlich können zwei Problemklassen unterschieden werden. Die erste Problemklasse, mit der sich dieser Artikel befasst, beinhaltet all jene Probleme, die Auslieferungen von einem Depot zu Auslieferungs-Kunden (linehaul customers) und Abholungen von Rück-ladungs-Kunden (backhaul customers) zu einem Depot behandeln. Diese Problemklasse wird im Folgenden als Vehicle Routing Problems with Backhauls (VRPB) bezeichnet. Vier verschiedene Problemtypen können weiters unterschieden werden: das Vehicle Routing Problem with Clustered Backhauls (VRPCB), alle Auslieferungen müssen vor den Abholungen durchgeführt werden, das Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB), gemischte Ausliefer-und Abholsequenzen sind gestattet, das Vehicle Routing Problem with Divisible Delivery and Pickup (VRPDDP), Kunden, die Ausliefer-und Abholservice verlangen, können zweimal besucht werden, und das Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP), Kunden, die beide Services verlangen, können nur genau einmal angefahren werden. Die zweite pickup and delivery Problemklasse wird in Teil II dieser Arbeit behandelt. Sie beinhaltet all jene Problemtypen, die sich mit Transporten zwischen Abhol-und Auslieferungsorten befassen: das Pickup and Delivery Vehicle Routing Problem (PD...

show abstract