Lasso solution strategies for the vehicle routing problem with pickups and deliveries

Hoff, Arild; Gribkovskaia, Irina; Laporte, Gilbert; Løkketangen, Arne

doi:10.1016/j.ejor.2007.10.021

Cited by 49 publications

(32 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Starting from the solution found in Step 1, solve the resulting VRPMDP using a good-quality metaheuristic. This is a valid approach, as discussed in §2.2, and in line with previous studies, see, e.g., Mosheiov (1994), Salhi and Nagy (1999), and Hoff et al (2009). The approach has the drawback of having twice as many customers; however, our aim here is to analyse split solutions with the view of creating more efficient solution algorithms.…”

Section: Methodology and Justificationmentioning

confidence: 76%

“…Although the optimal general solution is better than the optimal lasso one, the special lasso structure allows for faster heuristics. Thus, in practice, better lasso solutions than general ones may be found in the same computing time (Hoff et al 2009). …”

Section: Research Issues In the Vrpddpmentioning

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%

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

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: Methodology and Justificationmentioning

confidence: 76%

Section: Research Issues In the Vrpddpmentioning

confidence: 99%

See 1 more Smart Citation

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

“…This practice is applied, for example, to overcome linehaul/backhaul distribution and save routing costs. For example, Hoff et al [63] studied a real-world beverage distribution problem arising in Norway. This is a typical situation of the 1-M-1 transportation discussed in Section 6.3, where full bottles must be delivered and empty bottles collected.…”

Section: One-to-many-to-one Problemsmentioning

confidence: 99%

Chapter 6: Pickup-and-Delivery Problems for Goods Transportation

Battarra¹,

Cordeau²,

Iori³

2014

Vehicle Routing

View full text Add to dashboard Cite

“…Unlike the problem dealt in this study, many researchers have focused on the Pickup and Delivery (PDP) problems that dealt with vehicles start from one depot, pickup and deliver all products and then return to the same depot. However, we find that the final delivery by the delivery boys to the reader's home has not received much attention in the past including the studies conducted by Min (1989;Mosheiov, 1994;Nagy and Salhi, 1998;Salhi and Nagy, 1999;Gendreau et al, 1999;Dethloff, 2001;2002;Montane and Galvao, 2002;Süral and Bookbinder, 2003;Wasner and Zäphel, 2004;Halskausr et al, 2007;Hoff et al, 2009;Wang and Chen, 2013) have focused up to the drop points of the vehicles and their route optimizations. However, the aim of the problem is to find maximum customer coverage and optimal delivery consistency.…”

Section: Synchronizing Production and Distribution Of Heterogeneous Nmentioning

confidence: 99%

Optimizing the Newspaper Distribution Scenarios using Genetic Algorithm: A Case Study of India

Kamble¹,

Raut²,

Gawankar³

2017

American Journal of Applied Sciences

View full text Add to dashboard Cite

This paper attempts to optimize the various newspaper distribution scenario as observed in India. It found from the literature that earlier research work carried out in optimizing the vehicle routing networks problem using time window and scope was limited to distribution from newspaper printing location to the vendor point of distribution. This paper focuses on the distribution of newspaper from vendor to the newspaper reader/customer. In this study case study method is used and the circulation activity is modelled with different field scenarios with a aim of minimizing the overall (total) delivery time of the Newspaper. The major aim of this paper was to identify the issues, while distributing the newspaper by the vendor at the hub to the end reader. The company under consideration had an objective of finishing the last newspaper delivery by 6:30 am. To optimize the same the paper identified the following scenario: Case 1. Delivery to Independent Houses Located in a Community Case 2. Delivery to an Apartment Cluster Case 3. Delivery considering the various modes of transportation The present paper optimized the same using genetic algorithm as the optimizing tool. The model with different scenarios presented in the paper will help the newspaper distribution planners to understand the various issues on the field and achieve to have a successful distribution strategy within the set objective of reaching the last copy of newspaper by 6:30 am to the reader. This will help not only the newspaper company under consideration but the entire newspaper industry. This paper contributes to body of knowledge of newspaper industry its major research implications are 1. It provide insights for a particular type of functioning environment, where speed and time play an critical role. 2. In certain type the time delays in the distribution network will impact the consumer's preference which will lead to improved market share and more satisfied customers.

show abstract

Lasso solution strategies for the vehicle routing problem with pickups and deliveries

Cited by 49 publications

References 29 publications

The Vehicle Routing Problem with Divisible Deliveries and Pickups

The Vehicle Routing Problem with Divisible Deliveries and Pickups

Chapter 6: Pickup-and-Delivery Problems for Goods Transportation

Optimizing the Newspaper Distribution Scenarios using Genetic Algorithm: A Case Study of India

Contact Info

Product

Resources

About