Evacuating the population during crises to safe zones via optimal paths is vital. The evacuation planning process makes two main decisions: which shelter reach and path take towards chosen shelter. These decisions correspond allocation traffic assignment problems, respectively. Many studies tackled these problems with a static formulation in literature, while only few considered dynamic context...

Abstract Dynamic linear functions on the boolean hypercube are which assign to each bit a positive weight, but weights change over time. Throughout optimization, these maintain same global optimum, and never have defecting local optima. Nevertheless, it was recently shown [Lengler, Schaller, FOCI 2019] that $$(1+1)$$ (...