Route design for last-in, first-out deliveries with backhauling

Lin, Sifeng; Bard, Jonathan F.; Jarrah, Ahmad I.; Zhang, Xinhui; Novoa, Luis J.

doi:10.1016/j.trc.2017.01.005

Cited by 12 publications

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Variables such as vehicle type, fleet size, and routes are determined in order to minimize the service total cost. Lin et al (2017) integrate new operative constraints into the VRPB with time windows, among them: last-in-first-out rules, vehicle capacity depending on the specific order, driving-time limits, etc. To solve this version of the problem, a hybrid approach combining the greedy randomized adaptive search procedure with tabu search is proposed.…”

Section: Literature Review On the Vrpbmentioning

confidence: 99%

A biased-randomized iterated local search for the vehicle routing problem with optional backhauls

Londoño

Tordecilla

Martins

et al. 2020

TOP

View full text Add to dashboard Cite

The vehicle routing problem with backhauls integrates decisions on products delivery with decisions on collection of returnable items. In this paper we analyze the scenario in which collection is optional. Both transport costs and penalty costs for not collecting are considered. A mixed-integer linear model is proposed and solved for small instances. A metaheuristic algorithm combining biased randomization techniques with iterated local search is introduced for larger instances. This approach yields cost savings and is competitive compared to other state-ofthe-art approaches.

show abstract

Section: Literature Review On the Vrpbmentioning

confidence: 99%

A biased-randomized iterated local search for the vehicle routing problem with optional backhauls

Londoño

Tordecilla

Martins

et al. 2020

TOP

View full text Add to dashboard Cite

show abstract

A Brief Literature Review About Bioinspired Metaheuristics to Solve Vehicle Routes Problem with Time Window

Polo-Pichon

Palacio

De-la-Hoz-Franco

2022

Proceedings of the International Conference on Intelligent Vision and Computing (ICIVC 2021)

View full text Add to dashboard Cite

The Vehicle Routing Problem with Time Windows has become a pretty studied optimization problem. Because the time constraint greatly expands the possible solutions; this allow that the model get closer to reality. In this investigation, the restrictions, the conclusions and future works of around two hundred papers, have been consulted at Web of Science, Scopus and Sage. In these, the most widely used bioinspired metaheuristic algorithms were analyzed to provide solutions in the vehicle routing problem with time windows. The objective of this research is the publication of an article, which serves as a reference or support to give a broad documented vision to future research on Bioinspired Metaheuristics. The findings about them: Few written evidence it found about periodic restriction, and only some papers, involving heterogeneous fleets. From the perspective of metaheuristic techniques, the algorithms that has been most used for solve this problem, are the genetic algorithms. In addition, little information was found on the application of the Buffalo and Cuckoo algorithms. Which can become a great opportunity for new research in this field. Based on these findings, it can be concluded that the application of hybrid algorithms, could be analyzed in depth. Because there is little information, and this represents a wide and interesting spectrum of research, which can be used to increase solutions in these problems.

show abstract

Optimizing logistics routings in a network perspective of supply and demand nodes

Lam

2019

Cent Eur J Oper Res

View full text Add to dashboard Cite

Route design for last-in, first-out deliveries with backhauling

Cited by 12 publications

References 41 publications

A biased-randomized iterated local search for the vehicle routing problem with optional backhauls

A biased-randomized iterated local search for the vehicle routing problem with optional backhauls

A Brief Literature Review About Bioinspired Metaheuristics to Solve Vehicle Routes Problem with Time Window

Optimizing logistics routings in a network perspective of supply and demand nodes

Contact Info

Product

Resources

About