Multi-agent ant colony optimization for vehicle routing problem with soft time windows and road condition

5Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

In this paper we consider two important objects of transportation, cost and customer satisfaction. The latter mainly depends on vehicle arrival time and expecting time of the customer. Whereas in the reality, road conditions varies at different time periods and affect the vehicle travelling speed. Meanwhile, transport cost, including fuel consumption, relate to load of vehicle. Correspondingly, mathematical model of vehicle routing problem with soft time windows and road factor (VRPSTWRF) was established in which transport cost, fuel consumption and customer satisfaction are considered. Multi-agent ant colony optimization is proposed in which the features of agent perceiving and reacting to the environment are applied reasonably. Adaptive information heuristic factor and pheromone expectation heuristic factor changing mechanism is used to improve global convergence ability. Pheromone is updated adaptively, the fuel consumption rate also considered, to ensure the convergence speed. 3-opt strategy was introduced to improve local search ability. Thus, multi-agent ant colony optimization (MACO) was constructed and used to solve 40-customer VRPSTWRF model. Experiments show that MACO proposed is feasible and valid.

Cite

CITATION STYLE

APA

Huang, G., Cai, Y., & Cai, H. (2018). Multi-agent ant colony optimization for vehicle routing problem with soft time windows and road condition. In MATEC Web of Conferences (Vol. 173). EDP Sciences. https://doi.org/10.1051/matecconf/201817302020

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