A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations

DOI10.1111/itor.12070zbMath1291.90034OpenAlexW2084221840MaRDI QIDQ4979997

Javier Faulin, Angel A. Juan, Oscar Dominguez

Publication date: 20 June 2014

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12070

zbMATH Keywords

heuristicsvehicle routing problemmultistart algorithmsbiased randomizationvehicle packing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (18)

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times ⋮ A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics ⋮ 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 ⋮ A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ A nonlinear optimization model for the balanced vehicle routing problem with loading constraints ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem ⋮ The location routing problem using electric vehicles with constrained distance

Uses Software

• VRP
• SSJ

Cites Work

• Unnamed Item
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• Routing problems with loading constraints
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
• The vehicle routing problem. Latest advances and new challenges.
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• The Vehicle Routing Problem
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

This page was built for publication: A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations