Vehicle routing for milk collection with gradual blending: a case arising in Chile

DOI10.1016/J.EJOR.2022.03.050MaRDI QIDQ2160533zbMATH OpenOpenAlexFDO

Authors Germán Paredes-Belmar, Elizabeth Montero, Armin Lüer-Villagra, Vladimir Marianov, Claudio Araya-Sassi

Publication date 3 August 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2022.03.050

zbMATH Keywords

gradual blendingiterated local searchmetaheuristicsmilk collectionrouting

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Modelling and solving the milk collection problem with realistic constraints
• Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
• Solving a vehicle-routing problem arising in soft-drink distribution
• A variation of the generalized assignment problem arising in the New Zealand dairy industry
• An exact algorithm for a milk tanker scheduling and sequencing problem

Cites work

• A branch-and-price approach for a multi-period vehicle routing problem
• A column generation approach for a multi-attribute vehicle routing problem
• A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
• A probabilistic heuristic for a computationally difficult set covering problem
• An application of special ordered sets to a periodic milk collection problem
• An exact algorithm for a milk tanker scheduling and sequencing problem
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
• An iterated local search algorithm for the vehicle routing problem with backhauls
• Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
• Computing with domino-parity inequalities for the traveling salesman problem (TSP)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
• Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Probabilistic diversification and intensification in local search for vehicle routing
• Product-oriented time window assignment for a multi-compartment vehicle routing problem
• The two-period travelling salesman problem applied to milk collection in Ireland
• TSPLIB—A Traveling Salesman Problem Library
• Vehicle selection for a multi-compartment vehicle routing problem

Cited in

(2)

• Vehicle routing problems with multiple commodities: a survey
• Policies for multi-trip route planning in time-sensitive environments

Describes a project that uses

Uses Software

• VRP
• TSPLIB
• GitHub

This page was built for publication: Vehicle routing for milk collection with gradual blending: a case arising in Chile

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2160533)