967 resultados para wired train bus


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ängste und Depressionen gehören mitunter zu den häufigsten psychischen Störungen, die mit starkem individuellen Leiden und hohen sozioökonomischen Kosten einhergehen. Kulturell eingebettete biopsychosoziale Belastungsfaktoren tragen zur Entstehung, Aufrechterhaltung und Chronifizierung dieser häufigen Leiden bei. Moderne psychotherapeutische Interventionsprogramme können helfen, die individuellen Belastungsfaktoren besser zu ordnen, Vermeidungsverhalten zu durchbrechen und individuelles Wohlbefinden und psychosoziales Funktionieren zu fördern. Oftmals sind es kleine und feine Verhaltensänderungen im Alltag, die die subjektive Lebensqualität deutlich verbessern. Der Vortrag bietet eine kritische Übersicht über aktuelle psychotherapeutische Behandlungsansätze und deren empirische Evidenz.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper deals with “The Enchanted Journey,” which is a daily event tour booked by Bollywood-film fans. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.