Abstract

AbstractMetaheuristics turned out to be a dominant tool for solving difficult combinatorial optimization problems. Between them, a group of biologically motivated algorithms can be identified. The Bee Colony Optimization (BCO) method, which uses collective intelligence applied by honey bees, during the nectar gathering process, is one of them. The basic idea at the back of the BCO is to create a multi-agent system (a colony of artificial bees) competent to effectively discover solutions to difficult combinatorial optimization problems. The artificial bee colony performs to a certain degree alike, and in other parts differently, from bees in nature. The analysts specify the possible agents’ behavior and simulate the relations between them (how artificial bees interact with each other). The model and related software imitate how artificial bees execute their actions. The BCO is a stochastic, random-search population-based method. The BCO uses likeness among how bees in nature search for nectar, and how optimization algorithms look for an optimum in combinatorial optimization problems under study. Two variations of the BCO algorithm can be differentiated easily: constructive BCO and the alternative based on the solutions improvement idea. This chapter offers a taxonomy and analysis of the research results accomplished using both variants of BCO to model transportation engineering processes. Thus far, BCO has effectively been used to various real-life traffic control and transportation planning problems: the vehicle routing problem, the ride-matching problem, the traffic sensor location problem on highways, inspection station location problem, the p-center problem, disruption mitigation on public transit, pre-timed control for isolated intersections, area-wide urban traffic control, etc. The main goal of this text is to notify colleagues with the key principles of Bee Colony Optimization, as well as to denote new possible BCO uses in traffic control and transportation planning.KeywordsBee Colony OptimizationTrafficTransportation

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call