Modified Elephant Search Algorithm for Distribution of Snack Food in Thailand

This paper focuses on the distribution of snack food which is a real-world problem proposed by a factory operating in Bangkok, Thailand. In this factory, only one planner has to spend hours focusing on the route planning by using his own experience. Therefore, the modification of an elephant search algorithm (ESA) is presented in order to increase the efficiency of the planning that the objective is to minimize the total number of trucks used and the total traveling distance. Computational results on benchmark problem shows that the best solution is obtained by the proposed ESA for all problems. Moreover, in the real-world problem, the proposed ESA can reduce the total number of trucks used, the total traveling distance, and the total cost of delivery.1

[1]  Bruce L. Golden,et al.  A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..

[2]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[3]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[6]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[7]  Simon Fong,et al.  A heuristic optimization method inspired by wolf preying behavior , 2015, Neural Computing and Applications.

[8]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[9]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[11]  Debasish Ghose,et al.  Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions , 2009, Swarm Intelligence.

[12]  Tantikorn Pichpibul,et al.  An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem , 2012 .

[13]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[14]  Simon Fong,et al.  Elephant Search Algorithm for optimization problems , 2015, 2015 Tenth International Conference on Digital Information Management (ICDIM).

[15]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[16]  Adam N. Letchford,et al.  A branch-and-cut algorithm for the capacitated open vehicle routing problem , 2007, J. Oper. Res. Soc..

[17]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[18]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[19]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[20]  Simon Fong,et al.  Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm , 2016, The Journal of Supercomputing.

[21]  James W. Thatcher,et al.  Complexity of computer computations : proceedings , 1972 .