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

Abstract

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.

Keywords:

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

Acknowledgements

The authors are thankful to three anonymous referees and to the Associate Editor for their comments and suggestions that filled in the margins for improvement in the original draft. The fast and scrupulous review process of the Journal of the Operational Research Society during the ongoing hardship of the COVID-19 pandemic is deeply appreciated. Dr. Masoud Shahmanzari was partially supported in the last phase of this research by the Scientific Research Project Support No. 32/2020/50 of Istanbul Commerce University.

Disclosure statement

No potential conflict of interest was reported by the authors.