Path relinking for the vehicle routing problem
From MaRDI portal
Publication:2491329
DOI10.1007/s10732-006-4192-1zbMath1122.90068OpenAlexW2107306858MaRDI QIDQ2491329
Publication date: 29 May 2006
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-006-4192-1
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, Designing delivery districts for the vehicle routing problem with stochastic demands, Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Vehicle routing with arrival time diversification, City-courier routing and scheduling problems, Solving the flight perturbation problem with meta heuristics, A path relinking approach for the team orienteering problem, Near-optimal solutions for the generalized max-controlled set problem, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, A hybrid evolution strategy for the open vehicle routing problem, A matheuristic for the generalized order acceptance and scheduling problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Solving the vehicle routing problem with adaptive memory programming methodology
- An improved ant system algorithm for the vehicle routing problem
- Future paths for integer programming and links to artificial intelligence
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- The Vehicle Routing Problem
- A Subpath Ejection Method for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- GRASP with Path Relinking for Three-Index Assignment
- Bandwidth Packing: A Tabu Search Approach
- Parallel iterative search methods for vehicle routing problems
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A GRASP with path-relinking for private virtual circuit routing
- A Tabu Search Heuristic for the Vehicle Routing Problem
