subject:(Heuristics)

University of Georgia

1. Li, Rongxia. Integration of GIS techniques and heuristic algorithms to address spatial forest planning issues in the Southern U.S.

Degree: PhD, Forest Resources, 2007, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/li_rongxia_200712_phd

► GIS techniques have been used in the natural resource field over the past few decades. As spatial analyses in forest planning are increasingly needed by… (more)

▼ GIS techniques have been used in the natural resource field over the past few decades. As spatial analyses in forest planning are increasingly needed by forest managers and forest researchers, a high level of integration of GIS techniques and spatial forest planning is inevitable. In addition, the complexity of spatial forest planning problems requires intelligent use of heuristic methods in order to quickly generate forest plans of high quality. In this research, an extensive literature review in North American forestry journals was performed to identify trends and gaps of GIS applications in the natural resource field. Then, an informed development of meta heuristics based on several standard heuristic algorithms - Monte Carlo integer programming, simulated annealing, threshold accepting, tabu search and the raindrop method - was performed. Meta heuristics were composed by combining different standard heuristics, in an intelligent way without the need for direct human intervention. I composed 24 3-algorithm meta heuristics, and results showed that the meta heuristics presented consistently better solution qualities than standard heuristics in solving typical spatial forest planning problems for the southern U.S. region. Finally, by using both GIS and heuristic techniques, I assessed the effects of a forest planning constraint (maximum clearcut size) on forest fragmentation and found that as maximum clearcut size increased, the effects on forest fragmentation seemed to decrease. This analysis used operational GIS databases and a typical southern U.S. forest management problem formulation, each of which posed an analytical problem. First, roads in the operational GIS database were explicitly recognized, creating an artificial barrier between stands when it came to the fragmentation analysis. When roads were removed, I found that fragmentation indices changed slightly, yet the overall trend was the same. Second, I suspected that woodflow constraints in the problem formulation compounded fragmentation by spreading out harvests relatively evenly over the time horizon. By removing woodflow constraints from the analysis, I found this to be true. This work provided three advances to the forestry sciences: a published literature review illustrating the advances and gaps in the use of GIS in forestry, a novel way to integrate standard heuristics into a meta heuristic in order to develop more efficient forest plans, and an analysis of fragmentation in those forest plans for a southern U.S. landowner. Advisors/Committee Members: Pete Bettinger.

Subjects/Keywords: Meta heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, R. (2007). Integration of GIS techniques and heuristic algorithms to address spatial forest planning issues in the Southern U.S. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/li_rongxia_200712_phd

Chicago Manual of Style (16^th Edition):

Li, Rongxia. “Integration of GIS techniques and heuristic algorithms to address spatial forest planning issues in the Southern U.S.” 2007. Doctoral Dissertation, University of Georgia. Accessed February 23, 2020. http://purl.galileo.usg.edu/uga_etd/li_rongxia_200712_phd.

MLA Handbook (7^th Edition):

Li, Rongxia. “Integration of GIS techniques and heuristic algorithms to address spatial forest planning issues in the Southern U.S.” 2007. Web. 23 Feb 2020.

Vancouver:

Li R. Integration of GIS techniques and heuristic algorithms to address spatial forest planning issues in the Southern U.S. [Internet] [Doctoral dissertation]. University of Georgia; 2007. [cited 2020 Feb 23]. Available from: http://purl.galileo.usg.edu/uga_etd/li_rongxia_200712_phd.

Council of Science Editors:

Li R. Integration of GIS techniques and heuristic algorithms to address spatial forest planning issues in the Southern U.S. [Doctoral Dissertation]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/li_rongxia_200712_phd

University of Edinburgh

2. Campbell, Madeleine. Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?.

Degree: 2007, University of Edinburgh

URL: http://hdl.handle.net/1842/1926

► A fundamental question in developmental linguistics and developmental psychology is how young children learn new words. While some researchers suggest that words are primarily learned… (more)

▼ A fundamental question in developmental linguistics and developmental psychology is how young children learn new words. While some researchers suggest that words are primarily learned through experience, others argue that the acquisition process is guided by innate lexical biases. One of the most widely studied biases is the Mutual Exclusivity Bias (ME), which describes children’s preference for just one label per concept. The disambiguation effect in ME has been demonstrated extensively with ostensive paradigms requiring young monolingual children to choose between familiar and novel labels in identifying unfamiliar objects. However, evidence for ME within languages in bilingual children is mixed. In the present study, a productive naming paradigm was used to assess 3-year-olds’ tendency to adopt novel labels for familiar items (a variant on Merriman and Bowman’s (1989) rejection/correction effect). Five monolingual and 5 bilingual children aged 2;11-3;6 were tested in English. Following a training session when the experimenter applied novel labels to 3 of 12 pictures of familiar objects, the children played two successive naming games. The first game involved further reinforcement of the novel labels by the experimenter while the second game did not. In the first game, the bilingual children adopted novel labels more frequently (Mdn=.40) than the monolingual children (Mdn=.13) and Mann-Whitney’s (one-tailed exact) U=3.0, was significant, p<0.05 with a large effect size (r=-.63). In contrast, only one bilingual produced a novel label in the second game. Measures of receptiveness in the training session displayed asymmetries between production and comprehension. Overall the results suggest that experience of two languages plays an important role in learning novel labels. The findings are consistent with an account of ME as a heuristic learned from monolingual input, the application of which varies in bilingual preschoolers according to both ambient language and socio-pragmatic context. The results are discussed in the context of what insights can be gained from possible extensions to the experiment. Advisors/Committee Members: Tamariz, Monica, Skarabela, Barbora.

Subjects/Keywords: linguistics; bilingual; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Campbell, M. (2007). Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/1926

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Campbell, Madeleine. “Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?.” 2007. Thesis, University of Edinburgh. Accessed February 23, 2020. http://hdl.handle.net/1842/1926.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Campbell, Madeleine. “Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?.” 2007. Web. 23 Feb 2020.

Vancouver:

Campbell M. Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?. [Internet] [Thesis]. University of Edinburgh; 2007. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/1842/1926.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Campbell M. Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?. [Thesis]. University of Edinburgh; 2007. Available from: http://hdl.handle.net/1842/1926

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

3. Claudia Anewalt-Remsburg. Candidate Cues: Race, Ethnicity, and Partisanship</h1>.

Degree: PhD, Political Science, 2013, University of Notre Dame

URL: https://curate.nd.edu/show/p8418k7407w

► Previous scholarship on the effect of candidate race on voter evaluations and behavior finds that black candidates are disadvantaged. With the election of the… (more)

▼ Previous scholarship on the effect of candidate race on voter evaluations and behavior finds that black candidates are disadvantaged. With the election of the first African-American president, do voters still view black candidates as less qualified and more liberal? Prior research may not be current for the 21st century, and despite a broad literature that focuses on the role of race in American Politics, growing interest in Latino politics tends to focus on Latino voters rather than evaluations of Latino candidates. Both literatures also overlook how voters use both race and ethnicity cues along with candidate partisanship. This dissertation explores the effect of candidate race and ethnicity on voter evaluations and behavior. Cue Consistency Theory develops hypotheses about how voters will react to these cues in isolation as well as how they interact with candidate partisanship. Original survey experiments were conducted to inquire how candidate race affect voter evaluations of the candidate’s ideology, issue position, competence and qualifications, as well as voter behavior. Overall, the results of the non-partisan context show that Democratic respondents inferred Democratic partisanship from black and Latino candidates, and were particularly favorable in their evaluations and support of these candidates. In a partisan context, race and ethnicity does not have an additive effect, that is black and Latino Democrats are not perceived as more liberal than an identical white Democrat. Likewise, on most measures of ideology and issue position, black and Latino Republicans were not perceived as less conservative than an identical white Republican. In general, race and ethnicity does not negatively affect perceptions of competence and qualifications, nor does it affect turnout and candidate support. On some measures of respondents’ attitudes, Republican respondents were less favorable towards black and Latino candidates. Specifically, in a non-partisan context, Republicans found the black candidate less qualified, and those with cold to neutral feelings towards blacks were less likely to support that candidate. In the partisan context, the Latino conservative Republican was particularly disadvantaged; being perceived as more liberal on taxing and spending, as well as less capable of balancing the budget and working with leaders in business and industry. Advisors/Committee Members: David Nickerson, Committee Member, John D. Griffin, Committee Chair, Geoffrey Layman, Committee Member.

Subjects/Keywords: heuristics; candidate characteristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Anewalt-Remsburg, C. (2013). Candidate Cues: Race, Ethnicity, and Partisanship</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/p8418k7407w

Chicago Manual of Style (16^th Edition):

Anewalt-Remsburg, Claudia. “Candidate Cues: Race, Ethnicity, and Partisanship</h1>.” 2013. Doctoral Dissertation, University of Notre Dame. Accessed February 23, 2020. https://curate.nd.edu/show/p8418k7407w.

MLA Handbook (7^th Edition):

Anewalt-Remsburg, Claudia. “Candidate Cues: Race, Ethnicity, and Partisanship</h1>.” 2013. Web. 23 Feb 2020.

Vancouver:

Anewalt-Remsburg C. Candidate Cues: Race, Ethnicity, and Partisanship</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2013. [cited 2020 Feb 23]. Available from: https://curate.nd.edu/show/p8418k7407w.

Council of Science Editors:

Anewalt-Remsburg C. Candidate Cues: Race, Ethnicity, and Partisanship</h1>. [Doctoral Dissertation]. University of Notre Dame; 2013. Available from: https://curate.nd.edu/show/p8418k7407w

University of Alberta

4. Yang, Fan. Additive abstraction-based heuristics.

Degree: PhD, Department of Computing Science, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/fx719m90m

► In this thesis, we study theoretically and empirically the additive abstraction-based heuristics. First we present formal general definitions for abstractions that extend to general additive… (more)

Subjects/Keywords: heuristic search; additive; heuristics; abstraction

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, F. (2011). Additive abstraction-based heuristics. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/fx719m90m

Chicago Manual of Style (16^th Edition):

Yang, Fan. “Additive abstraction-based heuristics.” 2011. Doctoral Dissertation, University of Alberta. Accessed February 23, 2020. https://era.library.ualberta.ca/files/fx719m90m.

MLA Handbook (7^th Edition):

Yang, Fan. “Additive abstraction-based heuristics.” 2011. Web. 23 Feb 2020.

Vancouver:

Yang F. Additive abstraction-based heuristics. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2020 Feb 23]. Available from: https://era.library.ualberta.ca/files/fx719m90m.

Council of Science Editors:

Yang F. Additive abstraction-based heuristics. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/fx719m90m

Texas A&M University

5. Qin, Jianglei. Algorithms for an Unmanned Vehicle Path Planning Problem.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151090

► Unmanned Vehicles (UVs) have been significantly utilized in military and civil applications over the last decade. Path-planning of UVs plays an important role in effectively… (more)

Subjects/Keywords: Optimization; Heuristics; Prize-multiplier approach

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Qin, J. (2013). Algorithms for an Unmanned Vehicle Path Planning Problem. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151090

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Qin, Jianglei. “Algorithms for an Unmanned Vehicle Path Planning Problem.” 2013. Thesis, Texas A&M University. Accessed February 23, 2020. http://hdl.handle.net/1969.1/151090.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Qin, Jianglei. “Algorithms for an Unmanned Vehicle Path Planning Problem.” 2013. Web. 23 Feb 2020.

Vancouver:

Qin J. Algorithms for an Unmanned Vehicle Path Planning Problem. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/1969.1/151090.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Qin J. Algorithms for an Unmanned Vehicle Path Planning Problem. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151090

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

6. Raja K. Managing manufacturing projects using simulation and meta heuristics;.

Degree: Managing manufacturing projects using simulation and meta heuristics, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27308

►

Companies today find themselves in a highly competitive newlineenvironment of rapidly changing operational requirements The need is to newlinemanage increasing product complexities shorter time to… (more)

Subjects/Keywords: mechanical engineering; meta heuristics; simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

K, R. (2014). Managing manufacturing projects using simulation and meta heuristics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27308

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

K, Raja. “Managing manufacturing projects using simulation and meta heuristics;.” 2014. Thesis, Anna University. Accessed February 23, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/27308.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

K, Raja. “Managing manufacturing projects using simulation and meta heuristics;.” 2014. Web. 23 Feb 2020.

Vancouver:

K R. Managing manufacturing projects using simulation and meta heuristics;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27308.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

K R. Managing manufacturing projects using simulation and meta heuristics;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27308

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Girish B S. Population based search heuristics for scheduling job shops associated with multiple routings;.

Degree: search heuristics for scheduling job shops associated with multiple routings, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26318

►

This thesis addresses two different models of job shop scheduling newlineapplications that are associated with multiple routings The first application is newlinethe well known scheduling… (more)

Subjects/Keywords: mechanical engineering; Population; search heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

S, G. B. (2014). Population based search heuristics for scheduling job shops associated with multiple routings;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

S, Girish B. “Population based search heuristics for scheduling job shops associated with multiple routings;.” 2014. Thesis, Anna University. Accessed February 23, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/26318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

S, Girish B. “Population based search heuristics for scheduling job shops associated with multiple routings;.” 2014. Web. 23 Feb 2020.

Vancouver:

S GB. Population based search heuristics for scheduling job shops associated with multiple routings;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

S GB. Population based search heuristics for scheduling job shops associated with multiple routings;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

8. Rajeswari N. Heuristics for parallel flow scheduling with due date based objective;.

Degree: Heuristics for parallel flow scheduling with due date based objective, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/34349

►

Scheduling theory is concerned with the allocation of a set of limited newlineresources to process a given number of jobs In fact a scheduling problem… (more)

Subjects/Keywords: Heuristics; mechanical engineering; parallel flow

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

N, R. (2015). Heuristics for parallel flow scheduling with due date based objective;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

N, Rajeswari. “Heuristics for parallel flow scheduling with due date based objective;.” 2015. Thesis, Anna University. Accessed February 23, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/34349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

N, Rajeswari. “Heuristics for parallel flow scheduling with due date based objective;.” 2015. Web. 23 Feb 2020.

Vancouver:

N R. Heuristics for parallel flow scheduling with due date based objective;. [Internet] [Thesis]. Anna University; 2015. [cited 2020 Feb 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N R. Heuristics for parallel flow scheduling with due date based objective;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University

9. Gupta, Saurabh. Crossing Minimization in k-layer graphs.

Degree: MS, Computer Science, 2009, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/608

► The crossing minimization problem in graphs has been extensively studied for the case when graphs are to be embedded on two layers. There are many… (more)

Subjects/Keywords: Crossings; Minimization; Heuristics; Barycenter; Median

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gupta, S. (2009). Crossing Minimization in k-layer graphs. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/608

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gupta, Saurabh. “Crossing Minimization in k-layer graphs.” 2009. Thesis, North Carolina State University. Accessed February 23, 2020. http://www.lib.ncsu.edu/resolver/1840.16/608.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gupta, Saurabh. “Crossing Minimization in k-layer graphs.” 2009. Web. 23 Feb 2020.

Vancouver:

Gupta S. Crossing Minimization in k-layer graphs. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2020 Feb 23]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/608.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gupta S. Crossing Minimization in k-layer graphs. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/608

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Louisiana State University

10. Acklin, Dina. Cognitive bias and learning from experience: Reflective processes for reducing bias.

Degree: MA, Psychology, 2014, Louisiana State University

URL: etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335

► While heuristic processing is often useful for quickly ascertaining information in everyday situations, it can lead to inaccuracies when task demands become complex and more… (more)

Subjects/Keywords: heuristics; confirmation bias; decision making

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Acklin, D. (2014). Cognitive bias and learning from experience: Reflective processes for reducing bias. (Masters Thesis). Louisiana State University. Retrieved from etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335

Chicago Manual of Style (16^th Edition):

Acklin, Dina. “Cognitive bias and learning from experience: Reflective processes for reducing bias.” 2014. Masters Thesis, Louisiana State University. Accessed February 23, 2020. etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335.

MLA Handbook (7^th Edition):

Acklin, Dina. “Cognitive bias and learning from experience: Reflective processes for reducing bias.” 2014. Web. 23 Feb 2020.

Vancouver:

Acklin D. Cognitive bias and learning from experience: Reflective processes for reducing bias. [Internet] [Masters thesis]. Louisiana State University; 2014. [cited 2020 Feb 23]. Available from: etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335.

Council of Science Editors:

Acklin D. Cognitive bias and learning from experience: Reflective processes for reducing bias. [Masters Thesis]. Louisiana State University; 2014. Available from: etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335

University of Southern California

11. Mu, Shi. Minimizing congestion on railway networks.

Degree: PhD, Industrial and Systems Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4083

► The railway transportation is becoming more and more important to the whole transportation system. The railway transportation is cost-effective, energy-efficient and safe. The railway is… (more)

▼ The railway transportation is becoming more and more important to the whole transportation system. The railway transportation is cost-effective, energy-efficient and safe. The railway is a major method of transportation of freight and passengers in many countries. Given the fact that the railway industry is facing rapid increasing demand, better planning and scheduling tools are needed to effectively manage the scarce resources. In this thesis, we focus on developing train scheduling and train dispatching algorithms that minimize the congestions on railway networks. ❧ The first part of this thesis studies the freight train scheduling problem. We develop optimization-based approaches for scheduling of freight trains. Two mathematical formulations of the scheduling problem are first introduced. Two heuristics based on mixtures of the two formulations are proposed. The proposed algorithms are able to perform better than two existing heuristics such as a simple look-ahead greedy heuristic and global neighborhood search algorithms, in terms of total train delay. For relatively large networks, two algorithms based on the idea of decomposition are proposed. We use two sample networks to test our proposed decomposition algorithms. The two sample networks are 33.9-mile and 49.3-mile long, respectively. Our decomposition algorithms are shown to outperform the two existing algorithms. ❧ The second part of the thesis studies the train dispatching problem for double-track and triple-track railway segment. The regular dedicated dispatching policy dedicates one track for trains travelling in one direction. If trains are travelling at different speeds, the faster train will catch up with the slower train thus be delayed. We first look at the problem where there are only two train speeds in the network, we propose a switchable dispatching policy for the double-track segment to reduce the chance that a faster train being blocked by a slower train. We use queueing theories to derive the delay functions. The new switchable dispatching policy is shown to significantly reduce the train delays compared to a dedicated policy. We also study the effect of having a crossover at the middle of the track segment. The switchable policy is then extended to the triple-track segment. Several variations of the switchable policy for triple-track segment are studied. Finally, we study the double-track segment dispatching policy for multiple train speeds. Advisors/Committee Members: Dessouky, Maged M. (Committee Chair), Ordonez, Fernando I. (Committee Member), Giuliano, Genevieve (Committee Member).

Subjects/Keywords: train; optimization; scheduling; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mu, S. (2011). Minimizing congestion on railway networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4083

Chicago Manual of Style (16^th Edition):

Mu, Shi. “Minimizing congestion on railway networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed February 23, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4083.

MLA Handbook (7^th Edition):

Mu, Shi. “Minimizing congestion on railway networks.” 2011. Web. 23 Feb 2020.

Vancouver:

Mu S. Minimizing congestion on railway networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Feb 23]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4083.

Council of Science Editors:

Mu S. Minimizing congestion on railway networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4083

Virginia Tech

12. Monk, Monika Patrice. Mobile Exergaming Heuristics.

Degree: MS, Computer Science, 2014, Virginia Tech

URL: http://hdl.handle.net/10919/50581

► An alarming number of adolescents experience obesity and related health issues, in part because of a lack of exercise. Increased mobile technology availability can have… (more)

Subjects/Keywords: Mobile exergaming; mobile design; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Monk, M. P. (2014). Mobile Exergaming Heuristics. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/50581

Chicago Manual of Style (16^th Edition):

Monk, Monika Patrice. “Mobile Exergaming Heuristics.” 2014. Masters Thesis, Virginia Tech. Accessed February 23, 2020. http://hdl.handle.net/10919/50581.

MLA Handbook (7^th Edition):

Monk, Monika Patrice. “Mobile Exergaming Heuristics.” 2014. Web. 23 Feb 2020.

Vancouver:

Monk MP. Mobile Exergaming Heuristics. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/10919/50581.

Council of Science Editors:

Monk MP. Mobile Exergaming Heuristics. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/50581

Cornell University

13. Steinhardt, Joseph. Heuristics And Biases In Narrative And Non-Narrative Risk Messages .

Degree: 2015, Cornell University

URL: http://hdl.handle.net/1813/40953

► Understanding the cognitive heuristics people use to make decisions and the biases in judgment resulting from their use has been a focus of risk communication… (more)

▼ Understanding the cognitive heuristics people use to make decisions and the biases in judgment resulting from their use has been a focus of risk communication research for nearly forty years. During that period, research has demonstrated consistent effects of these heuristics and biases across multiple contexts using fairly standardized approaches to measurement. My previous research, however, has found that people may make decisions inconsistent with the expectations of known cognitive biases when those decisions are situated within narratives. This dissertation expands on that work and examines the role narratives play in decision making, specifically in the reduction of cognitive biases caused by the use of mental heuristics when reading stories. Three experiments empirically examine three known biases: prospect theory framing effects, the effect to which people make different decisions depending on whether a choice is presented as a loss or as a gain (Chapter 2); anchoring effects, the effect to which people judge a decision based on an initial unrelated piece of information given prior to the decision (Chapter 3); and the gambler's fallacy, the faulty notion that the result of an independent event is related to the result of previous independent events (Chapter 4). Chapter two tests whether the influence of narratives over cognitive biases may result from goals held by readers. It found further evidence that narratives reduce the biases related to gain-loss framing effects and no evidence that this reduction was due to goals held while reading. Chapter three explores the role of perceived realism in bias reduction and also tests the anchoring and adjustment heuristic in a narrative. It found that narratives reduce biases related to the anchoring and adjustment heuristic and no evidence that perceived realism of the narratives influenced the reduction. Chapter four examines whether the presentation of a story as either first person or third person influences a reader's decision and also tests the gambler's fallacy in a narrative. The experiment yielded inconclusive results, specifically a difference between the narrative and non-narrative conditions that did not meet the standard and acceptable level of statistical significance. This is notably different from the results presented in chapters 2 and 3, and is possibly due to the fact that unlike the non-narrative versions of the framing and anchoring experiments, narrative information is inherently contained in the non-narrative condition of the gamblers fallacy as it pertains to an ordered sequence of events. Overall, the findings expand our understanding of narrative stories in risk communication as they relate to cognitive heuristics and biases. Specifically, the three experiments suggest that narratives reduce the biases caused by cognitive heuristics in risk decision-making. Advisors/Committee Members: Byrne,Sahara E. (committeeMember), Niederdeppe,Jeffrey D. H. (committeeMember), Shapiro,Michael A (committeeMember), Strogatz,Steven H (committeeMember).

Subjects/Keywords: Risk Communication; Narratives; Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Steinhardt, J. (2015). Heuristics And Biases In Narrative And Non-Narrative Risk Messages . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/40953

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Steinhardt, Joseph. “Heuristics And Biases In Narrative And Non-Narrative Risk Messages .” 2015. Thesis, Cornell University. Accessed February 23, 2020. http://hdl.handle.net/1813/40953.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Steinhardt, Joseph. “Heuristics And Biases In Narrative And Non-Narrative Risk Messages .” 2015. Web. 23 Feb 2020.

Vancouver:

Steinhardt J. Heuristics And Biases In Narrative And Non-Narrative Risk Messages . [Internet] [Thesis]. Cornell University; 2015. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/1813/40953.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Steinhardt J. Heuristics And Biases In Narrative And Non-Narrative Risk Messages . [Thesis]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40953

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Oklahoma

14. Carlson, Benjamin. Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms.

Degree: PhD, 2016, University of Oklahoma

URL: http://hdl.handle.net/11244/34654

► Many approaches to applying Genetic Algorithms (GAs) to Nondeterministic Polynomial time Complete (NPC) problems involve population members encoded directly from the problem solution space. While… (more)

▼ Many approaches to applying Genetic Algorithms (GAs) to Nondeterministic Polynomial time Complete (NPC) problems involve population members encoded directly from the problem solution space. While this technique enables trivial mapping of the population members to solutions, it can cause complex problems for GA operators as they attempt to direct the evolution of the population toward more promising areas of the solution space. These operators, using inspiration from genetics and evolution in the biological world, combine and manipulate the current population to produce a new population that, it is hoped, will eventually converge toward better solutions to the original problem. However, many problems, especially graph-space problems, cannot be so easily manipulated when GA members consist of direct encodings. In such cases, GA operators must perform awkward transformations to convert the progeny into viable solutions. Here is where heuristic encoding comes into play, in that any combination of genes will produce a viable solution. However, this additional level of abstraction does cause other problems and tends to weaken the guiding effects of traditional GA operators. Thus, I have designed custom GA operators that mitigate these problems by using the solutions produced by the heuristic encoded members to better guide the manipulation when producing the next generation. This dissertation shows that heuristic encoding is an effective technique for the representation of solutions to graph-space problems. It also shows that, when using heuristic encoding, GAs with traditional operators perform well compared to more direct encoding techniques. Finally it shows the combination of heuristic encoding and GA operators designed to work with them increases GA performance and can be competitive with other techniques. I believe that these techniques will also work well for other types of problems for which GAs are commonly applied. Advisors/Committee Members: Hougen, Dean (advisor), Havlicek, Joseph (committee member), Atiquzzaman, Mohammed (committee member), Cheng, Samuel (committee member), Radhakrishnan, Sridhar (committee member).

Subjects/Keywords: Heuristics; Genetic Algorithms; Evolutionary Computation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Carlson, B. (2016). Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/34654

Chicago Manual of Style (16^th Edition):

Carlson, Benjamin. “Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms.” 2016. Doctoral Dissertation, University of Oklahoma. Accessed February 23, 2020. http://hdl.handle.net/11244/34654.

MLA Handbook (7^th Edition):

Carlson, Benjamin. “Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms.” 2016. Web. 23 Feb 2020.

Vancouver:

Carlson B. Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms. [Internet] [Doctoral dissertation]. University of Oklahoma; 2016. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/11244/34654.

Council of Science Editors:

Carlson B. Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms. [Doctoral Dissertation]. University of Oklahoma; 2016. Available from: http://hdl.handle.net/11244/34654

Victoria University of Wellington

15. Hunt, Rachel. Genetic Programming Hyper-heuristics for Job Shop Scheduling.

Degree: 2016, Victoria University of Wellington

URL: http://hdl.handle.net/10063/5219

► Scheduling problems arise whenever there is a choice of order in which a number of tasks should be performed; they arise commonly, daily and everywhere.… (more)

▼ Scheduling problems arise whenever there is a choice of order in which a number of tasks should be performed; they arise commonly, daily and everywhere. A job shop is a common manufacturing environment in which a schedule for processing a set of jobs through a set of machines needs to be constructed. Job shop scheduling (JSS) has been called a fascinating challenge as it is computationally hard and prevalent in the real-world. Developing more effective ways of scheduling jobs could increase profitability through increasing throughput and decreasing costs. Dispatching rules (DRs) are one of the most popular scheduling heuristics. DRs are easy to implement, have low computational cost, and cope well with the dynamic nature of real-world manufacturing environments. However, the manual development of DRs is time consuming and requires expert knowledge of the scheduling environment. Genetic programming (GP) is an evolutionary computation method which is ideal for automatically discovering DRs. This is a hyper-heuristic approach, as GP is searching the search space of heuristic (DR) solutions rather than constructing a schedule directly. The overall goal of this thesis is to develop GP based hyper-heuristics for the efficient evolution (automatic generation) of robust, reusable and effective scheduling heuristics for JSS environments, with greater interpretability. Firstly, this thesis investigates using GP to evolve optimal DRs for the static two-machine JSS problem with makespan objective function. The results show that some evolved DRs were equivalent to an optimal scheduling algorithm. This validates both the GP based hyper-heuristic approach for generating DRs for JSS and the representation used. Secondly, this thesis investigates developing ``less-myopic'' DRs through the use of wider-looking terminals and local search to provide additional fitness information. The results show that incorporating features of the state of the wider shop improves the mean performance of the best evolved DRs, and that the inclusion of local search in evaluation evolves DRs which make better decisions over the local time horizon, and attain lower total weighted tardiness. Thirdly, this thesis proposes using strongly typed GP (STGP) to address the challenging issue of interpretability of DRs evolved by GP. Several grammars are investigated and the results show that the DRs evolved in the semantically constrained search space of STGP do not have (on average) performance that is as good as unconstrained. However, the interpretability of evolved rules is substantially improved. Fourthly, this thesis investigates using multiobjective GP to encourage evolution of DRs which are more readily interpretable by human operators. This approach evolves DRs with similar performance but smaller size. Fragment analysis identifies popular combinations of terminals which are then used as high level terminals; the inclusion of these terminals improved the mean performance of the best evolved DRs. Through this thesis the following major… Advisors/Committee Members: Zhang, Mengjie, Johnston, Mark.

Subjects/Keywords: Genetic Programming; Hyper-heuristics; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hunt, R. (2016). Genetic Programming Hyper-heuristics for Job Shop Scheduling. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5219

Chicago Manual of Style (16^th Edition):

Hunt, Rachel. “Genetic Programming Hyper-heuristics for Job Shop Scheduling.” 2016. Doctoral Dissertation, Victoria University of Wellington. Accessed February 23, 2020. http://hdl.handle.net/10063/5219.

MLA Handbook (7^th Edition):

Hunt, Rachel. “Genetic Programming Hyper-heuristics for Job Shop Scheduling.” 2016. Web. 23 Feb 2020.

Vancouver:

Hunt R. Genetic Programming Hyper-heuristics for Job Shop Scheduling. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2016. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/10063/5219.

Council of Science Editors:

Hunt R. Genetic Programming Hyper-heuristics for Job Shop Scheduling. [Doctoral Dissertation]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5219

Tampere University

16. Siipo, Helena. Heuristic Evaluation of a Medical Device Prototype .

Degree: 2019, Tampere University

URL: https://trepo.tuni.fi/handle/10024/118428

► Usability principles are often secondary to clinical effectiveness when assessing medical devices. However, the majority of medical device incidents are linked to user error. Greater… (more)

Subjects/Keywords: heuristics; medical device; facial palsy

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Siipo, H. (2019). Heuristic Evaluation of a Medical Device Prototype . (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/118428

Chicago Manual of Style (16^th Edition):

Siipo, Helena. “Heuristic Evaluation of a Medical Device Prototype .” 2019. Masters Thesis, Tampere University. Accessed February 23, 2020. https://trepo.tuni.fi/handle/10024/118428.

MLA Handbook (7^th Edition):

Siipo, Helena. “Heuristic Evaluation of a Medical Device Prototype .” 2019. Web. 23 Feb 2020.

Vancouver:

Siipo H. Heuristic Evaluation of a Medical Device Prototype . [Internet] [Masters thesis]. Tampere University; 2019. [cited 2020 Feb 23]. Available from: https://trepo.tuni.fi/handle/10024/118428.

Council of Science Editors:

Siipo H. Heuristic Evaluation of a Medical Device Prototype . [Masters Thesis]. Tampere University; 2019. Available from: https://trepo.tuni.fi/handle/10024/118428

University of Illinois – Urbana-Champaign

17. Horne, Zachary S. The influence of an inherence heuristic on scientific explanation.

Degree: PhD, Psychology, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/98226

► Although scientific reasoning is usually deliberate, it may also be influenced by the intuitive processes involved in everyday reasoning. Here, I investigated whether explanatory heuristic… (more)

Subjects/Keywords: Explanation; Psychology; Reasoning; Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Horne, Z. S. (2017). The influence of an inherence heuristic on scientific explanation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98226

Chicago Manual of Style (16^th Edition):

Horne, Zachary S. “The influence of an inherence heuristic on scientific explanation.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 23, 2020. http://hdl.handle.net/2142/98226.

MLA Handbook (7^th Edition):

Horne, Zachary S. “The influence of an inherence heuristic on scientific explanation.” 2017. Web. 23 Feb 2020.

Vancouver:

Horne ZS. The influence of an inherence heuristic on scientific explanation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/2142/98226.

Council of Science Editors:

Horne ZS. The influence of an inherence heuristic on scientific explanation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98226

18. Jonsson, Hanna. Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå.

Degree: Mathematics and Mathematical Statistics, 2016, Umeå University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343

►

Volvo Group’s cab plant in Umeå produces cab bodies and consists of three operating areas; the Stamping and parts production, the Body in White… (more)

▼

Volvo Group’s cab plant in Umeå produces cab bodies and consists of three operating areas; the Stamping and parts production, the Body in White and the Paint shop. Today the plant produces around XXX cabs/week, but the goal is to reach the invested capacity of XXX cabs/week. In order to increase the production capacity, the efficiency of both the manual and the automated processes need to be improved. Unlike the manual processes in where the capacity can be increased by enlarged workforce, the automated processes need to be optimized. Today the cabs are produced in the same order as the orders are received. The cab plant wants to investigate if the capacity of the automated segment in the Body in White unit can be increased by changing the order in the production sequence. This culminates in the following problem definition: Is there untapped potential of the Body in White that can be achieved by an optimization of the production sequence? If so, how can Volvo Group’s cab plant in Umeå utilize this knowledge in the production planning process? The objective of the project was achieved by combining discrete event simulation with a heuristic optimization approach. The results shows that long batches in the production sequence limit the throughput of the system. By spreading the unfavorable subsequences of batches evenly over the production sequence, the total throughput of the Body in White can be increased by 52 cabs/week.

Volvokoncernens hyttfabrik i Umeå producerar förarhytter och är uppdelad i tre driftsområden; pressning och detaljtillverkning, hyttsammansättning och ytbehandling. Idag producerar fabriken ca XXX hytter/vecka, men möjlighet finns att nå upp till den investerade kapaciteten på XXX hytter/vecka. För att kunna öka produktionskapaciteten behöver både de manuella och de automatiserade processerna effektiviseras. Till skillnad från de manuella processerna, där kapaciteten kan ökas genom att öka antalet operatörer, behöver de automatiserade processerna optimeras. Idag produceras hytterna i samma ordning som beställningarna kommer in. Hyttfabriken vill undersöka om det finns en möjlighet att öka kapaciteten för den automatiserade processen i Body in White genom att optimera produktionssekvensen. Detta leder fram till följande problemformulering: Finns det outnyttjad potential i Body in White som kan uppnås genom att optimera produktionssekvensen? Hur kan Volvokoncernens hyttfabrik i Umeå utnyttja denna kunskap vid planering av produktionen? Målet med projektet har uppnåtts genom att kombinera diskret händelsesimulering med optimering genom heuristiker. Resultatet visar att stora batcher av samma variant i produktionen begränsar genomströmningen i processen. Genom att bland annat sprida ut de ogynnsamma delsekvenserna jämnt över produktionssekvensen kan den totala genomströmningen i Body in White ökas med 52 hytter/vecka.

Subjects/Keywords: production sequence; sequencing; simulation; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jonsson, H. (2016). Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Jonsson, Hanna. “Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå.” 2016. Thesis, Umeå University. Accessed February 23, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Jonsson, Hanna. “Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå.” 2016. Web. 23 Feb 2020.

Vancouver:

Jonsson H. Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå. [Internet] [Thesis]. Umeå University; 2016. [cited 2020 Feb 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jonsson H. Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå. [Thesis]. Umeå University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

19. Lyons, David James. EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING.

Degree: PhD, Agricultural and Biological Engineering, 2013, Penn State University

URL: https://etda.libraries.psu.edu/catalog/19745

► The overall objective of this research was to develop and test an automated selective fruit-thinning system for blossom removal in a peach tree orchard. The… (more)

▼ The overall objective of this research was to develop and test an automated selective fruit-thinning system for blossom removal in a peach tree orchard. The proposed system needed to visualize the tree fruit canopy, discriminate targets, mechanically reach the canopy from a stable platform and remove unwanted targets. The experimental system consisted of: vision acquisition hardware, kinematic targeting and heuristic programming, a robotic arm and a pomologically designed end-effector. A quarter-scale robotic arm based on a Fanuc M-16Li robotic arm was designed and constructed. The robotic arm had a payload of 2.5 kg (5.5 lbs) and was mounted on a test plate and platform configuration for study. The robotic arm could deliver a torque greater than 44 N (10 lbf) at a target location. A rotating brush end-effector was also designed and fabricated. The end-effector had a measured tangential force capability of 5.3 N (1.19 lbf ) at the brush blossom interface. The normal and tangential force requirements to remove a peach blossom from a shoot were evaluated. The resultant of the blossom force tests gave a range of 0.44 N to 0.57 N (0.10 lbf - 0.13 lbf) for the normal force and 0.49 N to 0.71 N (0.11 - 0.16 lbf) for the tangential force. Both force ranges were orders of magnitude lower than the deliverable force of the system. Thus, the robotic arm with end-effector combination could effectively remove peach buds and/or blossoms from a branch or shoot configuration. The precision and accuracy of the robotic arm and end-effector placement were also studied. A kinematic positioning test for the robotic arm consisted of 120 repetitions. The resultant 120 test repetitions fell within the first standard deviation of a proposed +/- 2.54 cm (1 in) precision standard. With a confidence level of 95% and a margin of error of +/- 8.96%, the robotic arm had a consistent range of -1.26 cm (0.496 in) to +1.57 cm (0.618 in) in vector magnitude per target location. For the end-effector positioning test the brushes reached the proposed +/- 2.54 cm (1 in) target area 100% of the time. The deviation from target to the center of the brushes was within the first standard deviation with a confidence level of 95% and a margin of error of +/- 10.33%, the end-effector brushes had a consistent range of -2.97 cm (-1.1 in) to +3.04 cm (+1.2 in) per target location. For the heuristic thinning tests of 10 cm (3.93 in), 15 cm (5.90 in) and 20 cm (7.87 in) the end-effector successfully removed the unwanted blossom in each case. The blossom thinning percentage for each case was 100%. In conclusion, a quarter-scale robotic arm and full scale end-effector was designed and built. A system of the robotic arm, end-effector, heuristic and kinematic algorithms was successfully integrated. The robotic arm maneuvered without the end-effector to the respective targets +/- 2.54 cm (1 in) no less than 95% of each test case. The robotic arm maneuvered with the end-effector to the respective targets +/- 2.54 cm (1 in) no less than 95% of each test case. The partial…

Subjects/Keywords: Pomological End-Effector; Peach Thinning; Saturn Blossom Heuristics; Peach Thinning Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lyons, D. J. (2013). EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/19745

Chicago Manual of Style (16^th Edition):

Lyons, David James. “EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING.” 2013. Doctoral Dissertation, Penn State University. Accessed February 23, 2020. https://etda.libraries.psu.edu/catalog/19745.

MLA Handbook (7^th Edition):

Lyons, David James. “EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING.” 2013. Web. 23 Feb 2020.

Vancouver:

Lyons DJ. EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING. [Internet] [Doctoral dissertation]. Penn State University; 2013. [cited 2020 Feb 23]. Available from: https://etda.libraries.psu.edu/catalog/19745.

Council of Science Editors:

Lyons DJ. EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING. [Doctoral Dissertation]. Penn State University; 2013. Available from: https://etda.libraries.psu.edu/catalog/19745

20. Zhao, Xiagang. Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems.

Degree: Docteur es, Informatique, 2011, Université Blaise-Pascale, Clermont-Ferrand II

URL: http://www.theses.fr/2011CLF22125

►

Dans le cadre de cette thèse, nous nous intéressons au problème du transport à la demande. Nous proposons des heuristiques pour résoudre ce problème de… (more)

▼

Dans le cadre de cette thèse, nous nous intéressons au problème du transport à la demande. Nous proposons des heuristiques pour résoudre ce problème de manière rapide et efficace. Dans cette thèse, nous traitons trois problèmes : le premier est le Dial-a-ride (DARP standard). Pour ce problème, nous proposons des heuristiques basées sur la technique d’insertion et une technique de propagation de contrainte. Nous proposons aussi la procédure SPLIT et des opérateurs classiques de recherche locale pour résoudre ce problème. Le second est le DARP multicritères pour laquelle nous proposons un schéma de type ELS. Le troisième est un problème de transport à la demande avec contraintes financières (DARPF), qui est une extension de DARP. Nous résolvons ce problème grâce à une heuristique d’insertion et une technique de propagation de contraintes. La fonction objectif détermine les caractéristiques des tournées. Des résultats expérimentaux montrent que nos (méta-) heuristiques donnent des résultats plus favorables aux clients (meilleure qualité de service)

As part of this thesis, we investigate the vehicle routing problem. We propose heuristics to solve this problem quickly and efficiently. In this thesis, we deal with three problems: the first is the Dial-a-ride problem. For this problem, we propose heuristics based on the technique of insertion and a constraint propagation technique. We propose also the procedure SPLIT and some operators of local research to solve this problem. The second is the multi-criteria DARP for which we propose an ELS framework. The third is a DARP problem with financial constraints (DARPF), which is an extension of DARP. We solve this problem thanks to insertion heuristics using a constraint propagation technique. The objective function determines the characteristics of the tour. Experimental results show that our (meta-) heuristics give results more favorable to customers (better quality of service)

Advisors/Committee Members: Quilliot, Alain (thesis director).

Subjects/Keywords: Heuristique; Méta-heuristique; Transport; Ordonnancement; Heuristics; Meta-heuristics; Transportation; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhao, X. (2011). Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2011CLF22125

Chicago Manual of Style (16^th Edition):

Zhao, Xiagang. “Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems.” 2011. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed February 23, 2020. http://www.theses.fr/2011CLF22125.

MLA Handbook (7^th Edition):

Zhao, Xiagang. “Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems.” 2011. Web. 23 Feb 2020.

Vancouver:

Zhao X. Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2011. [cited 2020 Feb 23]. Available from: http://www.theses.fr/2011CLF22125.

Council of Science Editors:

Zhao X. Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2011. Available from: http://www.theses.fr/2011CLF22125

University of New South Wales

21. Chand, Shelvin. Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem.

Degree: Engineering & Information Technology, 2018, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/60621 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52846/SOURCE02?view=true

► Classical project scheduling problem (PSP) usually involves a set of non-preempt-able and precedence related activities that need to be scheduled. The resource constrained project scheduling… (more)

▼ Classical project scheduling problem (PSP) usually involves a set of non-preempt-able and precedence related activities that need to be scheduled. The resource constrained project scheduling problem (RCPSP) extends the classical project scheduling by taking into account constraints on the resources required to complete the activities. RCPSP is a widely studied NP~(Non-deterministic Polynomial-time)-Hard optimization problem. One particular approach for solving RCPSP instances is through the use of simple priority heuristics. A priority heuristic can be defined as a function which utilizes certain instance characteristics to construct a solution. Priority heuristics are usually the quickest way of obtaining ``good-enough" solutions and have been useful for a range of different combinatorial optimization problems.Design of priority heuristics, however, is a non-trivial task. Usually, the process involves problem experts who extensively study instance characteristics in order to construct new heuristics. This approach can be time-consuming as well being restrictive in terms of the possibilities that can be considered by an expert. As a result, researchers are increasingly exploring methods to automate construction of heuristics, commonly known as hyper-heuristics. Genetic programming based hyper heuristics (GPHH) are more commonly used for this task. It operates on a set of problem attributes and mathematical operators to evolve heuristics. GPHHs have been used in a number of different domains such as job shop scheduling and routing. The same, however, can not be said about RCPSP, as apart from a few foundational studies, the literature is relatively scant. The work presented in this thesis is directed towards addressing the aforementioned gap in the literature. Firstly, a GPHH is presented for evolving different types (arithmetic and decision-tree) of priority heuristics for RCPSP. The effect of different representations and attributes are empirically evaluated and an attempt is made to evolve priority heuristics which can out-perform existing human designed priority heuristics. Next, a GPHH framework is proposed for evolving variants of the rollout-justification procedure in order to leverage the strength of this approach in discovering heuristics which can perform on par with state-of-the-art algorithmic methods. Finally, a dynamic variant of the classical RCPSP is formulated and a multi-objective GPHH is proposed for discovering priority heuristics, with strong performance and low complexity, to deal with dynamic instances. Apart from these major contributions, other improvements in GP and RCPSP are also proposed as part of the research undertaken during this PhD. The heuristics discovered in this study exhibit, either, on-par or superior performance in comparison to existing human designed approaches. Advisors/Committee Members: Singh, Hemant, Engineering & Information Technology, UNSW Canberra, UNSW.

Subjects/Keywords: Resource Constrained Project Scheduling; Optimization; Scheduling; Heuristics; Hyper-Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chand, S. (2018). Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/60621 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52846/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Chand, Shelvin. “Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem.” 2018. Doctoral Dissertation, University of New South Wales. Accessed February 23, 2020. http://handle.unsw.edu.au/1959.4/60621 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52846/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Chand, Shelvin. “Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem.” 2018. Web. 23 Feb 2020.

Vancouver:

Chand S. Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2020 Feb 23]. Available from: http://handle.unsw.edu.au/1959.4/60621 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52846/SOURCE02?view=true.

Council of Science Editors:

Chand S. Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/60621 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52846/SOURCE02?view=true

Anna University

22. Arunkumar N. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.

Degree: multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27971

►

In todays competitive operating environment it is impossible to newlinesuccessfully produce low cost high quality products without satisfactory newlinevendors Supplier selection is one of the… (more)

Subjects/Keywords: integer linear programming; mechanical engineering; meta heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

N, A. (2014). Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27971

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Thesis, Anna University. Accessed February 23, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/27971.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Web. 23 Feb 2020.

Vancouver:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade Nova

23. Kwiatkowski, Lukasz. Application of different heuristic classes in memory-based and stimulus-based decisions.

Degree: 2014, Universidade Nova

URL: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907

►

This paper studies the drivers of heuristic application in different decision types. The study compares differences in frequencies of heuristic classes' such as recognition, one-reason… (more)

Subjects/Keywords: Heuristics; Memory-based; Stimulus-based; Involvement

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kwiatkowski, L. (2014). Application of different heuristic classes in memory-based and stimulus-based decisions. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kwiatkowski, Lukasz. “Application of different heuristic classes in memory-based and stimulus-based decisions.” 2014. Thesis, Universidade Nova. Accessed February 23, 2020. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kwiatkowski, Lukasz. “Application of different heuristic classes in memory-based and stimulus-based decisions.” 2014. Web. 23 Feb 2020.

Vancouver:

Kwiatkowski L. Application of different heuristic classes in memory-based and stimulus-based decisions. [Internet] [Thesis]. Universidade Nova; 2014. [cited 2020 Feb 23]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kwiatkowski L. Application of different heuristic classes in memory-based and stimulus-based decisions. [Thesis]. Universidade Nova; 2014. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

24. Jabbari Arfaee, Shahab. Bootstrap Learning of Heuristic Functions.

Degree: MS, Department of Computing Science, 2010, University of Alberta

URL: https://era.library.ualberta.ca/files/p2676w277

► We investigate the use of machine learning to create effective heuristics for single-agent search. Our method aims to generate a sequence of heuristics from a… (more)

▼ We investigate the use of machine learning to create effective heuristics for single-agent search. Our method aims to generate a sequence of heuristics from a given weak heuristic h{0} and a set of unlabeled training instances using a bootstrapping procedure. The training instances that can be solved using h{0} provide training examples for a learning algorithm that produces a heuristic h{1} that is expected to be stronger than h{0}. If h{0} is so weak that it cannot solve any of the given instances we use random walks backward from the goal state to create a sequence of successively more difficult training instances starting with ones that are guaranteed to be solvable by h{0}. The bootstrap process is then repeated using h{i} instead of h{i-1} until a sufficiently strong heuristic is produced. We test this method on the 15- and 24-sliding tile puzzles, the 17- , 24- , and 35-pancake puzzles, Rubik's Cube, and the 15- and 20-blocks world. In every case our method produces heuristics that allow IDA* to solve randomly generated problem instances quickly with solutions very close to optimal. The total time for the bootstrap process to create strong heuristics for large problems is several days. To make the process efficient when only a single test instance needs to be solved, we look for a balance in the time spent on learning better heuristics and the time needed to solve the test instance using the current set of learned heuristics. %We use two threads in parallel, We alternate between the execution of two threads, namely the learning thread (to learn better heuristics) and the solving thread (to solve the test instance). The solving thread is split up into sub-threads. The first solving sub-thread aims at solving the instance using the initial heuristic. When a new heuristic is learned in the learning thread, an additional solving sub-thread is started which uses the new heuristic to try to solve the instance. The total time by which we evaluate this process is the sum of the times used by both threads up to the point when the instance is solved in one sub-thread. The experimental results of this method on large search spaces demonstrate that the single instance of large problems are solved substantially faster than the total time needed for the bootstrap process while the solutions obtained are still very close to optimal.

Subjects/Keywords: Learning Heuristics; Bootstrapping; Heuristic Search; Planning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jabbari Arfaee, S. (2010). Bootstrap Learning of Heuristic Functions. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/p2676w277

Chicago Manual of Style (16^th Edition):

Jabbari Arfaee, Shahab. “Bootstrap Learning of Heuristic Functions.” 2010. Masters Thesis, University of Alberta. Accessed February 23, 2020. https://era.library.ualberta.ca/files/p2676w277.

MLA Handbook (7^th Edition):

Jabbari Arfaee, Shahab. “Bootstrap Learning of Heuristic Functions.” 2010. Web. 23 Feb 2020.

Vancouver:

Jabbari Arfaee S. Bootstrap Learning of Heuristic Functions. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2020 Feb 23]. Available from: https://era.library.ualberta.ca/files/p2676w277.

Council of Science Editors:

Jabbari Arfaee S. Bootstrap Learning of Heuristic Functions. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/p2676w277

Anna University

25. Omkumar, M. Heuristics for static multilevel assembly job shop scheduling; -.

Degree: Mechanical Engineering, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27493

►

Scheduling is an important activity in any manufacturing enterprise newlinewith major impact on the productivity In manufacturing the purpose of newlinescheduling is to minimize the… (more)

Subjects/Keywords: Heuristics; mechanical engineering; static multilevel assembly

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Omkumar, M. (2014). Heuristics for static multilevel assembly job shop scheduling; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27493

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Omkumar, M. “Heuristics for static multilevel assembly job shop scheduling; -.” 2014. Thesis, Anna University. Accessed February 23, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/27493.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Omkumar, M. “Heuristics for static multilevel assembly job shop scheduling; -.” 2014. Web. 23 Feb 2020.

Vancouver:

Omkumar M. Heuristics for static multilevel assembly job shop scheduling; -. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27493.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Omkumar M. Heuristics for static multilevel assembly job shop scheduling; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27493

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

26. Mahr, Johannes. Rationality outside the Head.

Degree: 2012, University of Edinburgh

URL: http://hdl.handle.net/1842/8458

► The ‘frame problem’ according to Jerry Fodor concerns the question of how a cognitive system like ours can frugally and reliably determine what is relevant… (more)

Subjects/Keywords: frame problem; relevance; heuristics; extended reasoning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mahr, J. (2012). Rationality outside the Head. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8458

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mahr, Johannes. “Rationality outside the Head.” 2012. Thesis, University of Edinburgh. Accessed February 23, 2020. http://hdl.handle.net/1842/8458.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mahr, Johannes. “Rationality outside the Head.” 2012. Web. 23 Feb 2020.

Vancouver:

Mahr J. Rationality outside the Head. [Internet] [Thesis]. University of Edinburgh; 2012. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/1842/8458.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mahr J. Rationality outside the Head. [Thesis]. University of Edinburgh; 2012. Available from: http://hdl.handle.net/1842/8458

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Minnesota

27. Shenk, Lynne. Student Reasoning Strategies Concerning Periodic Trends.

Degree: PhD, Education, Curriculum and Instruction, 2018, University of Minnesota

URL: http://hdl.handle.net/11299/199020

► Abstract The periodic table is recognized as one of the most powerful tools in science. While it is included in virtually all high school and… (more)

▼ Abstract The periodic table is recognized as one of the most powerful tools in science. While it is included in virtually all high school and undergraduate general chemistry curricula, it remains a mystery to many chemistry students who find it impossible to decode. Students are often able to predict periodic trends concerning atomic radius, ionization energy, and electronegativity, however they experience significant difficulty when trying to explain why these trends occur. One way to explore the cause of these difficulties is to focus on the reasoning strategies used by students as they attempt to explain periodic trends. This study investigated student reasoning strategies used to explain periodic trends in atomic and ionic radius, ionization energy, electronegativity, and reactivity. A theoretical framework of scientific reasoning, as it applied to qualitative problem solving, was utilized to identify how the problem solving constraints of domain specific knowledge (DSK) and heuristics were utilized by students as they attempted to explain the periodic trends. This phenomenographic study used semi-structured interviews to assess student reasoning strategies, as well as selected exam and assignment questions to determine the DSK for each student. The findings suggested that student understanding in the domain of electrostatic forces had the greatest influence on the type of reasoning strategies used. Those students with adequate understanding of electrostatic forces had more resources with which to construct explanations that integrated several scientifically appropriate force related factors. Those students without adequate understanding concerning electrostatic forces tended to limit themselves to the use of one factor that was not always adequately justified. They also tended to exhibit fixation by focusing on the same factor for multiple situations, even when that factor was no longer the most appropriate. When presented with an unfamiliar problem there was an increase in the number of one-factor strategies used, with a corresponding decrease in the number of force related explanations. This study suggested that an analysis of student explanations about difficult chemical topics might be helpful in diagnosing the underlying causes of student learning difficulties, and it also highlighted the need to help students learn how to formulate appropriate scientific explanations.

Subjects/Keywords: Chemistry; heuristics; periodic table; periodic trends; reasoning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shenk, L. (2018). Student Reasoning Strategies Concerning Periodic Trends. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/199020

Chicago Manual of Style (16^th Edition):

Shenk, Lynne. “Student Reasoning Strategies Concerning Periodic Trends.” 2018. Doctoral Dissertation, University of Minnesota. Accessed February 23, 2020. http://hdl.handle.net/11299/199020.

MLA Handbook (7^th Edition):

Shenk, Lynne. “Student Reasoning Strategies Concerning Periodic Trends.” 2018. Web. 23 Feb 2020.

Vancouver:

Shenk L. Student Reasoning Strategies Concerning Periodic Trends. [Internet] [Doctoral dissertation]. University of Minnesota; 2018. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/11299/199020.

Council of Science Editors:

Shenk L. Student Reasoning Strategies Concerning Periodic Trends. [Doctoral Dissertation]. University of Minnesota; 2018. Available from: http://hdl.handle.net/11299/199020

University of Minnesota

28. Rafiei, Merdi. A perioperative medicine clinical decision support system: foundation, design, development, evaluation, and the standards.

Degree: PhD, Health Informatics, 2013, University of Minnesota

URL: http://hdl.handle.net/11299/161921

► Abstract 1:Introduction and Background: Decisions regarding medication management during the perioperative period are often made based on clinical anecdotes and vary by provider. Clinical decision… (more)

▼ Abstract 1:Introduction and Background: Decisions regarding medication management during the perioperative period are often made based on clinical anecdotes and vary by provider. Clinical decision support (CDS) tools aid physicians with decision making tasks at the point of care. We have developed a set of perioperative medication management recommendation decision heuristics based on evidence-base literature, clinical notes, and expert opinions. These heuristics will serve as the foundation for a subsequent CDS tool in perioperative medicine. Methods: In this descriptive study, we manually extracted key demographic and medication-related data from the records of 100 randomly-selected patients at the Minneapolis VA's preoperative medicine clinic. We then searched PubMed for studies in perioperative medication management as well as other web sources for expert opinions in the field. Relevant studies, clinical notes, and expert opinions were distilled into an XML-based set of heuristics "rules" file.Results: We have developed medication management recommendation heuristics for the entire VA's formulary of drugs based on evidence-base literature, actual clinical notes, and expert opinions. Discussion and Conclusion: This work shows a proof of concept for the full-scale system development of similar decision support systems – – – – – – – – – – – – – – – – – – – – – – – – – Abstract 2:Background: A clinical decision support tool to manage medications can help perioperative medicine clinicians avoid spending valuable time looking for drug management information during a pre-op physical exam evaluation. Our objective was to develop and validate a clinical decision support (CDS) tool for managing medications perioperatively.Methods: We developed a CDS tool based on a set of heuristics classifiers developed in a previous study, and tested the tool using medication data extracted from the electronic records of 100 randomly selected perioperative medicine patients including medications in use. For each medication, the tool-generated recommendation was compared with actual recommendations in the EHR by experienced preoperative medicine providers.Results: A total of 879 medications were used by the sample population. We extracted 378 "actionable" drugs from the EHR Notes section, compared to 479 identified by the tool, while 334 were identified in both. The total number of "non-actionable" drugs in the EHR notes was 132 compared to 18 flagged by the tool, while 369 were identified by both. In the initial testing phase the tool generated provider-matched recommendations 76% of the time. After correcting for errors and adjudicating the differences by a perioperative medicine domain expert, the tool's matching performance increased to 95%. These results are encouraging.Conclusion: The CDS tool compared favorably with other similar tools and thus can be used as a support tool at the point of care. – – – – – – – Abstract3:Background: Perioperative medicine data is mostly in non-standard, unstructured free…

Subjects/Keywords: CDSS; Expert system; Heuristics; Medication management; Perioperative

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rafiei, M. (2013). A perioperative medicine clinical decision support system: foundation, design, development, evaluation, and the standards. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/161921

Chicago Manual of Style (16^th Edition):

Rafiei, Merdi. “A perioperative medicine clinical decision support system: foundation, design, development, evaluation, and the standards.” 2013. Doctoral Dissertation, University of Minnesota. Accessed February 23, 2020. http://hdl.handle.net/11299/161921.

MLA Handbook (7^th Edition):

Rafiei, Merdi. “A perioperative medicine clinical decision support system: foundation, design, development, evaluation, and the standards.” 2013. Web. 23 Feb 2020.

Vancouver:

Rafiei M. A perioperative medicine clinical decision support system: foundation, design, development, evaluation, and the standards. [Internet] [Doctoral dissertation]. University of Minnesota; 2013. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/11299/161921.

Council of Science Editors:

Rafiei M. A perioperative medicine clinical decision support system: foundation, design, development, evaluation, and the standards. [Doctoral Dissertation]. University of Minnesota; 2013. Available from: http://hdl.handle.net/11299/161921

Rochester Institute of Technology

29. Zhang, Wenbo. Decide vaccine prices and subsidies for developing countries.

Degree: Industrial and Systems Engineering, 2011, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/5701

► Vaccination has been deemed the most cost-effective way to fight against preventable diseases and improve global health. In recent years, expensive combination vaccines which provide… (more)

Subjects/Keywords: Heuristics; Optimization; Pricing; Social surplus; Subsidy; Vaccine

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, W. (2011). Decide vaccine prices and subsidies for developing countries. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5701

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhang, Wenbo. “Decide vaccine prices and subsidies for developing countries.” 2011. Thesis, Rochester Institute of Technology. Accessed February 23, 2020. https://scholarworks.rit.edu/theses/5701.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhang, Wenbo. “Decide vaccine prices and subsidies for developing countries.” 2011. Web. 23 Feb 2020.

Vancouver:

Zhang W. Decide vaccine prices and subsidies for developing countries. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2020 Feb 23]. Available from: https://scholarworks.rit.edu/theses/5701.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang W. Decide vaccine prices and subsidies for developing countries. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/5701

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

30. Gong, Lanyun. Cognitive Heuristics Can Be More Important Than Biomechanics In Human Action Planning: The Near Object Effect In Walking And Reaching.

Degree: MS, Psychology, 2012, Penn State University

URL: https://etda.libraries.psu.edu/catalog/15384

► The coordination of walking and reaching has received remarkably little attention in the study of motor control. Among the few studies that have been done… (more)

Subjects/Keywords: cognitive heuristics; walking; reaching; movement selection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gong, L. (2012). Cognitive Heuristics Can Be More Important Than Biomechanics In Human Action Planning: The Near Object Effect In Walking And Reaching. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/15384

Chicago Manual of Style (16^th Edition):

Gong, Lanyun. “Cognitive Heuristics Can Be More Important Than Biomechanics In Human Action Planning: The Near Object Effect In Walking And Reaching.” 2012. Masters Thesis, Penn State University. Accessed February 23, 2020. https://etda.libraries.psu.edu/catalog/15384.

MLA Handbook (7^th Edition):

Gong, Lanyun. “Cognitive Heuristics Can Be More Important Than Biomechanics In Human Action Planning: The Near Object Effect In Walking And Reaching.” 2012. Web. 23 Feb 2020.

Vancouver:

Gong L. Cognitive Heuristics Can Be More Important Than Biomechanics In Human Action Planning: The Near Object Effect In Walking And Reaching. [Internet] [Masters thesis]. Penn State University; 2012. [cited 2020 Feb 23]. Available from: https://etda.libraries.psu.edu/catalog/15384.

Council of Science Editors:

Gong L. Cognitive Heuristics Can Be More Important Than Biomechanics In Human Action Planning: The Near Object Effect In Walking And Reaching. [Masters Thesis]. Penn State University; 2012. Available from: https://etda.libraries.psu.edu/catalog/15384

Open Access Theses and Dissertations