Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
From MaRDI portal
Publication:2356202
DOI10.1016/j.ejor.2013.02.053zbMath1317.90006OpenAlexW2094513248WikidataQ56619961 ScholiaQ56619961MaRDI QIDQ2356202
Teodor Gabriel Crainic, Thibaut Vidal, Christian Prins, Michel Gendreau
Publication date: 29 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.02.053
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows ⋮ Ensuring service levels in routing problems with time windows and stochastic travel times ⋮ The electric two-echelon vehicle routing problem ⋮ A matheuristic approach for the pollution-routing problem ⋮ An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP ⋮ Hybrid search with neighborhood reduction for the multiple traveling salesman problem ⋮ The fish feed production routing problem ⋮ Models and algorithms for network reduction ⋮ An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints ⋮ Vehicle routing to minimize time-dependent emissions in urban areas ⋮ The electric fleet size and mix vehicle routing problem with time windows and recharging stations ⋮ Hybrid metaheuristics for the clustered vehicle routing problem ⋮ A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ Metaheuristics for the tabu clustered traveling salesman problem ⋮ A large neighbourhood based heuristic for two-echelon routing problems ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ A min-max vehicle routing problem with split delivery and heterogeneous demand ⋮ Combined maintenance and routing optimization for large-scale sewage cleaning ⋮ The vehicle routing problem with service level constraints ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ The vehicle routing problem with arrival time diversification on a multigraph ⋮ Step cost functions in a fleet size and mix vehicle routing problem with time windows ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ Neural networks for local search and crossover in vehicle routing: a possible overkill? ⋮ A general VNS for the multi-depot open vehicle routing problem with time windows ⋮ Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ Resource constrained routing and scheduling: review and research prospects ⋮ The Vehicle Routing Problem with Release and Due Dates ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization ⋮ Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics ⋮ Route and fleet design for cyclic inventory routing ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ Implicit depot assignments and rotations in vehicle routing heuristics ⋮ On solving the time window assignment vehicle routing problem via iterated local search ⋮ A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ Deployment method of prefabricated component transport vehicle ⋮ 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 ⋮ Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types ⋮ An effective PSO-inspired algorithm for the team orienteering problem
Uses Software
Cites Work
- Optimization by Simulated Annealing
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- The case for strategic oscillation
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- The orienteering problem: a survey
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- A survey of very large-scale neighborhood search techniques
- The attribute based hill climber
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Metaheuristics in combinatorial optimization
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
- Adaptive memory programming for the vehicle routing problem with multiple trips
- Location-routing: issues, models and methods
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- The vehicle routing problem with flexible time windows and traveling times
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- A general heuristic for vehicle routing problems
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- A classification scheme for vehicle routing and scheduling problems
- Recent advances in vehicle routing exact algorithms
- A GA based heuristic for the vehicle routing problem with multiple trips
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Variable neighbourhood search: methods and applications
- A memetic algorithm for the team orienteering problem
- A path relinking approach for the team orienteering problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- An ILP improvement procedure for the open vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- Dynamic pickup and delivery problems
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Evolution algorithms in combinatorial optimization
- The vehicle routing problem with backhauls
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- The team orienteering problem
- Variable neighborhood search
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- An improved ant system algorithm for the vehicle routing problem
- Guided local search and its application to the traveling salesman problem
- Future paths for integer programming and links to artificial intelligence
- Vehicle dispatching with time-dependent travel times
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Routing problems: A bibliography
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Metaheuristics: A bibliography
- Designing and reporting on computational experiments with heuristic methods
- Probabilistic diversification and intensification in local search for vehicle routing
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- An improved ant colony optimization for vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- An exact algorithm for team orienteering problems
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Sequential search and its application to vehicle-routing problems
- Path relinking for the vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Lagrangian duality applied to the vehicle routing problem with time windows
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Fast local search algorithms for the handicapped persons transportation problem
- A new ILP-based refinement heuristic for vehicle routing problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable neighborhood search for the dial-a-ride problem
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- An Exact Method for the Vehicle Routing Problem with Backhauls
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- A Parallel Algorithm for the Vehicle Routing Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
- An Exact Algorithm for the Period Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Bumble Bees Mating Optimization Algorithm for the Vehicle Routing Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- Routing a Heterogeneous Fleet of Vehicles
- The Period Vehicle Routing Problem and its Extensions
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Parallel Solution Methods for Vehicle Routing Problems
- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- A guided tabu search for the heterogeneous vehicle routeing problem
- Tabu Search—Part I
- Tabu Search—Part II
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Parallel iterative search methods for vehicle routing problems
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A heuristic column generation method for the heterogeneous fleet VRP
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- Vehicle Routeing with Multiple Use of Vehicles
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- Vehicle routing problems with split deliveries
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Parallel Metaheuristics
- Computer Solutions of the Traveling Salesman Problem
- Algorithms for Large-scale Travelling Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Handbook of metaheuristics
- Evolutionary Computation in Combinatorial Optimization
- Handbook of metaheuristics
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
