4 resultados para Multi Kidney Exchange Problem KEP

em Brock University, Canada


Relevância:

40.00% 40.00%

Publicador:

Resumo:

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.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A research project submitted to the Faculty of Extension, University of Alberta in partial fulfillment of the requirements for the degree of Master of Arts in Communications and Technology in 2005.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Picture Exchange Communication System (PECS) is an augmentative and alternative communicative system that improves communication and decreases problem behaviors in children with Developmental Disabilities and Autism. The mediator model is a validated approach that clinicians use to train parents to perform evidence-based interventions. Parental non-adherence to treatment recommendations is a documented problem. This qualitative study investigated clinician-perceived factors that influence parental adherence to PECS recommendations. Three focus groups (n=8) were conducted with Speech Language Pathologists and Behavior Therapists experienced in providing parents with PECS recommendations. Constant comparison analysis was used. In general, clinicians believed that PECS was complex to implement. Thirty-one bridges were identified to overcome complexity. Twenty-two barriers and 6 other factors also impacted parental adherence. Strategies to address these factors were proposed based on a review of the literature. Future research will be performed to validate these findings using parents and a larger sample size.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Population-based metaheuristics, such as particle swarm optimization (PSO), have been employed to solve many real-world optimization problems. Although it is of- ten sufficient to find a single solution to these problems, there does exist those cases where identifying multiple, diverse solutions can be beneficial or even required. Some of these problems are further complicated by a change in their objective function over time. This type of optimization is referred to as dynamic, multi-modal optimization. Algorithms which exploit multiple optima in a search space are identified as niching algorithms. Although numerous dynamic, niching algorithms have been developed, their performance is often measured solely on their ability to find a single, global optimum. Furthermore, the comparisons often use synthetic benchmarks whose landscape characteristics are generally limited and unknown. This thesis provides a landscape analysis of the dynamic benchmark functions commonly developed for multi-modal optimization. The benchmark analysis results reveal that the mechanisms responsible for dynamism in the current dynamic bench- marks do not significantly affect landscape features, thus suggesting a lack of representation for problems whose landscape features vary over time. This analysis is used in a comparison of current niching algorithms to identify the effects that specific landscape features have on niching performance. Two performance metrics are proposed to measure both the scalability and accuracy of the niching algorithms. The algorithm comparison results demonstrate the algorithms best suited for a variety of dynamic environments. This comparison also examines each of the algorithms in terms of their niching behaviours and analyzing the range and trade-off between scalability and accuracy when tuning the algorithms respective parameters. These results contribute to the understanding of current niching techniques as well as the problem features that ultimately dictate their success.