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.002zbMath1346.90100OpenAlexW2387094245MaRDI QIDQ323548
Ignacio de la Nuez, Daniel Guimarans, Angel A. Juan, Oscar Dominguez
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times, A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints, Vehicle routing with backhauls: review and research perspectives, A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances, 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 biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery, Using horizontal cooperation concepts in integrated routing and facility‐location decisions, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- A review of recent research on green road freight transportation
- Rich vehicle routing problems: from a taxonomy to a definition
- A variable neighborhood search for the capacitated 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
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- The vehicle routing problem with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- The vehicle routing problem: An overview of exact and approximate algorithms
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- 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
- Vehicle Routing
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
