A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
From MaRDI portal
(Redirected from Publication:1607978)
Recommendations
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- The vehicle routing problem with backhauls
- A new tabu search algorithm for the vehicle routing problem with backhauls
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- A unified heuristic for a large class of vehicle routing problems with backhauls
Cites work
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1057930 (Why is no real title available?)
- scientific article; zbMATH DE number 1488078 (Why is no real title available?)
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- An Exchange Heuristic for Routeing Problems with Time Windows
- An exact method for the vehicle routing problem with backhauls
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Computer Solutions of the Traveling Salesman Problem
- Heuristic approaches to vehicle routing with backhauls and time windows
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Large-step Markov chains for the TSP incorporating local search heuristics
- Metaheuristics: A bibliography
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Tabu search variants for the mix fleet vehicle routing problem
- The Reactive Tabu Search
- The vehicle routing problem with backhauls
- Variable neighborhood search
Cited in
(32)- Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- An analysis of parameter adaptation in reactive tabu search
- A novel two-phase heuristic method for vehicle routing problem with backhauls
- A grasp interactive approach to the vehicle routing problem with backhauls
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- Multi-trip pickup and delivery problem with time windows and synchronization
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
- Vehicle routing with backhauls: review and research perspectives
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- Metaheuristic for the vehicle routing problem with backhauls and time windows
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- Optimization of the drayage problem using exact methods
- Solution strategies for the vehicle routing problem with backhauls
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A tabu search heuristic for the truck and trailer routing problem
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- On the exact solution of vehicle routing problems with backhauls
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- An iterative biased‐randomized heuristic for the fleet size and mix 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
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
This page was built for publication: A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607978)
