A firefly algorithm for the heterogeneous fixed fleet vehicle routing problem

被引：3

作者：

Matthopoulos P.-P. ^{[1
]}

Sofianopoulou S. ^{[1
,2
]}

机构：

[1] Department of Industrial Management and Technology, University of Piraeus, 80 Karaoli and Dimitriou St., Piraeus

[2] Business School, University of Sunderland, St. Peter's Campus, Sunderland

来源：

International Journal of Industrial and Systems Engineering | 2019年 / 33卷 / 02期

关键词：

Combinatorial optimisation; Firefly algorithm; Nature inspired metaheuristic algorithms; Vehicle routing problem; VRP;

D O I：

10.1504/IJISE.2019.102471

中图分类号：

学科分类号：

摘要：

Vehicle routing is a key success factor in logistics problems. A variation of vehicle routing problem (VRP), the heterogeneous fixed fleet VRP in which the vehicles available for distribution activities are characterised by different capacities and costs, is tackled. A hybrid firefly algorithm for optimising the routing of heterogeneous fixed fleet of vehicles in logistics distribution systems is presented. The principles and key steps of the proposed firefly algorithm are introduced in detail. Experimental results from solving the heterogeneous fixed fleet vehicle routing problem when tested on benchmark datasets are demonstrated. Moreover, the algorithm is compared with other algorithms solving similar problems in order to prove the effectiveness of the proposed hybrid firefly algorithm. Copyright © 2019 Inderscience Enterprises Ltd.

引用

页码：204 / 224

页数：20

共 44 条

[21]

Kumbharana S., Pandey G., Solving travelling salesman problem using firefly algorithm, International Journal for Research in Science and Advanced Technologies, 2, 2, pp. 53-57, (2013)

[22]

Laporte G., The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research, 59, 3, pp. 345-358, (1992)

[23]

Li F., Golden B., Wasil E., A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem, Computations Operational Research, 34, 9, pp. 2734-2742, (2007)

[24]

Li X., Tian P., Aneja Y.P., An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem, Transportational Research, 46, 6, pp. 1111-1127, (2010)

[25]

Na B., Jun Y., Kim B.I., Some extensions to the sweep algorithm, International Journal of Advanced Manufacturing Technology, 56, 9-12, pp. 1057-1067, (2011)

[26]

Naji-Azimi Z., Salari M., A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem, Applied Mathematical Modeling, 37, 6, pp. 4316-4324, (2013)

[27]

Osaba E., Carballedo R., Yang X.-S., Diaz F., An evolutionary discrete firefly algorithm with novel operators for solving the vehicle routing problem with time windows, Nature-Inspired Computation in Engineering. Studies in Computational Intelligence, 637, pp. 1-20, (2016)

[28]

Osaba E., Yang X.-S., Diaz F., Onieva E., A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy, Soft Computing, 21, 18, pp. 5295-5308, (2017)

[29]

Pan F., Ye C., Wang K., Cao J., Research on the vehicle routing problem with time windows using firefly algorithm, Journal of Computers, 8, 9, pp. 2256-2261, (2013)

[30]

Sajjadi S.R., Cheraghi S.H., Multi-products location-routing problem integrated with inventory under stochastic demand, International Journal of Industrial and Systems Engineering, 7, 4, pp. 454-476, (2011)

← 1 2 3 4 5 →