A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
From MaRDI portal
Publication:6066639
DOI10.1111/itor.12668OpenAlexW2936379222WikidataQ128082376 ScholiaQ128082376MaRDI QIDQ6066639
Christian Fikar, Patrick Hirsch, Alejandro Estrada-Moreno, Angel A. Juan
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12668
metaheuristicsmulti-depot vehicle routing problemperishable productfood supply chainbiased randomization
Related Items (6)
A biased-randomized algorithm for optimizing efficiency in parametric earthquake (re) insurance solutions ⋮ Ordering and pricing decisions for perishable goods retailer with zero‐inventory and capital constraints ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands ⋮ Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem ⋮ Reducing waste and achieving sustainable food security through optimizing surplus-food collection and meal distribution
Cites Work
- A multi-agent based cooperative approach to scheduling and routing
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- A general heuristic for vehicle routing problems
- Production scheduling and vehicle routing with time windows for perishable food products
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- A biased random-key genetic algorithm for the minimization of open stacks problem
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Shelf life modelling for first-expired-first-out warehouse management
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
- A biased‐randomized metaheuristic for the capacitated location routing problem
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
This page was built for publication: A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
