论文信息 - DEABC Algorithm for Perishable Goods Vehicle Routing Problem

DEABC Algorithm for Perishable Goods Vehicle Routing Problem

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.

[1] Dervis Karaboga,et al. AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[2] Michel Gendreau,et al. Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[3] Chaug-Ing Hsu,et al. VEHICLE ROUTING PROBLEM FOR DISTRIBUTING REFRIGERATED FOOD , 2003 .

[4] Lidija Zadnik Stirn,et al. A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food , 2008 .

[5] Hui-Chieh Li,et al. Vehicle routing problem with time-windows for perishable food delivery , 2007 .

[6] Kenneth V. Price,et al. An introduction to differential evolution , 1999 .

[7] Ben Niu,et al. Bacterial foraging based approaches to portfolio optimization with liquidity risk , 2012, Neurocomputing.

[8] Zetian Fu,et al. ABC-ACO for Perishable Food Vehicle Routing Problem with Time Windows , 2010, 2010 International Conference on Computational and Information Sciences.

[9] Li Ning,et al. Particle swarm optimization for vehicle routing problem , 2004 .

[10] Mei-Shiang Chang,et al. Production scheduling and vehicle routing with time windows for perishable food products , 2009, Comput. Oper. Res..

[11] Hong Wang,et al. Bacterial Colony Optimization , 2012 .

[12] Ben Niu,et al. A Novel PSO-DE-Based Hybrid Algorithm for Global Optimization , 2008, ICIC.