The vehicle routing problem with restricted mixing of deliveries and pickups

Nagy, Gábor; Wassan, Niaz A.; Salhi, Saı̈d

doi:10.1007/s10951-012-0296-7

Cited by 15 publications

(12 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As expected, we observe a decrease of the average solution quality with increasing restriction of the vehicle capacity in case of mixed loads. In Table 9, we provide an aggregated comparison of the results of our ALNS-PR on the VRPRMDP benchmarks Nagy-VRPRMDP1, Nagy-VRPRMDP2, and Nagy-VRPRMDP3 for 100%, 75%, 50%, 25%, and 10% of unavailable vehicle capacity in case of mixed loads to the respective BKS as reported by Nagy et al [21].…”

Section: Results On Vrprmddp and Vrprmdp Instancesmentioning

confidence: 99%

Section: Computational Studiesmentioning

confidence: 99%

“…We additionally assess the performance of our algorithm on three sets of instances for the VRPRMDP which represents a special case of the VRPRMDDP. These instances have been proposed by Nagy et al [21] and are from now on referred to as Nagy-VRPRMDP1, Nagy-VRPRMDP2, and Nagy-VRPRMDP3. The three sets are derived from the instances for the VRP with backhauls introduced by Goetschalckx and Jacobs-Blecha [11] and Toth and Vigo [40], and the instances of set Salhi-VRPMDP, respectively, by assuming different percentages of the vehicle capacity that must remain unoccupied when both demand types are simultaneously loaded.…”

Section: Vrprmdp Instancesmentioning

confidence: 99%

See 2 more Smart Citations

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

Hof

Schneider

2019

Networks

View full text Add to dashboard Cite

We study a class of vehicle‐routing problems with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (1) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transportation vehicles, (2) the VRPSPD with time windows (VRPSPDTW), which takes customer time windows into account, (3) the VRP with divisible deliveries and pickups (VRPDDP), which allows for fulfilling the delivery and pickup requests of each customer in two separate visits, (4) the previously unstudied VRP with restricted mixing of divisible deliveries and pickups (VRPRMDDP), which accounts for the difficulty of rearranging the vehicle load by additionally requiring that a certain percentage of the vehicle capacity must remain unoccupied when both types of demand are simultaneously loaded, and (5) the previously unstudied VRPDDP with time windows (VRPDDPTW). We develop a hybrid heuristic solution method which combines an adaptive large neighborhood search algorithm with a path relinking approach, called ALNS‐PR, and we demonstrate the competitiveness of our algorithm on benchmark instances proposed in the literature. Especially on VRPSPDTL, VRPSPDTW, and VRPDDP instances, our ALNS‐PR proves to be superior to the majority of comparison algorithms and is able to obtain numerous new best solutions.

show abstract

Section: Results On Vrprmddp and Vrprmdp Instancesmentioning

confidence: 99%

Section: Computational Studiesmentioning

confidence: 99%

Section: Vrprmdp Instancesmentioning

confidence: 99%

See 1 more Smart Citation

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

Hof

Schneider

2019

Networks

View full text Add to dashboard Cite

show abstract

“…Although the VRPB and the VRPMDP are totally incompatible with each other, they may both be generalised to a model that is currently gaining recognition, the VRP with restricted mixing of deliveries and pickups (VRPRMDP), in which there is some restriction on having a mixture of delivery and pickup goods on board. Because this is not a wellknown version, we point the reader to Tarantilis, Anagnostopoulou, and Repoussis (2012) and Nagy, Wassan, and Salhi (2013) for further information.…”

Section: Relationships Between Various Vrpdpmentioning

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%

The Vehicle Routing Problem with Divisible Deliveries and Pickups

Nagy

Wassan

Speranza

et al. 2015

Transportation Science

Self Cite

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