Guided Bee Colony Algorithm Applied to the Daily Car Pooling Problem

Mouna Bouzid, Ines Alaya, Moncef Tagina

2021

Abstract

The foraging behavior of bees has been adapted in a Bee Colony Optimization algorithm (BCO). This approach is a simple and an efficient metaheuristic that has been successfully used to solve many complex optimization problems in different domains, mostly in transportation, location and scheduling fields. In this study, we develop two algorithms for the Daily Car Pooling Problem based on the BCO approach. The developed algorithms are experimentally tested on benchmark instances of different sizes. The computational results show that the proposed approaches can produce good solutions when compared with an exact method.

Paper Citation

in Harvard Style

Bouzid M., Alaya I. and Tagina M. (2021). Guided Bee Colony Algorithm Applied to the Daily Car Pooling Problem. In Proceedings of the 16th International Conference on Software Technologies - Volume 1: ICSOFT, ISBN 978-989-758-523-4, pages 465-472. DOI: 10.5220/0010517504650472

in Bibtex Style

@conference{icsoft21,
author={Mouna Bouzid and Ines Alaya and Moncef Tagina},
title={Guided Bee Colony Algorithm Applied to the Daily Car Pooling Problem},
booktitle={Proceedings of the 16th International Conference on Software Technologies - Volume 1: ICSOFT,},
year={2021},
pages={465-472},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010517504650472},
isbn={978-989-758-523-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Conference on Software Technologies - Volume 1: ICSOFT,
TI - Guided Bee Colony Algorithm Applied to the Daily Car Pooling Problem
SN - 978-989-758-523-4
AU - Bouzid M.
AU - Alaya I.
AU - Tagina M.
PY - 2021
SP - 465
EP - 472
DO - 10.5220/0010517504650472