Path relinking for the vehicle routing problem
From MaRDI portal
Publication:2491329
Recommendations
- scientific article; zbMATH DE number 2209651
- A tabu search heuristic for the multi-depot vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Evolutionary Computation in Combinatorial Optimization
Cites work
- A GRASP with path-relinking for private virtual circuit routing
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A subpath ejection method for the vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- An improved ant system algorithm for the vehicle routing problem
- Bandwidth Packing: A Tabu Search Approach
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Fundamentals of scatter search and path relinking
- Future paths for integer programming and links to artificial intelligence
- GRASP with path relinking for three-index assignment
- scientific article; zbMATH DE number 1054962 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 1488087 (Why is no real title available?)
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- scientific article; zbMATH DE number 2209651 (Why is no real title available?)
- scientific article; zbMATH DE number 2209655 (Why is no real title available?)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- New heuristics for the vehicle routing problem
- Parallel iterative search methods for vehicle routing problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Probabilistic diversification and intensification in local search for vehicle routing
- Solving the vehicle routing problem with adaptive memory programming methodology
- The granular tabu search and its application to the vehicle-routing problem
- The vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited in
(22)- A hybrid evolution strategy for the open vehicle routing problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Vehicle routing with arrival time diversification
- A matheuristic for the generalized order acceptance and scheduling problem
- City-courier routing and scheduling problems
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Solving the flight perturbation problem with meta heuristics
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- Extensions of the Petal Method for Vehicle Routeing
- Evolutionary Computation in Combinatorial Optimization
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- The multi-visits drone-vehicle routing problem with simultaneous pickup and delivery service
- Production routing decisions in a two-echelon supply chain with multiple delivery modes
- Feature-guided metaheuristic with diversity management for solving the capacitated vehicle routing problem
- Designing delivery districts for the vehicle routing problem with stochastic demands
- A path relinking approach for the team orienteering problem
- Near-optimal solutions for the generalized max-controlled set problem
This page was built for publication: Path relinking for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491329)
