Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility

DOI10.1111/itor.12625OpenAlexW2912095597WikidataQ128550396 ScholiaQ128550396MaRDI QIDQ6066586

Angel A. Juan, Savelsbergh, Martin W. P., Javier Panadero, Alejandro Estrada-Moreno

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.12625

zbMATH Keywords

vehicle routing problemmultiperioditerated local searchprice discountsbiased-randomized heuristics

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (10)

DILS: constrained clustering through dual iterative local search ⋮ A biased-randomized algorithm for optimizing efficiency in parametric earthquake (re) insurance solutions ⋮ A multiperiod drayage problem with customer-dependent service periods ⋮ A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ From fitness landscapes evolution to automatic local search algorithm generation ⋮ A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands ⋮ Dynamic multi-period vehicle routing with touting ⋮ Multi-facility green Weber problem

Cites Work

• On service consistency in multi-period vehicle routing
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
• The dynamic multiperiod vehicle routing problem with probabilistic information
• Multi-period vehicle routing problem with due dates
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
• A general heuristic for vehicle routing problems
• The periodic vehicle routing problem with intermediate facilities
• The flexible periodic vehicle routing problem
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
• The dynamic multi-period vehicle routing problem
• A memetic algorithm for the multiperiod vehicle routing problem with profit
• A variable neighborhood search heuristic for periodic routing problems
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
• Vehicle Routing
• The period routing problem
• A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• The Period Vehicle Routing Problem and its Extensions
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Networks and vehicle routing for municipal waste collection
• 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‐randomized metaheuristic for the capacitated location routing problem
• Flexibility and complexity in periodic distribution problems
• 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
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands

This page was built for publication: Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility