Using genetic algorithms for the single allocation hub location problem

Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and crossover operators are explored. The GAs is tested on two well-known sets of real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be extended to other variants of location problems arising in network design planning in transportation systems.

Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem

Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination links are impractical. This work investigates the single allocation hub location problem, and proposes a genetic algorithm (GA) approach for it. The effectiveness of using a single-objective criterion measure for the problem is first explored. Next, a multi-objective GA employing various fitness evaluation strategies such as Pareto ranking, sum of ranks, and weighted sum strategies is presented. The effectiveness of the multi-objective GA is shown by comparison with an Integer Programming strategy, the only other multi-objective approach found in the literature for this problem. Lastly, two new crossover operators are proposed and an empirical study is done using small to large problem instances of the Civil Aeronautics Board (CAB) and Australian Post (AP) data sets.

The use of explicit algorithms and episodic context to teach subtraction to students with learning problems in mathematics /

This research attempted to address the question of the role of explicit algorithms and episodic contexts in the acquisition of computational procedures for regrouping in subtraction. Three groups of students having difficulty learning to subtract with regrouping were taught procedures for doing so through either an explicit algorithm, an episodic content or an examples approach. It was hypothesized that the use of an explicit algorithm represented in a flow chart format would facilitate the acquisition and retention of specific procedural steps relative to the other two conditions. On the other hand, the use of paragraph stories to create episodic content was expected to facilitate the retrieval of algorithms, particularly in a mixed presentation format. The subjects were tested on similar, near, and far transfer questions over a four-day period. Near and far transfer algorithms were also introduced on Day Two. The results suggested that both explicit and episodic context facilitate performance on questions requiring subtraction with regrouping. However, the differential effects of these two approaches on near and far transfer questions were not as easy to identify. Explicit algorithms may facilitate the acquisition of specific procedural steps while at the same time inhibiting the application of such steps to transfer questions. Similarly, the value of episodic context in cuing the retrieval of an algorithm may be limited by the ability of a subject to identify and classify a new question as an exemplar of a particular episodically deflned problem type or category. The implications of these findings in relation to the procedures employed in the teaching of Mathematics to students with learning problems are discussed in detail.

Salivary testosterone and cortisol : role of athletic setting, game outcome, and game location /

Many studies investigating the relationship between hormones and competition have focused on athletic competition. The athletic setting enables r researchers to investigate the hormone-behaviour relationship in a relatively controlled environment. However, research to date has been based on observations made from single status contests and/or weekend tournaments and as such, does not provide a clear picture of an individual's average hormonal responses to both victory and defeat. In appreciation of this limitation, the current study tracked elite hockey players throughout a hockey season, measuring pre- and post-game salivary testosterone and Cortisol as well as psychological measures. I was interested in determining whether status outcome (win vs. loss) would influence an individual's testosterone and Cortisol responses to competition. Furthermore, I was also interested in assessing whether testosterone and Cortisol responses were specific to the competitive environment or whether similar hormonal responses would occur during non-competitive practice sessions. Last, I was interested in whether there were any differences in pre-game hormonal and psychological states depending on where the status contest was held: home versus away. The results indicated that game outcome moderated the testosterone responses to competition. That is, testosterone increased significantly more after a victory compared to a defeat. Furthermore, a loss of status produced significantly hreports, the players did not show an anticipatory rise in either Cortisol or testosterone prior to competition. In addition to the effects of status outcome on hormonal levels, it was also found that these hormonal responses were specific to competition. The athletes in the current study did not demonstrate any hormonal responses to the practice sessions. Last, there were significant differences in pre-game testosterone as well as in selfconfidence, cognitive, and somatic anxiety levels depending on the location at which the status contest took place. Pre-game testosterone and self-confidence levels were significantly higher prior to games played in the home venue. In contrast, pre-game somatic and cognitive anxiety levels were significantly higher prior to games played in the away venue. The current findings add to the developing literature on the relationship between hormones and competition. This was the first study to detect a moderating effect of status outcome on testosterone responses in a team sport. Furthermore, this was also the first study in humans to demonstrate that post-contest Cortisol levels were significantly higher after a loss of status. Last, the current study also adds to the sport psychology literature by demonstrating that pre-game psychological variables differ depending on where the status contest is being held: higher self-confidence at home and higher somatic and cognitive anxiety away. Taken together, the results from the current thesis may have important practical relevance to coaches, trainers and sport psychologists who are always trying to find ways to maximize performance. post-game Cortisol levels than did an increase in status. In contrast to previous

The dual role of students with behavioural problems: an analysis of their experiences as bullies and victims /

The present study examined the bullying experiences of a group of students, age 10-14 years, identified as having behaviour problems. A total often students participated in a series of mixed methodology activities, including self-report questionnaires, story telling exercises, and interview style joumaling. The main research questions were related to the prevalence of bully/victims and the type of bullying experiences in this population. Questionnaires gathered information about their involvement in bullying, as well as about psychological risk factors including normative beliefs about antisocial acts, impulsivity, problem solving, and coping strategies. Journal questions expanded on these themes and allowed students to explain their personal experiences as bullies and victims as well as provide suggestions for intervention. The overall results indicated that all of the ten students in this sample have participated in bullying as both a bully and a victim. This high prevalence of bully/victim involvement in students from behavioural classrooms is in sharp contrast with the general population where the prevalence is about 33%. In addition, a common thread was found that indicated that these students who participated in this study demonstrate characteristics of emotionally dysregulated reactive bullies. Theoretical implication and educational practices are discussed.

Zero-sum problems in finite cyclic groups

The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an integer. This thesis investigates two major problems, the first of which is referred to as the basic pair problem. This problem seeks to determine conditions for which every zero-sequence of a given length in a finite abelian group has the basic property. We resolve an open problem regarding basic pairs in cyclic groups by demonstrating that every sequence of length four in Zp has the basic property, and we conjecture on the complete solution of this problem. The second problem is a 1988 conjecture of Kleitman and Lemke, part of which claims that every sequence of length n in Zn has a subsequence with the basic property. If one considers the special case where n is an odd integer we believe this conjecture to hold true. We verify this is the case for all prime integers less than 40, and all odd integers less than 26. In addition, we resolve the Kleitman-Lemke conjecture for general n in the negative. That is, we demonstrate a sequence in any finite abelian group isomorphic to Z2p (for p ~ 11 a prime) containing no subsequence with the basic property. These results, as well as the results found along the way, contribute to many other problems in zero-sum theory.

Repertory grid adaptations in detecting connotative trends and social behaviour problems in education

Please consult the paper edition of this thesis to read. It is available on the 5th Floor of the Library at Call Number: Z 9999 E38 K66 1983

Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.

Palmer's Pocket Scale with Rules for its Use in Solving Arithmetical and Geometrical Problems

The book is signed by S.D. Woodruff. A label the book indicates that it was also owned by "Band, of De Vere Gardens in Toronto".

Notice of Location of Grave - Wailly Orchard Cemetery

Two notices from the Director of Graves Registration and Enquiries, London, England noting the location of the grave as Wailly Orchard Cemetery near Arras. One of the certificates incorrectly notes the name as S.G. Woodruff while the other correctly has S. D. Woodruff. The number listed for Lieut. S. D. Woodruff's grave site photograph is CCM/9/4433.

Report sent to the President and Director of the Port Dalhousie and Thorold Railway stating that the location of the line extension of the railway is completed

Report sent to the President and Director of the Port Dalhousie and Thorold Railway stating that the location of the line extension of the railway is completed. The distance from Thorold Station to Port Colborne is 20 miles. The estimate provides for construction of a permanent structure across the Chippewa and Welland River. Estimates for building a first class road, culverts and bridges will be of permanent and durable masonry. This includes estimates for various station buildings such as a warehouse in Port Colborne and a warehouse in Port Dalhousie. Surveys and plans are ready and will be registered this week. This is signed by S.D. Woodruff (2 copies) [one appears to be a rough copy] (The rough copy is 5 pages, handwritten and the other copy is 6 pages, handwritten), Apr. 8, 1857.

Letter to Henry Nelles from Michael Harris regarding estate problems

Letter to Henry Nelles from Michael Harris regarding estate problems (3 pages, handwritten with writing going in 2 directions on the last page), May 30, 1821.