Hybrid ABC algorithm for the capacitated vehicle routing problem

Nagaya, Ryo; Inoie, Atsushi

doi:10.4108/icst.bict.2014.257837

Cited by 2 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the proposal of Nagaya and Inoie [72], the authors created a hybrid between the ABC and the simulated annealing (SA) algorithm to solve capacitated vehicle routing problems. They assessed their algorithm in 11 benchmark instances and Mathematical Problems in Engineering 9 compared the results with that of the standard ABC, SA, and the best-known solution.…”

Section: Artificial Bee Colonymentioning

confidence: 99%

Bee‐Inspired Algorithms Applied to Vehicle Routing Problems: A Survey and a Proposal

Masutti

Castro

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Vehicle routing problems constitute a class of combinatorial optimization tasks that search for optimal routes (e.g., minimal cost routes) for one or more vehicles to attend a set of nodes (e.g., cities or customers). Finding the optimal solution to vehicle routing tasks is an NP-hard problem, meaning that the size of problems that can be solved by exhaustive search is limited. From a practical perspective, this class of problems has a wide and important set of applications, from the distribution of goods to the integrated chip design. Rooted on the use of collective intelligence, swarm-inspired algorithms, more specifically bee-inspired approaches, have been used with good performance to solve such problems. In this context, the present paper provides a broad review on the use of bee-inspired methods for solving vehicle routing problems, introduces a new approach to solve one of the main tasks in this area (the travelling salesman problem), and describes open problems in the field.

show abstract

Section: Artificial Bee Colonymentioning

confidence: 99%