EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
From MaRDI portal
Publication:953302
DOI10.1007/s00186-008-0236-7zbMath1279.90020OpenAlexW2043155988WikidataQ58644518 ScholiaQ58644518MaRDI QIDQ953302
Roberto Tadei, Guido Perboli, Ferdinando Pezzella
Publication date: 17 November 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0236-7
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A survey of variants and extensions of the location-routing problem, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, EVE-OPT, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- A tabu search algorithm for the vehicle routing problem
- 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
- BoneRoute: An adaptive memory-based method for effective fleet management
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new branch-and-cut algorithm for the capacitated 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
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A Subpath Ejection Method for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A guide to vehicle routing heuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
