DEABC algorithm for perishable goods vehicle routing problem

Authors:
Li Li;Fangmin Yao;Ben Niu
Affiliations:
College of Management, Shenzhen University, Shenzhen, China;College of Management, Shenzhen University, Shenzhen, China;College of Management, Shenzhen University, Shenzhen, China,Hefei Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, China
Venue:
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Year:
2013

Citing 5
Cited 0

An introduction to differential evolution

New ideas in optimization
Production scheduling and vehicle routing with time windows for perishable food products

Computers and Operations Research
ABC-ACO for Perishable Food Vehicle Routing Problem with Time Windows

ICCIS '10 Proceedings of the 2010 International Conference on Computational and Information Sciences
A novel DE-ABC-Based hybrid algorithm for global optimization

ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Bacterial foraging based approaches to portfolio optimization with liquidity risk

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

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.