Abstract
In this paper, a hybrid DEABC algorithm is used to solve the perishable food distribution. This particular problem is formulated as a vehicle routing problem with time windows and time dependent (VRPTWTD) by considering the randomness of perishable food distributing process. The DEABC algorithm is implemented in a reliable coding scheme. The performance of proposed algorithm is demonstrated by using modified Solomon's problems. We also analyze the important parameters in perishable food VRPTWTD and their influences have been verified. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Li, L., Yao, F., & Niu, B. (2013). DEABC algorithm for perishable goods vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7996 LNAI, pp. 624–632). https://doi.org/10.1007/978-3-642-39482-9_72
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
