EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
DOI10.1007/S00186-008-0236-7zbMATH Open1279.90020OpenAlexW2043155988WikidataQ58644518 ScholiaQ58644518MaRDI QIDQ953302FDOQ953302
Authors: Guido Perboli, F. Pezzella, Roberto Tadei 
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- BoneRoute: An adaptive memory-based method for effective fleet management
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Tabu Search—Part I
- Title not available (Why is that?)
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Tabu Search—Part II
- 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
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tabu search algorithm for the vehicle routing problem
- The granular tabu search and its application to the vehicle-routing problem
- Title not available (Why is that?)
- New heuristics for the vehicle routing problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A guide to vehicle routing heuristics
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- A subpath ejection method for the vehicle routing problem
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- Title not available (Why is that?)
Cited In (11)
- A hybrid evolution strategy for the open vehicle routing problem
- Title not available (Why is that?)
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- EVE-OPT
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- A survey of variants and extensions of the location-routing problem
Uses Software
This page was built for publication: EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953302)
