Collection of different types of milk with multi-tank tankers under uncertainty: a real case study
From MaRDI portal
Publication:2121608
DOI10.1007/s11750-021-00598-xzbMath1490.90201OpenAlexW3152176391MaRDI QIDQ2121608
Publication date: 4 April 2022
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-021-00598-x
fuzzy optimizationmulti-compartment vehicle routing problemdairy logisticsiterative local searchmilk collection problem
Mixed integer programming (90C11) Fuzzy logic; logic of vagueness (03B52) Transportation, logistics and supply chain management (90B06)
Related Items
Modelling and solving the milk collection problem with realistic constraints, Vehicle routing for milk collection with gradual blending: a case arising in Chile
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- Rich vehicle routing problems: from a taxonomy to a definition
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
- A hybrid algorithm for a class of vehicle routing problems
- A survey on two-echelon routing problems
- A possibilistic programming approach for closed-loop supply chain network design under uncertainty
- Linear programming with fuzzy parameters: an interactive method resolution
- An application of special ordered sets to a periodic milk collection problem
- Production scheduling and vehicle routing with time windows for perishable food products
- A parametric approach to fuzzy linear programming
- An exact algorithm for a milk tanker scheduling and sequencing problem
- The two-period travelling salesman problem applied to milk collection in Ireland
- An iterated tabu search for the multi-compartment vehicle routing problem
- Dynamic dairy facility location and supply chain planning under traffic congestion and demand uncertainty: a case study of tehran
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- RANKING FUZZY NUMBERS THROUGH THE COMPARISON OF ITS EXPECTED INTERVALS
- Solution of a Large-Scale Traveling-Salesman Problem
