Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal
type: Item
instance of: scholarly article
title: Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal
zbMATH Open document ID: 1426.90217
DOI: 10.1155/2017/3046830
author: Thiago A. S. Masutti
author: Leandro N. de Castro
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 6971943
describes a project that uses: ABC
describes a project that uses: TSPLIB
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/3046830
OpenAlex ID: W2762246980
cites work: Q3157878
cites work: Q5187226
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The traveling salesman problem and its variations
cites work: Vehicle Routing
cites work: Q5492809
cites work: Q4490845
cites work: Swarm intelligence. Introduction and applications
cites work: Q4365133
cites work: Q4452941
cites work: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
cites work: Expanding neighborhood GRASP for the traveling salesman problem
description: scientific article; zbMATH DE number 6971943