Performance evaluation of distance metrics on Firefly Algorithm for VRP with time windows

被引：3

作者：

Aggarwal D. ^{[1
]}

Kumar V. ^{[2
]}

机构：

[1] Computer Science and Engineering Department, Thapar Institute of Engineering and Technology, Patiala, 147001, Punjab

[2] Computer Science and Engineering Department, National Institute of Technology, Hamirpur, 177005, Himachal Pradesh

来源：

International Journal of Information Technology | 2021年 / 13卷 / 6期

关键词：

Firefly algorithm; Intensity; Optimization; Vehicle Routing Problem with Time Windows;

D O I：

10.1007/s41870-019-00387-7

中图分类号：

学科分类号：

摘要：

In this paper, a modification in randomness factor is proposed for enhancing the exploitation capability of firefly algorithm. The proposed approach is applied on Vehicle Routing Problem with Time Windows (VRPTW). There is no single distance measure that fits for all type of VRPTW. An attempt has been made to evaluate on three different distance measures on the proposed approach. The performance of proposed approach on different distance measures has been evaluated on two well-known instances of Solomon’s benchmark test. The experimental results show that the performance of Brute–Curtis distance measure outperforms the other measures. © 2019, Bharati Vidyapeeth's Institute of Computer Applications and Management.

引用

页码：2355 / 2362

页数：7

共 33 条

[1]

Golden B.L., Assad A.A., Vehicle routing: methods and studies, (1988)

[2]

Hassanzadeh T., Faez K., Seyfi G., A speech recognition system based on structure equivalent fuzzy neural network trained by firefly algorithm, Proceedings of IEEE International Conference on Biomedical Engineering, pp. 63-67, (2012)

[3]

Glover F., Tabu search. Part 1, ORSA, J Comput, 1, 3, pp. 190-206, (1989)

[4]

Pirlot M., General local search methods, Eur J Oper, 92, pp. 493-511, (1996)

[5]

Nature-Inspired Metaheuristic Algorithms, (2008)

[6]

Kumar V., Kumar D., Performance evaluation of distance metrics in the clustering algorithms, INFOCOMP J Comput Sci, 13, 1, pp. 38-52, (2014)

[7]

Sayadi M., Ramezanian R., Ghaffari-Nasab N., A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems, Int J Ind Eng Comput, 1, 1, pp. 1-10, (2010)

[8]

Pullen H., Webb M., A computer application to a transport scheduling problem, Comput J, 10, pp. 10-13, (1967)

[9]

Madsen O.B.G., Optimal scheduling of trucks—a routing problem with tight due times for delivery, Optimization applied to transportation systems, pp. 126-136, (1976)

[10]

Knight K., Hofer J., Vehicle scheduling with timed and connected calls: a case study, Oper Res Q, 19, pp. 299-310, (1968)

← 1 2 3 4 →