Hide/Show Apps

The campaign routing problem

Download
2009
Özdemir, Emrah
In this study, a new selective and time-window routing problem is defined for the first time in the literature, which is called the campaign routing problem (CRP). The two special cases of the CRP correspond to the two real-life problems, namely political campaign routing problem (PCRP) and the experiments on wheels routing problem (EWRP). The PCRP is based on two main decision levels. In the first level, a set of campaign regions is selected according to a given criteria subject to the special time-window constraints. In the second level, a pair of selected regions or a single region is assigned to a campaign day. In the EWRP, a single selected region (school) is assigned to a campaign day. These two problems are modeled using classical mathematical programming and bi-level programming methods, and a two-step heuristic approach is developed for the solution of the problems. Implementation of the solution methods is done using the test instances that are compiled from the real-life data. Computational results show that the solution methods developed generate good solutions in reasonable time.