4.5 Article

Multi-period travelling politician problem: A hybrid metaheuristic solution method

期刊

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 73, 期 6, 页码 1325-1346

出版社

TAYLOR & FRANCIS LTD
DOI: 10.1080/01605682.2021.1895684

关键词

Routing; election logistics; travelling politician problem; iterated local search; variable neighbourhood descent; scenario analysis

资金

  1. Istanbul Commerce University [32/2020/50]

向作者/读者索取更多资源

This paper discusses the multi-period travelling politician problem and proposes a hybrid metaheuristic method to solve it, which outperforms other methods in experimental results. The paper provides valuable practical insights that can assist campaign planners in making strategic decisions.
This paper studies the multi-period travelling politician problem whose objective is to maximise the net benefit accrued by a party leader during a fixed campaign period. The problem is also characterised by flexible depots since the daily tours realised by the party leader may not start and end at the same city. A hybrid multi-start Iterated Local Search method complemented with a Variable Neighbourhood Descent is developed to solve the problem heuristically. Two constructive procedures are devised to generate initial feasible solutions. The proposed method is tested on 45 problem instances involving 81 cities and 12 towns in Turkey. Computational results show that the hybrid metaheuristic approach outperforms a recently proposed two-phase matheuristic by producing 7 optimal solutions and 17 new best solutions. In addition, interesting practical insights are provided using scenario analysis that could assist campaign planners in their strategic decisions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据