Does Random Hopping Ensure More Pandal Visits Than Planned Pandal Hopping?

Document Type

Conference Article

Publication Title

Lecture Notes in Networks and Systems

Abstract

India is a country with rich cultural diversities where festivals keep occurring. In this paper, we introduce the pandal hopping problem where travellers intend to acquire maximum rewards, which may be considered as the satisfaction attained by visiting a pandal. Visiting one pandal from another incurs some cost, but reward is awarded only when a new pandal is visited. The goal is to acquire maximum reward within the associated cost. In this paper, we compare different variations of random walk algorithms such as self-avoiding, exponential, log-normal, quadratic distribution and greedy algorithm. We finally establish that a self-avoiding random walk is best suited to solve such problems.

First Page

31

Last Page

40

DOI

10.1007/978-981-19-0105-8_4

Publication Date

1-1-2023

This document is currently not available here.

Share

COinS