A Discrete Firefly Algorithm for Routing Optimization of Milk-Run

Abstract

Abstract. Route planning and optimization is significant for milk run system. Therefore, taking minimizing the transportation cost as objective, a route optimization model of milk run was developed. For the discreteness of solution, a discrete firefly algorithm based on bi-layer coding was proposed. Finally, through a computational experiment, the feasibility and effectiveness of the model and algorithm were verified. Simulation results show that the algorithm has advantages in precision and convergence speed.

A Firefly Algorithm for the Heterogeneous Fixed Fleet VRP

“…Despite of the fact that firefly algorithm was originally proposed for optimization problems with continuous variables, many attempts have been made in order to implement it in practical problems which are discrete in nature with very promising results. These include job scheduling problems (Sayadi et al, 2010), knapsack problems (Baykasoglu and Ozsoydan, 2014) and vehicle routing problems (Pan et al, 2013;Simic et al, 2015;Wang et al, 2015;Osaba et al, 2016;Saraei and Ali Ghaheri, 2017).…”

Performance Analysis of ACO and FA Algorithms on Parameter Variation Scenarios in Determining Alternative Routes for Cars as a Solution to Traffic Jams

“…then continue checking to the next node 3. The 6th index node in the population is 26, 4 to 26 has no distance, then continue checking to the next node node [1,2,3,4,5,25,17,26] 5th iteration (m-th index starts from k to finish) [1,2,3,4,5,25,17,26,15,19,6,14,27,9,20,21,8,16,22,13,18,23,10,12,24,11,7]…”