Matching Items (2)
Filtering by
- Creators: Dye, Rosaline
Description
When a rolling ball exits a spiral tube, it typically maintains its final inertial state and travels along straight line in concordance with Newton's first law of motion. Yet, most people predict that the ball will curve, a "naive physics" misconception called the curvilinear impetus (CI) bias. In the current paper, we explore the ecological hypothesis that the CI bias arises from overgeneralization of correct motion of biological agents. Previous research has established that humans curve when exiting a spiral maze, and college students believe this motion is the same for balls and humans. The current paper consists of two follow up experiments. The first experiment tested the exiting behavior of rodents from a spiral rat maze. Though there were weaknesses in design and procedures of the maze, the findings support that rats do not behave like humans who exhibit the CI bias when exiting a spiral maze. These results are consistent with the CI bias being an overgeneralization of human motion, rather than generic biological motion. The second experiment tested physics teachers on their conception of how a humans and balls behave when exiting a spiral tube. Teachers demonstrated correct knowledge of the straight trajectory of a ball, but generalized the ball's behavior to human motion. Thus physics teachers exhibit the opposite bias from college students and presume that all motion is like inanimate motion. This evidence supports that this type of naive physics inertial bias is at least partly due to participants overgeneralizing both inanimate and animate motion to be the same, perhaps in an effort to minimize cognitive reference memory load. In short, physics training appears not to eliminate the bias, but rather to simply shift it from the presumption of stereotypical animate to stereotypical inanimate behavior.
ContributorsDye, Rosaline (Author) / Mcbeath, Michael K (Thesis advisor) / Sanabria, Federico (Committee member) / Megowan, Colleen (Committee member) / Arizona State University (Publisher)
Created2013
Description
This research develops heuristics to manage both mandatory and optional network capacity reductions to better serve the network flows. The main application discussed relates to transportation networks, and flow cost relates to travel cost of users of the network. Temporary mandatory capacity reductions are required by maintenance activities. The objective of managing maintenance activities and the attendant temporary network capacity reductions is to schedule the required segment closures so that all maintenance work can be completed on time, and the total flow cost over the maintenance period is minimized for different types of flows. The goal of optional network capacity reduction is to selectively reduce the capacity of some links to improve the overall efficiency of user-optimized flows, where each traveler takes the route that minimizes the traveler’s trip cost. In this dissertation, both managing mandatory and optional network capacity reductions are addressed with the consideration of network-wide flow diversions due to changed link capacities.
This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule.
Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.
This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule.
Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.
ContributorsPeng, Dening (Author) / Mirchandani, Pitu B. (Thesis advisor) / Sefair, Jorge (Committee member) / Wu, Teresa (Committee member) / Zhou, Xuesong (Committee member) / Arizona State University (Publisher)
Created2017