Vehicle routing for milk collection with gradual blending: a case arising in Chile
From MaRDI portal
Publication:2160533
DOI10.1016/j.ejor.2022.03.050OpenAlexW4220959794MaRDI QIDQ2160533
Elizabeth Montero, Claudio Araya-Sassi, Armin Lüer-Villagra, Vladimir Marianov, Germán Paredes-Belmar
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
Uses Software
Cites Work
- Unnamed Item
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- A branch-and-price approach for a multi-period vehicle routing problem
- An application of special ordered sets to a periodic milk collection problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An exact algorithm for a milk tanker scheduling and sequencing problem
- The two-period travelling salesman problem applied to milk collection in Ireland
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle selection for a multi-compartment vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- An iterated local search algorithm for the vehicle routing problem with backhauls
- A column generation approach for a multi-attribute 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 hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
- Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
- TSPLIB—A Traveling Salesman Problem Library
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
This page was built for publication: Vehicle routing for milk collection with gradual blending: a case arising in Chile
