EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
type: Item
instance of: scholarly article
title: EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
zbMATH Open document ID: 1279.90020
author: Guido Perboli
author: F. Pezzella
author: Roberto Tadei
published in: Mathematical Methods of Operations Research
publication date: 2008-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5366808
zbMATH Keywords: vehicle routing
zbMATH Keywords: hybrid algorithm
zbMATH Keywords: genetic algorithm
zbMATH Keywords: taboo search
describes a project that uses: CVRPSP
describes a project that uses: BoneRoute
describes a project that uses: VRP
MaRDI profile type: Publication
Wikidata QID: Q58644518
full work available at URL: s00186-008-0236-7
OpenAlex ID: W2043155988
cites work: A tabu search algorithm for the vehicle routing problem
cites work: A new hybrid genetic algorithm for the capacitated vehicle routing problem
cites work: Q3048611
cites work: Q5431823
cites work: A guide to vehicle routing heuristics
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Creating very large scale neighborhoods out of smaller ones by compounding moves
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4350081
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4955265
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem
cites work: Active guided evolution strategies for large-scale vehicle routing problems with time windows
cites work: Q4382646
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: A subpath ejection method for the vehicle routing problem
cites work: Q4350082
cites work: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
cites work: Q4955264
cites work: The granular tabu search and its application to the vehicle-routing problem
cites work: A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
DOI: 10.1007/S00186-008-0236-7
Recommended article: A hybrid evolution strategy for the open vehicle routing problem
Recommended article: A hybrid algorithm for a class of vehicle routing problems
Recommended article: Q4988054
Recommended article: Q4436879
Recommended article: A new hybrid genetic algorithm for the capacitated vehicle routing problem
description: scientific article; zbMATH DE number 5366808