Related Experiment Video
Updated: Feb 22, 2026

Radio Frequency Identification and Motion-sensitive Video Efficiently Automate Recording of Unrewarded Choice Behavior by Bumblebees
Published on: November 15, 2014
Improved artificial bee colony algorithm for vehicle routing problem with time windows
Baozhen Yao1, Qianqian Yan1, Mengjie Zhang1
1Automotive Engineering College, Dalian University of Technology, Dalian, P.R., China.
Abstract:
This paper investigates a well-known complex combinatorial problem known as the vehicle routing problem with time windows (VRPTW). Unlike the standard vehicle routing problem, each customer in the VRPTW is served within a given time constraint. This paper solves the VRPTW using an improved artificial bee colony (IABC) algorithm. The performance of this algorithm is improved by a local optimization based on a crossover operation and a scanning strategy. Finally, the effectiveness of the IABC is evaluated on some well-known benchmarks. The results demonstrate the power of IABC algorithm in solving the VRPTW.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Distributed Loads: Problem Solving

