Iterated local search for the vehicle routing problem with a private fleet and a common carrier

Londono, John Fredy Castaneda; Toro, Eliana Mirledy; Gallego, A R Ramón

doi:10.1080/0305215x.2019.1681985

Cited by 6 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The solution methodology for the VRPPC was initially based on heuristic methods ( [Chu, 2005], [Bolduc et al, 2007]) followed by metaheuristics: tabu search algorithms ( [Côté & Potvin, 2009], [Krajewska & Kopfer, 2009], [Euchi, 2017]), adaptive local neighbourhood search [Ziebuhr & Kopfer, 2014], iterated local search ( [Castaneda et al, 2020]), variable neighbourhood search ( [Stenger, Schneider, & Goeke, 2013], [Gham et al, 2017]), perturbation procedures ( [Bolduc et al, 2008]). Some authors have attempted the use of exact methods ( [Dabia et al, 2019]) or the inclusion of dual-based valid inequalities ( [Diaby & Ramesh, 1995]).…”

Section: Network Optimization and Logistics Outsourcing Problemsmentioning

confidence: 99%

Multi-period distribution network problems with minimum commitment contracts

López¹

2022

4OR-Q J Oper Res

View full text Add to dashboard Cite

Companies outsourcing road freight transportation services approach their procurement plan based on a combination of long-term annual contracts with dedicated carriers and spot-markets for immediate loads. This thesis proposes an integrated planning framework considering tactical and operational decisions for logistics services procurement. It allows individual shippers to formulate mid-term contractual agreements with several transporters that could reduce some of the risks encountered in shipper-carrier business relationships, such as unavailability of transportation resources and high-market prices.Contractual agreements are based on minimum commitment (MC) contracts, where the shipper commits to a minimum business volume with certain regularity while carriers offer low and stable rates regardless of market variations. The management problem includes selecting among several contract proposals and deciding the distribution planning for every period along the time horizon.Real-life applications may arise in the context of commercial companies or logistics firms with presence in widespread areas and subcontracting to multiple transportation and logistics service providers. The models are meaningful in dynamic environments, where the contracts represent both an opportunity and risk due to high demand and price variability. In the present work, the tactical planning framework with minimum commitment contracts is studied in the field of e-commerce logistics distribution from the perspective of an e-fulfilment company.The mathematical problem is formulated with mixed-integer linear programs for several variants of MC contracts, in their deterministic and stochastic form. Several algorithmic methods are compared to prove efficiency in finding optimal or applicable solutions to the problem. Numerical tests were performed in random instances with well-defined parameter settings. Results are presented with performance profiles evaluating algorithms in terms of computational time and solution i quality. The analysis considers the economical advantages of approaching capacity planning from a tactical point of view. v 3.

show abstract