One critical part of decision support during the response phase to a wildfire is the ability to perform large-scale evacuation planning. While in practice most evacuation planning is principally designed by experts using simple heuristic approaches or scenario simulations, more recently optimization approaches to evacuation planning have been carried out, notably in the context of floodings. Evacuation planning in case of wildfires is much harder as wildfire propagations are inherently less predictable than floods. This paper present a new optimization model for evacuation planning in the event of wildfire aiming at maximizing the temporal safety margin between the evac-uees and the actual or potential wildfire front. As a first contribution, an open-source data instance generator based on road network generation via quadtrees and a basic fire propagation model is proposed to the community. As a second contribution we propose 0–1 integer programming and constraint programming formulations enhanced with a 1 simple compression heuristic that are compared on 240 problem instances build by the generator. The results show that the generated instances are computationally challenging and that the contraint programming framework obtains the best performance.