An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls

DOI10.1111/itor.12379OpenAlexW2588854804MaRDI QIDQ6066301

Javier Belloso, Javier Faulin, Angel A. Juan

Publication date: 15 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.12379

zbMATH Keywords

heuristicsmultistart algorithmsbiased randomizationfleet size and mix vehicle-routing problemvehicle-routing problem with backhauls

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (13)

Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities ⋮ A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ A biased-randomized algorithm for optimizing efficiency in parametric earthquake (re) insurance solutions ⋮ On the role of metaheuristic optimization in bioinformatics ⋮ Agile optimization for a real‐time facility location problem in Internet of Vehicles networks ⋮ Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ The capacitated family traveling salesperson problem ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction

Cites Work

• A unified heuristic for a large class of vehicle routing problems with backhauls
• A column generation approach to the heterogeneous fleet vehicle routing problem
• Comparing backhauling strategies in vehicle routing using ant colony optimization
• Industrial aspects and literature survey: fleet composition and routing
• An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls
• Dynamic pickup and delivery problems
• The fleet size and mix vehicle routing problem
• The vehicle routing problem with backhauls
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
• A new tabu search algorithm for the vehicle routing problem with backhauls
• An iterated local search algorithm for the vehicle routing problem with backhauls
• 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
• Vehicle Routing
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• The fleet size and mix vehicle routing problem with time windows
• Routing a Heterogeneous Fleet of Vehicles
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• An Exact Algorithm for the Vehicle Routing Problem with Backhauls
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A heuristic column generation method for the heterogeneous fleet VRP
• A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
• The vehicle-routing problem with delivery and back-haul options
• Randomized heuristics for the family traveling salesperson problem
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Evaluating the importance of randomization in adaptive large neighborhood search
• A biased‐randomized metaheuristic for the capacitated location routing problem
• A heuristic for vehicle fleet mix problem using tabu search and set partitioning
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Computer Solutions of the Traveling Salesman Problem
• Handbook of metaheuristics

This page was built for publication: An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls