A metaheuristic approach for the problem of motor fuel distribution

2Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Motor fuel distribution problem is considered. Accepting some assumptions it can be reduced to a well-known vehicle routing problem with capacity constraints. Ant colony optimization approach is suggested for solving CVRP. Modified ant algorithms are performed. Computational results for some benchmarks are given in compare with classical ant algorithm. © 2014 Published by Elsevier B.V.

Cite

CITATION STYLE

APA

Alexander, B., & Sergey, S. (2014). A metaheuristic approach for the problem of motor fuel distribution. In Procedia Computer Science (Vol. 31, pp. 143–150). Elsevier B.V. https://doi.org/10.1016/j.procs.2014.05.254

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free