Search

The evidence-based parenting program Video-Feedback Intervention to promote Positive Parenting and Sensitive Discipline (VIPP-SD) may have potential to also support teachers in primary schools in their interaction with children with behavior problems. We therefore adapted the intervention for use with primary school teachers (VIPP-School). Here we examined the feasibility of VIPP-School, using qualitative analyses of the perceptions of teachers and VIPP-interveners on their experiences with VIPP-School. Three teacher-child dyads from kindergarten and 2nd grade participated in six sessions of VIPP-School. Perceptions of the participants were collected using semi-structured interviews, logbooks, observations and a questionnaire. The data were qualitatively analysed. Thematic analysis showed five main themes: 1) scheduling of appointments, 2) experiences with intervention elements, 3) working alliance, 4) changes in the teacher-child interaction, 5) defining the target group. Teachers mentioned notable time investment, but appreciated the video feedback as a great way to become more aware of subtle signals of the child and their own behaviors. This study shows that with some adaptations VIPP-School is an acceptable and deliverable intervention for teachers in primary education. It has potential for supporting teachers in the interaction with children with behavioral problems. Further research on the effectiveness of VIPP-School is recommended.

This paper considers the scheduling of electric vehicles in a public transit system. Our main innovation is that we take into account that charging stations have limited capacity, while also considering partial charging. To solve the problem, we expand a connection-based network in order to track the state of charge of vehicles and model recharging actions. We then formulate the electric vehicle scheduling problem as a path-based binary program, whose linear relaxation we solve using column generation. We find integer feasible solutions using two heuristics: price-and-branch and a diving heuristic, including acceleration strategies. We test the approach using data from the concession Gooi en Vechtstreek in the Netherlands, containing up to 816 trips. The diving heuristic outperforms the other heuristic and solves the entire concession within seven hours of computation time with an optimality gap of less than 3%. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0253. [ABSTRACT FROM AUTHOR]