Honey bees mating optimization algorithm for large scale vehicle routing problems

DOI10.1007/s11047-009-9136-xzbMath1211.68388OpenAlexW1968167384MaRDI QIDQ968387

Georgios Dounias, Magdalene Marinaki, Yannis Marinakis

Publication date: 5 May 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-009-9136-x

zbMATH Keywords

vehicle routing problemhoney bees mating optimizationmultiple phase neighborhood search-GRASP

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems ⋮ A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints ⋮ Honey bees mating optimization algorithm for large scale vehicle routing problems ⋮ Dynamic vehicle routing with time windows in theory and practice ⋮ Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem

Uses Software

• BoneRoute
• VRP
• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
• Honey bees mating optimization algorithm for large scale vehicle routing problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Solving the vehicle routing problem with adaptive memory programming methodology
• Greedy randomized adaptive search procedures
• BoneRoute: An adaptive memory-based method for effective fleet management
• A genetic algorithm for the vehicle routing problem
• A simple and effective evolutionary algorithm for the 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
• Application of honey-bee mating optimization algorithm on clustering
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• Very large-scale vehicle routing: new test problems, algorithms, and results
• Expanding neighborhood GRASP for the traveling salesman problem
• The Truck Dispatching Problem
• Parallel iterative search methods for vehicle routing problems
• A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Computer Solutions of the Traveling Salesman Problem
• Variable neighborhood search: Principles and applications