Parameter Tuning of a Local Search Heuristic for a Vehicle Routing Problem with Loading Constraints

2020
Hanne Pollaris, Gerrit K. Janssens, Kris Braekers, An Caris

A vehicle routing problem (VRP) with sequence-based pallet loading and axle weight constraints is introduced in the study. An Iterated Local Search (ILS) metaheuristic algorithm is used to solve the problem. Like any metaheuristic, a number of parameters need to be set before running the experiments. Parameter tuning is important because the value of the parameters may have a substantial impact on the efficacy of a heuristic algorithm. While traditionally, parameter values have been set manually using expertise and experimentation, recently several automated tuning methods have been proposed. The performance of the routing algorithm is mostly improved by using parameter tuning, but no single best tuning method for routing algorithms exists. The tuning method, Iterated F-race, is chosen because it seems to be a very robust method and it has been shown to perform well on the ILS metaheuristic and other metaheuristics. The research aims at developing an algorithm, which performs well over a wide range of network sizes.

Atslēgas vārdi
Decision making, evolutionary computation, operations research, supply chain management
DOI
10.7250/itms-2020-0008
Hipersaite
https://itms-journals.rtu.lv/article/view/itms-2020-0008

Pollaris, H., Janssens, G., Braekers, K., Caris, A. Parameter Tuning of a Local Search Heuristic for a Vehicle Routing Problem with Loading Constraints. Information Technology and Management Science, 2020, Vol. 23, 55.-63. lpp. e-ISSN 2255-9094. Pieejams: doi:10.7250/itms-2020-0008

Publikācijas valoda
English (en)