• Corpus ID: 14178309

The Bees Algorithm for the Vehicle Routing Problem

  title={The Bees Algorithm for the Vehicle Routing Problem},
  author={A.J.L Fenton},
In this thesis we present a new algorithm for the Vehicle Routing Problem called the Enhanced Bees Algorithm. It is adapted from a fairly recent algorithm, the Bees Algorithm, which was developed for continuous optimisation problems. We show that the results obtained by the Enhanced Bees Algorithm are competitive with the best meta-heuristics available for the Vehicle Routing Problem (within 0.5% of the optimal solution for common benchmark problems). We show that the algorithm has good runtime… 
1 Citations


Applying the ANT System to the Vehicle Routing Problem
A recently proposed metaheuristic, the Ant System, is used to solve the Vehicle Routing Problem in its basic form, i.e., with capacity and distance restrictions, one central depot and identical vehicles.
A Savings Based Ant System For The Vehicle Routing Problem
This paper shows the influence of the pheromone information on the solution quality, by comparing the Ant System with a randomized implementation of the Savings algorithm, and evaluates the approach on benchmark data sets.
A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem
Results from a computational experiment over common benchmark problems report the proposed approach to address the capacitated vehicle routing problem to be very competitive with the best-known methods.
An improved Ant System algorithm for theVehicle Routing Problem
An improved ant system algorithm for the Vehicle RoutingProblem with one central depot and identical vehicles is presented and a comparison with five other metaheuristic approaches for solving Vehicle Routed Problems is given.
A Tabu Search Heuristic for the Vehicle Routing Problem
Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
This paper presents a new optimization algorithm capable of optimally solving 100-customer problems of the vehicle routing problem with time windows VRPTW and indicates that this algorithm proved to be successful on a variety of practical sized benchmark VRPTw test problems.
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
A Review of Bio-inspired Algorithms for Vehicle Routing
  • J. Potvin
  • Computer Science
    Bio-inspired Algorithms for the Vehicle Routing Problem
  • 2009
This chapter reviews biologically inspired algorithms for solving a class of difficult combinatorial optimization problems known as vehicle routing problems, where least-cost collection or delivery
Parallel iterative search methods for vehicle routing problems
Two partition methods that speed up iterative search methods applied to vehicle routing problems including a large number of vehicles, based on the arborescence built from the shortest paths from any city to the depot are presented.
An exact algorithm for the asymmetrical capacitated vehicle routing problem
An exact algorithm for the asymmetrical capacitated vehicle routing problem, i.