A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
From MaRDI portal
Publication:323548
DOI10.1016/J.EJOR.2016.05.002zbMATH Open1346.90100OpenAlexW2387094245MaRDI QIDQ323548FDOQ323548
Authors: Daniel Guimarans, Angel A. Juan, Ignacio de la Nuez, Óscar Domínguez 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.002
Recommendations
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- 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
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- The vehicle routing problem with backhauls
- A review of recent research on green road freight transportation
- Rich vehicle routing problems: from a taxonomy to a definition
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- 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
- An exact method for the vehicle routing problem with backhauls
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Vehicle Routing
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Title not available (Why is that?)
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
- New heuristics for the vehicle routing problem
Cited In (21)
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
- Vehicle routing with backhauls: review and research perspectives
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
- A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints
- Using horizontal cooperation concepts in integrated routing and facility‐location decisions
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
- Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery
- On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
- Systematic review of the latest scientific publications on the vehicle routing problem
Uses Software
This page was built for publication: A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323548)
