Honey bees mating optimization algorithm for large scale vehicle routing problems
type: Item
instance of: scholarly article
title: Honey bees mating optimization algorithm for large scale vehicle routing problems
zbMATH Open document ID: 1211.68388
author: Yannis Marinakis
author: Magdalene Marinaki
author: Georgios Dounias
published in: Natural Computing
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5703929
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: honey bees mating optimization
zbMATH Keywords: multiple phase neighborhood search-GRASP
describes a project that uses: VRP
describes a project that uses: ABC
describes a project that uses: BoneRoute
MaRDI profile type: Publication
full work available at URL: s11047-009-9136-x
OpenAlex ID: W1968167384
cites work: Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation
cites work: A genetic algorithm for the vehicle routing problem
cites work: Q4436879
cites work: Q3048611
cites work: The truck dispatching problem
cites work: Application of honey-bee mating optimization algorithm on clustering
cites work: Greedy randomized adaptive search procedures
cites work: Q5675139
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4365134
cites work: Q4532228
cites work: Q4039765
cites work: Q4955265
cites work: Variable neighborhood search: Principles and applications
cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Q4550774
cites work: Expanding neighborhood GRASP for the traveling salesman problem
cites work: A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
cites work: Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
cites work: Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems
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: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
cites work: Q4452897
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Solving the vehicle routing problem with adaptive memory programming methodology
cites work: BoneRoute: An adaptive memory-based method for effective fleet management
cites work: A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
DOI: 10.1007/S11047-009-9136-X
Recommended article: Bumble Bees Mating Optimization Algorithm for the Vehicle Routing Problem
Recommended article: Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal
Recommended article: A Bumble Bees Mating Optimization Algorithm for Global Unconstrained Optimization Problems
Recommended article: The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
Recommended article: Q5257500
Recommended article: An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
description: scientific article; zbMATH DE number 5703929