Dissertations / Theses on the topic 'Heuristic research'
To see the other types of publications on this topic, follow the link: Heuristic research.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Heuristic research.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Rolland, Erik. "Abstract heuristic search methods for graph partitioning." Connect to resource, 1991. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1262633923.
Full text
2
AKSAKALLI, VURAL. "Heuristic Methods for Gang-Rip Saw Arbor Design and Scheduling." NCSU, 1999. http://www.lib.ncsu.edu/theses/available/etd-19991102-031914.
Full textAbstract:
AKSAKALLI, VURAL. Heuristic Methods for Gang-Rip Saw Arbor Design and Scheduling. (Under the direction of Dr. Yahya Fathi).This research considers the problem of designing and scheduling arbors for gang-rip saw systems. Such systems are typically used within the furniture manufacturing industry for processing lumber, where lumber boards are first ripped lengthwise into strips of different widths, and then, cut to the required lengths to be used in manufacturing.A saw with multiple cutting channels is used to perform this operation. This saw has fixed blades at specific positions on a rotating shaft which rips incoming lumber boards into required finished widths. The pattern of cutting channels (i.e., the setting of the blades) along the saw shaft is referred to as an ''arbor''.A typical instance of the problem consists of (1) a set of required finished widths and their corresponding demands, (2) a frequency distribution of lumber boards in the uncut stock, (3) a shaft length, and (4) a blade width. The objective is to design a set of (one or more) arbors and the corresponding quantity of lumber to run through each arbor, such that the total amount of waste generated is minimized while the demand is satisfied.In the research, we focus on solving the problem using only one arbor. First, we discuss the computational complexity of the problem and propose a total enumeration procedure which can be used to solve relatively small instances. Then, we develop algorithms based on heuristic approaches such as local improvement procedures, simulated annealing, and genetic algorithms. Our computational experiments indicate that a local improvement procedure with two nested loops, performing local search with a different neighborhood structure within each loop, gives very high quality solutions to the problem within very short execution times.
3
Höck, Barbar Katja. "An examination of heuristic algorithms for the travelling salesman problem." Master's thesis, University of Cape Town, 1988. http://hdl.handle.net/11427/22268.
Full textAbstract:
The role of heuristics in combinatorial optimization is discussed. Published heuristics for the Travelling Salesman Problem (TSP) were reviewed and morphological boxes were used to develop new heuristics for the TSP. New and published heuristics were programmed for symmetric TSPs where the triangle inequality holds, and were tested on micro computer. The best of the quickest heuristics was the furthest insertion heuristic, finding tours 3 to 9% above the best known solutions (2 minutes for 100 nodes). Better results were found by longer running heuristics, e.g. the cheapest angle heuristic (CCAO), 0-6% above best (80 minutes for 100 nodes). The savings heuristic found the best results overall, but took more than 2 hours to complete. Of the new heuristics, the MST path algorithm at times improved on the results of the furthest insertion heuristic while taking the same time as the CCAO. The study indicated that there is little likelihood of improving on present methods unless a fundamental new approach is discovered. Finally a case study using TSP heuristics to aid the planning of grid surveys was described.
4
Maye, P. J. "Exact and heuristic methods of finding network structure in linear programs." Thesis, Coventry University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.276165.
Full text
5
Asgharzadeh, Talebi Zohreh. "Exact and Heuristic Methods for solving the View-Selection Problem for Aggregate Queries." NCSU, 2006. http://www.lib.ncsu.edu/theses/available/etd-05092006-123513/.
Full textAbstract:
In this thesis we present a formal study of the following view-selection problem: Given a set of queries, a database, and an upper bound on the amount of disk space that can be used to store materialized views, return definitions of views that, when materialized in the database, would reduce the evaluation costs of the queries. Optimizing the layout of stored data using view selection has a direct impact on the performance of the entire database system. At the same time, the optimization problem is intractable, even under natural restrictions on the types of queries of interest. We introduce an integer-programming model to obtain optimal solutions for the view-selection problem for aggregate queries on data warehouses. Through a computational experiment we show that this model can be used to solve realistic-size instances of the problem. We also report the results of the post-optimality analysis that we performed to determine the impact of changing certain input characteristics on the optimal solution. We solve large instances by applying several methods of reducing the size of the search space. We compare our approach to the leading heuristic procedure in the field [20].
6
Samson, Duncan Alistair. "The heuristic significance of enacted visualisation." Thesis, Rhodes University, 2012. http://hdl.handle.net/10962/d1003434.
Full textAbstract:
This study is centred on an analysis of pupils' lived experience while engaged in the generalisation of linear sequences/progressions presented in a pictorial context. The study is oriented within the conceptual framework of qualitative research, and is anchored within an interpretive paradigm. A case study methodological strategy was adopted, the research participants being the members of a mixed gender, high ability Grade 9 class of 23 pupils at an independent school in South Africa. The analytical framework is structured around a combination of complementary multiple perspectives provided by three theoretical ideas, enactivism, figural apprehension, and knowledge objectification. An important aspect of this analytical framework is the sensitivity it shows to the visual, phenomenological and semiotic aspects of figural pattern generalisation. It is the central thesis of this study that the combined complementary multiple perspectives of enactivism, figural apprehension and knowledge objectification provide a powerful depth of analysis to the exploration of the inter-relationship between the embodied processes of pattern generalisation and the visualisation of pictorial cues. The richly textured tapestry of activity captured through a multi-systemic semiotic analysis of participants' generalisation activity stands testament to this central thesis. Insights gleaned from this study are presented as practical strategies which support and encourage a multiple representational approach to pattern generalisation in the pedagogical context of the classroom.
7
Khambhampati, Surya Sudha. "A Tabu Search Heuristic for Multi-Period Clustering to Rationalize Delivery Operations." Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864.
Full text
8
Shah, Mahesh. "A heuristic method for the optimal design of water distribution systems." Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/88600.
Full textAbstract:
The water distribution system design problem consists of finding a minimum cost combination of network layout and sizes of system components so as to satisfy flow demands, minimum and maximum head requirements and a reliability criterion. A two step procedure is proposed to find a near optimal design. The first step considers obtaining a near optimal tree layout using a heuristic tree search algorithm. Two different methods are followed for the tree search - one for single source networks and the other for multiple source networks. The second step adds loop forming redundant links to the tree layout in such a way that every demand node has two paths from source node(s). The methodology is applied to a single source network and a multiple source network. In both the cases better results arc achieved than those obtained previously by other researchers.Master of Science
9
Cain, Mark J. "A GAMS-based model of the U.S. Army Wartime Ammunition Distribution System for the Corps level." Thesis, Monterey, California. Naval Postgraduate School, 1985. http://hdl.handle.net/10945/23244.
Full textAbstract:
Approved for public release; distribution is unlimitedThe U.S. Army Wartime Ammunition Distribution System (WADS) will experience an unprecedented demand for ammunition under the operational concept of Airland Battle. To meet demand, proper storage facility location and an efficient flow through the distribution network will be required. Using information from Army Field Manuals, maps and simulation data for demand, both a mixed integer program (MIP) and a sequential, optimization-based heuristic are developed to model the WADS. The Generalized Algebraic Modelling System is used to implement both models. The sequential heuristic locates ammunition facilities with a binary integer program and then directs ammunition through those facilities utilizing a network flow model with side constraints. The MIP integrates location and flow decisions in the same model. For a general scenario, the sequential heuristic locates a 21 node, 30 arc network with ammunition flows over 30 time periods in 22 CPU seconds on an IBM 3033AP. For the same scenario the MIP obtains a solution for only a 3 time period problem in 87 CPU seconds. Keywords: Ammunition, Integer programming, Heuristic, Networks
http://archive.org/details/gamsbasedmodelof00cain
Captain, United States Army
10
Hiremath, Chaitr. "New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem." Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454.
Full text
11
Reintges, Klaus-Peter. "The Mental Attitude of a Systemic, Constructivist Leader within a Business Organization: A Heuristic Research Project." Thesis, University of Bradford, 2014. http://hdl.handle.net/10454/7499.
Full textAbstract:
This thesis explores leadership from an inverted or inner perspective of a leader. It draws on humanistic, psychological approaches to leadership, and develops a theory of systemic, constructivist leadership. While systemic, constructivist concepts are well known and accepted methods in therapy, counselling, coaching, and organisational consulting, in leadership there is still a gap between theory and practise. In this study systemic, constructivist ideas such as self-organization of human systems, radical constructivism, and systems theory are transferred, through an experiential learning project to leadership practise. Previous research (Steinkellner, 2005) indicated that in addition to the understanding of systemic theory and the application of systemic interventions, the specific mental attitude of a leader is required. So this thesis (1) explores the qualities of the mental attitude of a systemic, constructivist leader, (2) reflects on the transformation of the self of a leader in an experiential learning process, and (3) develops a theory of systemic, constructivist leadership. The methodology is heuristic inquiry, which involves the subjectivity of the researcher, and includes introspective procedures such as self-searching, self-dialogue, and self-discovery (Moustakas, 1990). Its focus on the inner perspective of a leader is unusual, if not unique. Various concepts from humanistic psychology including tacit knowledge (Polanyi & Sen, 2009), awareness (Perls, 1973), and focusing (Gendlin, 2003) were applied to transcend the concept of rationality both in science and in business. The main contributions of this study are: the description of a theory of systemic, constructivist leadership and; the design of appropriate training to implement this.
12
Veeraragavan, Ramanan. "DROP-SHIPPING AT A PROMOTIONAL PRODUCTS DISTRIBUTOR." Wright State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=wright1302893057.
Full text
13
Zacherl, Brian. "Weapon-target pairing revising an air tasking order in real-time." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2006. http://library.nps.navy.mil/uhtbin/hyperion/06Sep%5FZacherl.pdf.
Full textAbstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 2006.Thesis Advisor(s): W. Matthew Carlyle. "September 2006." Includes bibliographical references (p. 35). Also available in print.
14
Molari, Luca. "Algoritmi di ottimizzazione per il bus touring problem." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9275/.
Full textAbstract:
Nel campo della Ricerca Operativa e dei problemi di ottimizzazione viene presentato un problema, denominato Bus Touring Problem (BTP), che modella una problematica
riguardante il carico e l’instradamento di veicoli nella presenza di di vincoli temporali e topologici sui percorsi.
Nel BTP, ci si pone il problema di stabilire una serie di rotte per la visita di punti di interesse dislocati geograficamente da parte di un insieme di comitive turistiche, ciascuna delle quali stabilisce preferenze riguardo le visite. Per gli spostamenti sono disponibili
un numero limitato di mezzi di trasporto, in generale eterogenei, e di capacitá limitata.
Le visite devono essere effettuate rispettando finestre temporali che indicano i periodi di apertura dei punti di interesse; per questi, inoltre, é specificato un numero massimo di visite ammesse. L’obiettivo é di organizzare il carico dei mezzi di trasporto e le rotte intraprese
in modo da massimizzare la soddisfazione complessiva dei gruppi di turisti nel rispetto dei vincoli imposti.
Viene presentato un algoritmo euristico basato su Tabu Search appositamente ideato e progettato per la risoluzione del BTP.
Vengono presentati gli esperimenti effettuati riguardo la messa appunto dei parametri dell'algoritmo su un insieme di problemi di benchmark.
Vengono presentati risultati estesi riguardo le soluzioni dei problemi.
Infine, vengono presentate considerazioni ed indicazioni di sviluppo futuro in materia.
15
Belfiore, Patrícia Prado. "Scatter Search para problemas de roterização de veículos com frota heterogênea, janelas de tempo e entregas fracionadas." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-05092006-145756/.
Full textAbstract:
Esta tese estuda a implementação de heurísticas e da metaheurística scatter search (SS) em um problema de roteirização de veículos com frota heterogênea, janelas de tempo e entregas fracionadas (Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Split Deliveries HFVRPTWSD). O HFVRPTWSD é uma combinação do problema de roteirização com frota heterogênea (HFVRP), problema de roteirização de veículos com janelas de tempo (VRPTW) e problema de roteirização com entregas fracionadas (VRPSD). O problema é baseado em um único depósito, a demanda dos clientes pode ser maior que a capacidade dos veículos e, além das restrições de janelas de tempo, há também restrições de capacidade dos veículos e restrições quanto ao tipo de veículo. O VRPSD foi introduzido na literatura por Dror e Trudeau em 1989. No problema de roteirização de veículos com entregas fracionadas, cada cliente pode ser abastecido por mais de um veículo, enquanto no problema clássico de roteirização de veículos (VRP), cada cliente é atendido por um único veículo. Desta forma, para o VRPSD, além dos roteiros de entrega, deve-se determinar a quantidade entregue a cada cliente em cada veículo. Todos os problemas de roteirização com entregas fracionadas encontrados na literatura (VRPSD e suas extensões) têm como característica frota homogênea. O problema estudado neste trabalho difere, portanto, de todos os problemas de roteirização com entregas fracionadas da literatura, pois tem, como característica, frota heterogênea. O mesmo raciocínio vale para problemas de roteirização de veículos com frota heterogênea. Os modelos são aplicados em uma rede de varejo no Brasil que é abastecida a partir de um centro de distribuição. A rede compõe um total de 519 lojas distribuídas em 12 estados do país. As heurísticas e a metaheurística scatter search também são aplicadas em três conjuntos de problemas encontrados na literatura (SOLOMON, 1987; HO E HAUGLAND, 2004; LIU E SHEN, 1999), com o objetivo de avaliar o desempenho dos algoritmos para cada problema. O problema consiste em determinar, a cada dia, como alocar os caminhões às lojas, a quantidade de carga em cada caminhão a ser entregue em cada uma das lojas, qual o melhor roteiro e o tempo de início de atendimento do primeiro cliente da rota, de forma a minimizar o custo total de distribuição, garantindo que a demanda das lojas seja atendida e as demais restrições do problema sejam respeitadas. Para a resolução do VRPSD e suas extensões, a única metaheurística encontrada na literatura foi busca tabu. Para o problema de roteirização com frota heterogênea e suas extensões, foram implementadas apenas as metaheurísticas busca tabu e BATA (Back-Tracking Adaptative Threshold Accepting). As estratégias de solução propostas no presente trabalho consistem na implementação de heurísticas construtivas e da metaheurística scatter search. As soluções iniciais de SS são obtidas através da implementação de quatro heurísticas construtivas: heurística de economias, heurística de inserção seqüencial baseada nas idéias de Solomon (1987), heurística de inserção seqüencial baseada nas idéias de Ho e Haugland (2004) e adaptação da heurística de inserção seqüencial de Dullaert et al. (2002). Para o caso real, foi possível uma redução no custo total da frota comparado com a solução atual da empresa. Para algumas instâncias dos três conjuntos de problemas da literatura, os algoritmos apresentaram resultados similares ou superiores às melhores soluções encontradas.This thesis studies the implementation of heuristics and scatter search (SS) metaheuristic in a Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Split Deliveries (HFVRPTWSD). The HFVRPTWSD is a combination of Heterogeneous Fleet Vehicle Routing Problem (HFVRP), Vehicle Routing Problem with Time Windows (VRPTW) and Vehicle Routing Problem with Split Deliveries (VRPSD). The problem is based in a single depot, the demand of each client can be greater than the vehicles capacity and beyond the time windows constraints, and there are also constraints on the vehicle capacity and vehicles type. The VRPSD was introduced in the literature by Dror e Trudeau in 1989. In the split deliveries vehicle routing problem, each client can be supplied by more than one vehicle; while in a classic vehicle routing problem (VRP) each client is supplied by only one vehicle. Thus, for the VRPSD, besides the delivery routes, the amount to be delivered to each client in each vehicle must also be determined. All the split delivery vehicle routing problems researched in the literature (VRPSD and its extensions) have as a characteristic the homogeneous fleet. Therefore, the problem studied differs from the split deliveries vehicle routing problems of the literature because it has a heterogeneous fleet. The same reasoning can be applied in heterogeneous fleet vehicle routing problem. The models will be applied in a retail market in Brazil that is supplied by a distribution center. The market has 519 stores distributed in 12 Brazilian states. The heuristics and the scatter search metaheuristic will also be applied in three benchmark problems (SOLOMON, 1987; HO AND HAUGLAND, 2004; LIU AND SHEN, 1999), aiming to evaluate the design of the algorithms for each problem. The problem consists in determining, each day, how to allocate the trucks to the stores, the amount to be delivered in each truck to each client, which one is the best route and the initial time for attending the first client, with the aim of minimizing the total distribution cost, attending the clients demand and respecting all the problems constraints. For the VRPSD and its extensions, the only metaheuristic implemented in the literature was tabu search. For the heterogeneous fleet vehicle routing problem and its extensions, only the tabu search and BATA (Back-Tracking Adaptative Threshold Accepting) metaheuristics have been implemented. The strategies proposed here consist in the implementation of constructive heuristics and the scatter search metaheuristic. The initial solutions of SS are obtained with the implementation of four constructive heuristics: saving heuristics, sequential insertion heuristic based on the ideas of Solomon (1987), sequential insertion heuristic based on the ideas of Ho e Haugland (2004) and adaptation of the sequential insertion heuristic of Dullaert et al. (2002). For the real case, it was possible to reduce the total fleet cost, when comparing to the actual solution. At some instances of the three benchmark problems, the algorithms presented similar or better results when compared to the best solutions in the literature.
16
Dang, Feidi. "AN EFFICIENT HEURISTIC TO BALANCE TRADE-OFFS BETWEEN UTILIZATION AND PATIENT FLOWTIME IN OPERATING ROOM MANAGEMENT." UKnowledge, 2017. https://uknowledge.uky.edu/me_etds/103.
Full textAbstract:
Balancing trade-offs between production cost and holding cost is critical for production and operations management. Utilization of an operating room affects production cost, which relates to makespan, and patient flowtime affects holding cost. There are trade-offs between two objectives, to minimize makespan and to minimize flowtime. However, most existing constructive heuristics focus only on single-objective optimization. In the current literature, NEH is the best constructive heuristic to minimize makespan, and LR heuristic is the best to minimize flowtime. In this thesis, we propose a current and future deviation (CFD) heuristic to balance trade-offs between makespan and flowtime minimizations. Based on 5400 randomly generated instances and 120 instances in Taillard’s benchmarks, our CFD heuristic outperforms NEH and LR heuristics on trade-off balancing, and achieves the most stable performances from the perspective of statistical process control.
17
Karalli, Serge Michael. "THE MULTI-FAMILY ECONOMIC LOT SCHEDULING PROBLEM WITH SAFETY STOCKS." Case Western Reserve University School of Graduate Studies / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=case1094323177.
Full text
18
Cooper, Eileen S. "ON COMPASSION, A NEW PHILOSOPHY OF EDUCATION AND LIVING IN THE QUESTION: AN INWARD JOURNEY TO THE HEART OF THE PRACTICE OF INQUIRY." Cincinnati, Ohio : University of Cincinnati, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=ucin1029337057.
Full text
19
Richmond, Nathaniel. "On stochastic network design: modeling approaches and solution techniques." Diss., University of Iowa, 2016. https://ir.uiowa.edu/etd/2264.
Full textAbstract:
Network design problems have been prevalent and popular in the operations research community for decades, because of their practical and theoretical significance. Due to the relentless progression of technology and the creative development of intelligent, efficient algorithms, today we are able to efficiently solve or give excellent heuristic solutions to many network design problem instances. The purpose of this work is to thoroughly examine and tackle two classes of highly complex network design problems which find themselves at the cutting edge of modern research.
First we examine the stochastic incremental network design problem. This problem differs from traditional network design problems through the addition of both temporal and stochastic elements. We present a modeling framework for this class of problems, conduct a thorough theoretical analysis of the solution structure, and give insights into solution methods.
Next we introduce the robust network design problem with decision-dependent uncertainties. Traditional stochastic optimization approaches shy away from randomness which is directly influenced by a user's decisions, due to the computational challenges that arise. We present a two-stage stochastic programming framework, noting that the complexity of this class of problems is derived from a highly nonlinear term in the first-stage objective function. This term is due to the decision-dependent nature of the uncertainty. We perform a rigorous computational study in which we implement various solution algorithms which are both exact and heuristic, as well as both well-studied and original.
For each of the two classes of problems examined in our work, we give suggestions for future study and offer insights into effective ways of tackling these problems in practice.
20
Drew, Deborah L. "Arts-based research, heuristic inquiry and art education self-study: secondary studio motivation for African American students as a generalizable model." The Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=osu1157591056.
Full text
21
Drew, Deborah Lynn. "Arts-based research, heuristic inquiry and art education self-study secondary studio motivation for African American students as a generalizable model /." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1157591056.
Full text
22
Farias, Everton da Silveira. "A heuristic approach to supply chain network design in a multi-commodity four-echelon logistics system." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/140332.
Full textAbstract:
Nesta tese propõe-se um método heurístico para o problema de Projeto de Rede da Cadeia de Suprimentos (Supply Chain Network Design) considerando vários aspectos de relevância prática, tais como: fornecedores e matérias-primas, localização e operação de instalações, atribuição de Centros de Distribuição (CD), e grande número de clientes e produtos. Uma eficiente abordagem heurística de duas fases é proposta para a obtenção de soluções viáveis para os problemas, que inicialmente é modelado como um Programa Linear Inteiro Misto (PLIM) de grande escala. Na fase de construção, uma estratégia de Linear Programming Rounding é aplicada para se obter os valores iniciais para as variáveis de localização inteira do modelo. Simultaneamente, um método Multi-start foi desenvolvido para gerar soluções iniciais diversificadas para cada nova iteração da heurística de Rounding. Na segunda fase, dois procedimentos de Busca Local foram desenvolvidos no sentido de melhorar a solução fornecida pelo método de Rounding. Implementamos duas diferentes abordagens de Busca Local: remoção-inserção e troca. Uma técnica de Busca Tabu para orientar o procedimento de Busca Local para explorar os diferentes espaços de soluções foi desenvolvida. As formulações e algoritmos foram implementados na linguagem C++ utilizando ferramentas de otimização da COIN-OR. O método de solução foi experimentado em instâncias geradas aleatoriamente, com tamanhos diferentes em termos do número de parâmetros, tais como o número de produtos, zonas de clientes, CDs e fábricas considerando um sistema logístico de quatro níveis. As implementações computacionais mostram que o método de solução proposto obteve resultados satisfatórios quando comparados com a literatura. Para validar este método heurístico também foi usado em um caso realista, com base em dados de uma empresa de borracha que está reestruturando sua cadeia de suprimentos devido ao projeto de uma nova uma nova fábrica e produção de novos produtos. A abordagem heurística proposta revelou-se adequada para aplicação prática em um caso real de uma indústria multicommodity em um contexto determinístico.In this thesis we propose a heuristic method for the Supply Chain Network Design (SCND) problem considering several aspects of practical relevance: suppliers and raw materials, location and operation facilities, distribution center (DC) assignments, and large numbers of customers and products. An efficient two-phase heuristic approach is proposed for obtaining feasible solutions to the problems, which is initially modeled as a large-scale Mixed Integer Linear Program (MILP). In the construction phase, a linear programming rounding strategy is applied to obtain initial values for the integer location variables in the model. Simultaneously, a Multi-start method was developed to generate diversified initial solutions from each new iteration in the rounding heuristic. In the second phase, two Local Search procedures were developed towards to improve the solution provided by the rounding method. We implemented two different Local Search approaches: removal-insertion and exchange. A Tabu Search technique was developed to guide the Local Search procedure to explore the different spaces of solutions. The formulations and algorithms were implemented in C++ code language using the optimization engine COIN-OR. The solution method was experimented in randomly generated instances, with different sizes in terms of the number of parameters, such as number of products, customer zones, DCs, and factories considering a four-echelon logistic system. The computational implementations show that the solution method proposed obtained satisfactory results when compared to the literature review. To validate this heuristic method was also used in a realistic case, based on data from a rubber company that is restructuring its supply chain due to the overture of a new factory, producing new products. The proposed heuristic approach proved appropriate to practical application in a realistic case of a multi commodity industry in a deterministic context.
23
Williams, Matthew J. "A Heuristic Solution to the Pickup and Delivery Problem with Applications to the Outsized Cargo Market." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1238514369.
Full text
24
Thompson, Grant. "Limitlessness and the sublime illuminating notions : an exegesis submitted to Auckland University of Technology in partial fulfilment of the requirements for the degree of Master of Art & Design, 2008 /." Click here to access this resource online, 2008. http://hdl.handle.net/10292/442.
Full textAbstract:
This project explores the basic tenets of abstract expressionism and is considered in relation to the idea of the sublime, limitlessness and the formless. In this research I am interested in investigating the progression from two-dimensional non-representational painting, through experimentation with light mediating materials to projection of the painting via the medium of film. Light is used to intensify the image with a view to expand the viewer’s awareness and understanding of the sublime. The research seeks to find ways that allow the viewer to explore the feeling of uncertainty and the sensation of wonderment. Through an ephemeral spaciousness that has no boundaries, the spectator is encouraged through contemplation to transform their experiences of the finite in order to approach the infinite and the sublime.
25
Scaraficci, Rafael Augusto. "Estrategias hibridas para um problema de planejamento e escalonamento de atividades florestais em curto prazo." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276067.
Full textAbstract:
Orientador: Arnaldo Vieira MouraDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-12T05:42:28Z (GMT). No. of bitstreams: 1 Scaraficci_RafaelAugusto_M.pdf: 1073556 bytes, checksum: 1831ea71ef0edfbf5da96e257b81bbfc (MD5) Previous issue date: 2008
Resumo: Este trabalho de mestrado procurou estudar e resolver um problema real de planejamento e escalonamento de atividades de colheita e de transporte de madeira. Trata-se de um problema típico de grandes empresas do setor de celulose e papel. Ele consiste em planejar, para um horizonte de curto prazo, a colheita de madeira em diferentes áreas florestais e também o transporte da madeira colhida para uma unidade de produção de celulose e papel. O planejamento das atividades florestais considera um conjunto complexo de restrições operacionais, que envolvem, por exemplo, a organização das áreas florestais, propriedades da madeira cortada, a organização das equipes de colheita e a degradação das estradas com as chuvas. Neste projeto, desenvolvemos e analisamos algumas estratégias algorítimas híbridas baseadas em princípios da metaheurística GRASP (Greedy Randomized Adaptive Search Procedure) combinada com elementos de memória de longo prazo, métodos de recombinação de soluções e também modelos lineares. Testes computacionais mostraram que nossas estratégias são robustas e capazes de produzir soluções de alta qualidade em um curto intervalo de tempo.
Abstract: This thesis aimed at studying and solving a planning and scheduling problem stemming from forest harvest and wood transportation activities. Our approach treated a real problem faced by large pulp and paper companies in Brazil. It consists in planning, for a short-term horizon, the harvesting operations in different forest areas and the transportation of the logs to a processing unit, while satisfying a complex set of constraints, which includes constraints related to the structure of the harvest areas, some properties of the logs, the organization of the harvest teams and the degradation of dirt roads during rainy periods. In this research, we developed and evaluated some hybrid algorithmic strategies based on some principles of the GRASP (Greedy Randomized Adaptive Search Procedure), combined with advanced techniques such as long term memory, solution recombination methods and linear models. Computational tests proved that our strategies are robust and able to produce high quality solutions in a short amount of time.
Mestrado
Mestre em Ciência da Computação
26
Luke, Jeremy B. "Parental use of Geographical Aspects of Charter Schools as Heuristic Devices in the School Choice Process." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366364829.
Full text
27
Caetano, Daniel Jorge. "Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-29082011-112817/.
Full textAbstract:
Este trabalho propõe modelos matemáticos e heurísticas para a definição da malha de voos de uma empresa aérea, como parte de seu planejamento operacional, visando à maior eficiência de operação frente às restrições relacionadas aos aeroportos, a equipamentos e à demanda. Em especial, é proposta uma função objetivo, baseada no momento de transporte, para a modelagem integrada dos problemas de Programação de Voos e Alocação de Frotas que inclui elementos específicos para a consideração de slots de pouso e decolagem. A abordagem tem aplicação especialmente relevante no âmbito de empresas aéreas de pequeno e médio porte atuando em mercados regionais, cuja malha é composta principalmente por voos de curta duração, em geral operando com aeronaves de pequeno e médio porte. Nestas condições, tais empresas trabalham com margens de lucro limitadas e, portanto, podem-se beneficiar sensivelmente da definição de uma malha mais eficiente e eficaz. Os modelos desenvolvidos, baseados em programação linear inteira e na meta-heurística Ant Colony Optimization, foram aplicados com sucesso ao caso de uma empresa aérea regional, com atuação no mercado brasileiro, possibilitando a definição de malhas alternativas, bem como fornecendo subsídos para a avaliação dos impactos na malha oriundos da utilização de novas aeronaves.This research proposes mathematical models and heuristics to define the flight mesh of an airline, as part of its operational planning, considering restrictions related to airports, equipment and demand. In particular, an objective function is formulated, based on transport momentum, proposed for the integrated modeling of Flight Scheduling and Fleet Assignment problems that includes specific elements to consider landing and takeoff slots at airports. The approach is especially relevant for small and medium airlines operating in regional markets, with short-haul flights, in general operating with small or medium size aircraft. Accordingly, these companies work with limited profit margins, and, therefore, they can take great benefit from a more efficient and effective flight mesh. The models proposed, based on integer linear programming and on the Ant Colony Optimization meta-heuristic, were successfully applied to the case of a regional airline with operations in Brazil, enabling the definition of mesh alternatives as well as providing information for the assessment of impacts in its flight network arising from the utilization of new aircraft.
28
Wei, Hu. "SOLVING CONTINUOUS SPACE LOCATION PROBLEMS." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.
Full text
29
Albar, Fatima Mohammed. "An Investigation of Fast and Frugal Heuristics for New Product Project Selection." PDXScholar, 2013. https://pdxscholar.library.pdx.edu/open_access_etds/1057.
Full textAbstract:
In the early stages of new product development, project selection is dominantly based on managerial intuition, rather than on analytic approaches. As much as 90% of all product ideas are rejected before they are formally assessed. However, to date, little is known about the product screening heuristics and screening criteria managers use: it has been suggested that their decision process resembles the "fast and frugal" heuristics identified in recent psychological research, but no empirical research exists. A major part of the product innovation pipeline is thus poorly understood.
This research contributes to closing this gap. It uses cognitive task analysis for an in-depth analysis of the new product screening heuristics of twelve experienced decision makers in 66 decision cases. Based on the emerging data, an integrated model of their project screening heuristics is created. Results show that experts adapt their heuristics to the decision at hand. In doing so, they use a much smaller set of decision criteria than discussed in the product development literature. They also combine heuristics into decision approaches that are simple, but more complex than "fast and frugal" strategies. By opening the black box of project screening this research enables improved project selection practices.
30
Tweedie, Krista Lynne. "Relinquishing knowing and reclaiming being : a heuristic self-search inquiry of becoming a counsellor through learning to tolerate uncertainty by reflecting on experiences in life, counselling practice and research." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/15780.
Full textAbstract:
Previous research emphasises the importance of a counsellor’s ‘way of being’ in determining therapeutic effectiveness and outcome. The capacity to tolerate uncertainty is regarded as an important counsellor attribute. However, failing to show how counsellors learn this, limits the practical relevance of the existing literature for psychotherapy and counselling. This study questions how a counsellor can learn to bring his or her self more fully into relationship with clients and what the implications of this learning process on counselling work are. Central to this study is Levine’s (2002) conception that learning occurs through a willingness to think about experiences, which necessitates facing uncertainty. This thesis argues that the capacity to tolerate uncertainty is an individual learning process and a precondition for a counsellor developing his or her ‘way of being’ or therapeutic ‘use of self’ (Wosket, 1999). In this study, the counselling practitioner-researcher draws on her own learning process to show how reflection on personal issues triggered by experiences of uncertainty, that could obstruct a counsellor’s emotional availability necessary for ‘use of self’, may be a fundamental part of counsellor professional development. A learning process is demonstrated through reflection on five vignettes of experiences of uncertainty from life and counselling practice. Beginning with an inexplicable experience in counselling practice that the counsellor struggles to understand her response to, she wonders how her difficulty with tolerating uncertainty might relate to experiences of uncertainty and learned defences from her childhood and adolescence. Through an experience with a client’s overt uncertainty, the practitioner grasps the difference between trying to tolerate uncertainty and developing this capacity as a ‘way of being’. When creative and play work with a child client challenges use of the counsellor’s defences, her learning moves from a conceptual understanding to an embodied one. She becomes more present and vulnerable with clients allowing for connection with clients and greater depth in counselling work. The practitioner-researcher attributes this personal learning to the six phases of Sela Smith’s (2002) heuristic self-search inquiry that requires immersing in uncertainty, dwelling in the research question and accessing tacit knowledge. This study contributes to a lack of practical literature within psychotherapy and counselling on how counsellors develop their therapeutic ‘use of self’, a way of being that has been linked to effective therapeutic outcome yet only a small number of therapists possess. Although the process and findings of this subjective study cannot be generalised, it aims to stimulate each counsellors’ own reflection on therapeutic ‘use of self’. This study suggests a heuristic self-search framework for a counsellor to confront his or her own relationship to uncertainty as an integral part of professional development beyond what training can provide.
31
Ahmadi, Ehsan. "Optimization-based Decision Support Tools for Managing Surgical Supplies and Sterile Instruments." Ohio University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1564482727428522.
Full text
32
Hederstedt, Lövenheim Max, and Johan Krylstedt. "Development of a Heuristic Algorithm to Automate and Improve the Scheduling Process for Tennis Clubs : A Practical Operations Research Thesis with a Case Study at a Padel Club." Thesis, KTH, Optimeringslära och systemteori, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254243.
Full textAbstract:
The scheduling of a tennis school’s operation at a general tennis club is today done manually. This is a time consuming task, usually taking 2-4 weeks for the person responsible. This thesis aims to mathematically formulate the tennis school scheduling problem (TSSP), and to develop a computer based solution procedure to automate the scheduling process. The mathematical formulation of the problem has the structure of an optimization problem and the solution procedure that is developed is a heuristic algorithm for the specific purpose of this problem. Furthermore, a heuristic local search algorithm to improve the initial solution is developed, and the model is then tested on real data in a case study at a padel club in Stockholm. Furthermore, the result from the solution procedure is compared with the manually created schedule by the club on some key parameters from the mathematical model. The computerized solution procedure outperformed the manual scheduling procedure in terms of execution time and most of the times in the objective value of the generated schedule. In terms of the mathematical formulation neither the manually created schedule nor the schedules created by the algorithm gives feasible solutions to the problem. However, the padel club deems the schedules usable and will continue with the ongoing process to implement the model.Schemaläggning av en tennisskolas verksamhet hanteras vanligtvis av en eller flera ansvariga från tennisklubben och utförs manuellt. Det är en tidskrävande uppgift som kräver uppföljning och återkoppling med alla deltagare, vilket kan ta flera veckor. Den här masteruppsatsen ämnar att matematiskt formulera tennisskolans schemaläggningsproblem, "tennis school scheduling problem" (TSSP), och utveckla en schemaläggningsalgoritm för att heuristiskt lösa TSSP som kan imple-menteras med objektorienterad programmering för att automatisera schemaläggningen. Utöver det är en lokal sökalgoritm framtagen för att förbättra schemat skapat av schemaläggningsalgo-ritmen. Algoritmerna är testade på en padelklubbs träningsverksamhet för att jämföra resultaten från algoritmerna mot deras manuellt framtagna schema. Den automatiserade schemaläggningsal-goritmen är e˙ektivare än att manuellt schemalägga verksamheten gällande tidsåtgång och även ofta i målvärde definierat i matematiska modellen. Baserat på data från padelklubben och så som problemet är uppställt i samråd med dem, möter varken det manuellt framtagna schemat eller det genererat med schemaläggningsalgoritmen, efter förbättringsalgoritmen tillämpats, de krav som är ställda på schemat. Trots det är det genererade schemat brukbart enligt padelklubben och de kommer arbeta med att implementera automatiseringen av schemaläggningen.Den automatiserade processen för att ta fram ett schema är tänkt att användas som ett verk-tyg för en schemaansvarig person. Det kan användas för att generera förslag på scheman baserat på deltagares tillgängligheter, för att bespara personens administrativa arbete med schemaläggnin-gen. Mindre ändringar kan sen göras i ett genererat schema och det är enligt dem själva en stor besparing i arbete jämfört med hur det går till i dagsläget.
33
Clark, Kristen E. "Developing individualized education programs with culturally and linguistically diverse families from low-income homes : a heuristic inquiry of special education teachers." Scholarly Commons, 2015. https://scholarlycommons.pacific.edu/uop_etds/867.
Full textAbstract:
Research shows evidence of overrepresentation of culturally and linguistically diverse children enrolled in special education services, a positive correlation between parent involvement and academic success, and a plethora of barriers impeding active 6 parent participation in IEP development. Barriers include language, culture, low income, . and school climate and team dynamics. The aim of this study was to explore: (a) In what ways do special education teachers engage with culturally and linguistically diverse families from low-income homes in the IEP development process? (b) In what ways do special education teachers address culturally and linguistically diverse children's educational needs while also addressing both legal and workplace expectations? (c) In what ways do special education teachers develop IEPs with culturally and linguistically diverse families from low-income homes addressing both legal and workplace
expectations? These questions were addressed qualitatively utilizing Moustakas's heuristic inquiry. Deductively exploring themes using Lipsky's street-level bureaucracy framework exposed challenges special education teachers in this study had addressing both legal and workplace expectations, such as meeting IDEA 2004 mandates. With a systems theory approach, themes and subthemes were identified as being interconnected. Power imbalances between stakeholders and socioeconomic differences across families appeared to be the most prolific barriers impeding parent participation. Inductive analysis explored emergent and uncovered themes elucidating what it meant to be a special education teacher.
34
França, Filho Moacir Felizardo de. "GRASP e Busca Tabu aplicados a problemas de programação de tarefas em maquinas paralelas." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261173.
Full textAbstract:
Orientador: Vinicius Amaral ArmentanoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-10T19:15:18Z (GMT). No. of bitstreams: 1 FrancaFilho_MoacirFelizardode_D.pdf: 1342634 bytes, checksum: 4855202b36314e8c55f20746c709054e (MD5) Previous issue date: 2007
Resumo: Este trabalho é dedicado à programação de tarefas em máquinas paralelas. Dois ambientes são considerados. No primeiro, as máquinas são idênticas e o objetivo é a minimização da soma ponderada de custos de atraso. Todas as tarefas estão disponíveis para processamento no início do horizonte de programação e a cada uma são associadas uma data de entrega e uma penalização por atraso específicas. No segundo, as máquinas são não relacionadas e o objetivo é a minimização da soma ponderada de custos de avanço e de atraso. Instantes de liberação, datas de entrega, penalizações por avanço e por atraso são específicos para cada tarefa. Em ambos, as transições entre tarefas requerem tempos de preparação dependentes da seqüência de processamento. Os problemas são resolvidos por meio de GRASP e Busca Tabu. Memória de longo prazo é empregada para melhorar o desempenho das duas metaheurísticas. No GRASP, soluções de elite influenciam a fase construtiva. Na Busca Tabu, estratégias de diversificação e de intensificação fazem uso direto das soluções de elite e também de freqüências de residência. Como pós-otimização, nas duas metaheurísticas, realizam-se religações de caminhos entre as soluções de elite
Abstract: This work is dedicated to the scheduling of a set of jobs in parallel machines. Two scenarios are considered. In the first one, the machines are identical and the objective is the minimization of the weighted sum of tardiness costs. All jobs are ready for processing at the beginning of the scheduling horizon and to each one is associated a due date and a tardiness penalty. In the second scenario, the machines are non-related and the objective is the minimization of the weighted sum of earliness and tardiness costs. Ready times, due dates, earliness and tardiness penalties are specifics to each job. In both problems, the transitions between jobs require sequence dependent setup times. The problems are solved using GRASP and Tabu Search. Long term memory is applied to improve the performance of the metaheuristics. A set of elite solutions are used to influence the constructive phase in GRASP. In Tabu Search, diversification and intensification strategies make direct use of the elite solutions, as well of residence frequences. Path relinking between the elite solutions is used as a post-optimization approach
Doutorado
Automação
Doutor em Engenharia Elétrica
35
Al-Alusi, A. S. A. "The practical use of dynamic optimisation in operational research : a study of the role of system dynamics simulation and heuristic optimisation in operational research and its application as an advanced technique for policy design in defence models." Thesis, University of Bradford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233647.
Full text
36
Meyers, Ronald B. "A Heuristic for Environmental Values and Ethics, and a Psychometric Instrument to Measure Adult Environmental Ethics and Willingness to Protect the Environment." The Ohio State University, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=osu1039113836.
Full text
37
Steingart, Leia R. "The Fear of Aging and the Self: A Heuristicaly Influenced Study." Digital Commons at Loyola Marymount University and Loyola Law School, 2018. https://digitalcommons.lmu.edu/etd/490.
Full textAbstract:
This research paper is an art-based heuristic influenced study on the fear of aging and the self using an art-based modality of exploration. The researcher sought to study three questions. First, to explore the relationship between aging, beauty, youth, and social pressures. Second, to explore the fears related to aging, (losing appearances, finance, health, and death). Thirdly, to considering the implications of findings to the clinical realm. The art based methodology offered a form of investigation which, informed by heuristic steps of inquiry, augmented both personal meaning and growth. Data consisted of art made over a three-month period as well as structured journaling regarding the research questions and art making process. The imagery, journaling and observations were then collected during the illumination and explication phase, culminating in a final art response of the findings in a creative synthesis.
38
Feriancic, Gabriel. "Modelagem matemática do problema de programação de entregas de derivados de petróleo." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-18092018-090636/.
Full textAbstract:
Esta dissertação trata do problema da distribuição de combustíveis com caminhões-tanque para realizar a entrega de derivados de petróleo para diversos postos de abastecimento a partir de uma base de distribuição. O problema consiste da determinação de rotas para veículos de uma frota heterogênea, visando minimizar o custo total de distribuição dos veículos envolvidos sujeitos a restrições de capacidade dos compartimentos de cada veículos. O objetivo é garantir que cada entrega seja alocada a exatamente um veículo e que todos os veículos sejam adequadamente seqüenciados. Deve-se notar que cada caminhão pode ter até seis compartimentos com diferentes capacidades. Além disso, são consideradas restrições que impedem que um veículo atenda determinado cliente. As restrições relacionadas a essa alocação de pedidos aos compartimentos dos veículos fazem esse problema tornar-se muito diferente de outros problemas de roteirização de veículos. Para ilustrar isso, uma entrega de 5.000 litros para um cliente apenas pode ser alocada em um compartimento de exatamente 5.000 litros, mas não a um compartimento maior preenchido parcialmente. Adicionalmente, caminhões do mesmo tamanho e capacidade (e.g. 30.000 litros) podem possuir diferentes números de compartimentos, inclusive de diferentes tamanhos (e.g. um caminhão de 30.000 litros pode ter 6 compartimentos de 5.000 litros ou 2 compartimentos de 10.000 litros e 2 compartimentos de 5.000 litros), tornando o problema aindamais complexo. Propõe-se inicialmente uma modelagem matemática inédita para o problema. Dada a dificuldade de resolver instâncias de tamanhos reais utilizando ferramentas comerciais de otimização como o ILOG CPLEX 9.0, foi também proposto um algoritmo heurístico que pode alcançar boas soluções em tempos curtos de processamento. Este algoritmo é inspirado em algumas idéias do GRASP. ) Ele se baseia em um método heurístico rápido de construção, que é repetidamente aplicado, baseado em um algoritmo de controle que, repedida e aleatoriamente, remove alguns pedidos da solução corrente, e então reconstrói uma nova solução a partir dos pedidos não-alocados restantes. Também são relatados resultados computacionais com diversos problemas de teste que foram gerados, considerando diferentes tamanhos de problema, bem como diferentes níveis de dificuldade de alocação de pedidos aos caminhões.This Master\'s dissertation deals with the problem of distributing fuels by petroleum tank trucks in the context of the delivery of petroleum products to gas stations originating at a single distribution base. The problem comprises determining the vehicle delivery routes for a heterogeneous fleet, aiming to minimize the total distribution and fixed costs of the vehicles involved subject to capacity constraints for the tank compartments of each vehicle. The objective is to ensure that each delivery is assigned to exactly one truck and all trucks are properly sequenced. It should be noticed that each truck may have one to six tank compartments with different capacities eventually. In addition, there may be restrictions on which vehicles can service each client. The constraints related to the assignment of deliveries to truck compartments makes this problem much different from other vehicle routing problems, thus preventing the traditional routing approaches and formulations to be applied in this case. To illustrate this, a delivery of 5,000 liters to a single client can only be assigned to a compartment of exactly 5,000 liters, but not to a larger compartment which is not entirely filled up. In addition, trucks of the same size and capacity (e.g. 30,000 liters) may have different numbers of compartments and even different sizes (e.g. a 30,000 liters truck may have 6 compartments of 5,000 liters or 2 compartments of 10,000 liters and 2 compartments of 5,000 liters), making the problem even more complicated. We initially propose a novel mathematical IP formulation for this problem. Given the difficulty to solve instances of the same size as found in practice using off-the-shelf cutting-edge optimization tools like ILOG CPLEX 9.0, we also propose a heuristic algorithm that can reach good solutions in very short CPU times. This algorithm is inspired on some ideas of GRASP. ) It relies on a fast constructive heuristic, which is repeatedly applied, based on a control algorithm that repeatedly and randomly remove some deliveries from the current solution, and then rebuilds a new solution from the remaining unassigned and unrouted deliveries. We also report the computational results with several test problems that we have generated, considering different problem sizes, as well as different levels of difficulty related to assignment of orders to trucks.
39
Feigh, Karen M. "Design of cognitive work support systems for airline operations." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26524.
Full textAbstract:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.Committee Chair: Pritchett, Amy R.; Committee Member: Clarke, John-Paul; Committee Member: Cross, Stephen; Committee Member: Endsley, Mica; Committee Member: Goldsman, David. Part of the SMARTech Electronic Thesis and Dissertation Collection.
40
Nyamugure, Philimon. "Modification, development, application and computational experiments of some selected network, distribution and resource allocation models in operations research." Thesis, University of Limpopo, 2017. http://hdl.handle.net/10386/1930.
Full textAbstract:
Thesis (Ph.D. (Statistics)) -- University of Limpopo, 2017Operations Research (OR) is a scientific method for developing quantitatively well-grounded recommendations for decision making. While it is true that it uses a variety of mathematical techniques, OR has a much broader scope. It is in fact a systematic approach to solving problems, which uses one or more analytical tools in the process of analysis. Over the years, OR has evolved through different stages. This study is motivated by new real-world challenges needed for efficiency and innovation in line with the aims and objectives of OR – the science of better, as classified by the OR Society of the United Kingdom. New real-world challenges are encountered on a daily basis from problems arising in the fields of water, energy, agriculture, mining, tourism, IT development, natural phenomena, transport, climate change, economic and other societal requirements. To counter all these challenges, new techniques ought to be developed. The growth of global markets and the resulting increase in competition have highlighted the need for OR techniques to be improved. These developments, among other reasons, are an indication that new techniques are needed to improve the day-to-day running of organisations, regardless of size, type and location. The principal aim of this study is to modify and develop new OR techniques that can be used to solve emerging problems encountered in the areas of linear programming, integer programming, mixed integer programming, network routing and travelling salesman problems. Distribution models, resource allocation models, travelling salesman problem, general linear mixed integer ii programming and other network problems that occur in real life, have been modelled mathematically in this thesis. Most of these models belong to the NP-hard (non-deterministic polynomial) class of difficult problems. In other words, these types of problems cannot be solved in polynomial time (P). No general purpose algorithm for these problems is known. The thesis is divided into two major areas namely: (1) network models and (2) resource allocation and distribution models. Under network models, five new techniques have been developed: the minimum weight algorithm for a non-directed network, maximum reliability route in both non-directed and directed acyclic network, minimum spanning tree with index less than two, routing through 0k0 specified nodes, and a new heuristic to the travelling salesman problem. Under the resource allocation and distribution models section, four new models have been developed, and these are: a unified approach to solve transportation and assignment problems, a transportation branch and bound algorithm for the generalised assignment problem, a new hybrid search method over the extreme points for solving a large-scale LP model with non-negative coefficients, and a heuristic for a mixed integer program using the characteristic equation approach. In most of the nine approaches developed in the thesis, efforts were done to compare the effectiveness of the new approaches to existing techniques. Improvements in the new techniques in solving problems were noted. However, it was difficult to compare some of the new techniques to the existing ones because computational packages of the new techniques need to be developed first. This aspect will be subject matter of future research on developing these techniques further. It was concluded with strong evidence, that development of new OR techniques is a must if we are to encounter the emerging problems faced by the world today. Key words: NP-hard problem, Network models, Reliability, Heuristic, Largescale LP, Characteristic equation, Algorithm.
41
Sacchi, Luís Henrique. "Um estudo computacional da busca tabu paramétrica para programação inteira mista 0-1." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261181.
Full textAbstract:
Orientador: Vinícius Amaral ArmentanoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação
Made available in DSpace on 2018-08-16T07:40:14Z (GMT). No. of bitstreams: 1 Sacchi_LuisHenrique_D.pdf: 1448719 bytes, checksum: f89915d271683e250283d8ec86b25839 (MD5) Previous issue date: 2010
Resumo: Este trabalho apresenta um estudo computacional da busca tabu paramétrica para resolver problemas de programação inteira mista (PIM) com variáveis binárias. Trata-se de uma heurística genérica para problemas PIM gerais que resolve uma série de problemas de programação linear ao incorporar inequações de ramificação de variáveis inteiras como termos ponderados na função objetivo. O procedimento central do método é baseado em memória de curto prazo da busca tabu, enquanto fases de intensificação e diversificação são induzidas pela memória de longo prazo baseada em freqüência e idéias derivadas de scatter search. Novas estratégias são propostas para encontrar soluções de alta qualidade e extensivos testes computacionais são realizados em instâncias da literatura
Abstract: We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems that solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. The core procedure is founded on short term memory, whereas both intensification and diversification phases are induced by long term memory based on frequency and ideas derived from scatter search. New strategies are proposed for uncovering feasible and high-quality solutions and extensive computational tests are performed on instances from the literature
Doutorado
Automação
Doutor em Engenharia Elétrica
42
Brisola, Elizabeth Brown Vallim. "Quem canta os males espanta? : um estudo heur?stico da viv?ncia de cantar." Pontif?cia Universidade Cat?lica de Campinas, 2000. http://tede.bibliotecadigital.puc-campinas.edu.br:8080/jspui/handle/tede/299.
Full textAbstract:
Made available in DSpace on 2016-04-04T18:28:06Z (GMT). No. of bitstreams: 1
ELIZABETH BROWN VALLIM BRISOLA.pdf: 1960176 bytes, checksum: 5b28927ce568f33132ed26417a40888b (MD5)
Previous issue date: 2008-09-23Pontif?cia Universidade Cat?lica de Campinas
This is a qualitative exploratory research, with the objective of describing elements that are present in the experience of singing, through the eyes of psychology. A theoretical background on singing and music is presented, with an emphasis on mental health and clinical psychology. Six adults, of both sexes and with varied ages, professions, education and interests, were interviewed about important moments they had in relation to singing. The research steps were taken according to the heuristic method, elaborated by Clark Moustakas, with emphasis on the meanings experienced by the subjects, who were called co-researchers in this study, so as to understand the elements present in their experience. The data analysis is presented in the form of descriptions of the experience of singing in relation to each coresearcher and to the group as a whole; a portrait was drawn of two co-reseachers, chosen as the ones who best represented the experience of the group of co-researchers. The data analysis ends with a creative synthesis. The experience of singing was revealed as a natural human activity that evolves as part of one s individual history, with various physical, emotional, social and spiritual effects. Singing showed itself as an experience wich is both individual, personal and ecological, social, shared; an expression of mental health and personal integration. While being perfected, singing can serve as a means of contacting and developing
Resumo: Trata-se de uma pesquisa qualitativa de tipo explorat?ria que visa descrever elementos presentes na viv?ncia de cantar, considerada do ponto de vista psicol?gico. Apresenta um embasamento te?rico sobre m?sica e cantar, com ?nfase numa perspectiva de sa?de mental e psicologia cl?nica. Foram colhidos os depoimentos de seis adultos, de ambos os sexos e com idades, atividades profissionais, escolaridade e interesses variados, sobre situa??es marcantes vivenciadas em rela??o a experi?ncia de cantar. Os passos da pesquisa foram elaborados de acordo com o m?todo heur?stico, desenvolvido por Clark Moustakas, dando import?ncia para os significados vividos pelos sujeitos, chamados neste estudo de "co-pesquisadores", de forma a apreender os elementos presentes nas suas experi?ncias. A an?lise dos dados ? apresentada sob a forma de descri??es da experi?ncia de cantar em rela??o a cada co-pesquisador e ao grupo como um todo; posteriormente, elaborou-se o retrato de dois dos participantes, escolhidos como aqueles que melhor representavam as viv?ncias deste grupo de co-pesquisadores. Finalmente, comp?s-se uma s?ntese criativa. A experi?ncia de cantar revelou-se como uma atividade humana natural, com desenvolvimento ?nico, original em cada pessoa, com efeitos f?sicos, emocionais, sociais e espirituais. Mostrou-se tamb?m como uma experi?ncia pessoal, individual e, ao mesmo tempo, ecol?gica, social ou compartilhada; uma atividade que promove a sa?de mental e integra??o das pessoas; o seu aperfei?oamento pode servir como um meio de entrar em contato e desenvolver um conhecimento a respeito de m?sica e de si mesmo. Al?m disso observou-se diferentes n?veis de envolvimento ao cantar.
43
Pereira, Romulo Albuquerque. "Escalonamento de atividades de desenvolvimento de poços de petroleo: GRASP." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276506.
Full textAbstract:
Orientador: Arnaldo Vieira MouraDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-06T15:19:37Z (GMT). No. of bitstreams: 1 Pereira_RomuloAlbuquerque_M.pdf: 1452483 bytes, checksum: 19f11b532a512f1e86efa79195a4e8ce (MD5) Previous issue date: 2005
Resumo: Este trabalho de mestrado procurou estudar e resolver um problema real de escalonamento das atividades de desenvolvimento de poços de petróleo em alto mar. Uma versão mais simples deste mesmo problema foi provada ser NP- difícil. Nosso estudo se concentrou no problema real enfrentado pela Petrobrás, com todas suas características e nuances. Antes que locais promissores de bacias petrolíferas sejam efetivamente desenvolvidos em poços de petróleo produtivos, é necessário realizar diversas atividades de perfuração, completarão e interligação nesses locais. O escalonamento dessas atividades deve satisfazer várias restrições conflitantes e buscar a maximização da produção de petróleo em um dado horizonte de tempo. O problema foi atacado em duas etapas: uma sem considerar o deslocamento de recursos e outra considerando-os. Para tal, adotamos a estratégia Greedy Randomized Adaptive Search Procedure (GRASP) e incorporamos várias técnicas específicas para obter melhor desempenho e qualidade da solução final. Os resultados são comparados com outros produzidos por uma ferramenta computacional baseada em Programação por Restrições (PR). Esta última, já em uso e bem aceita na empresa, foi desenvolvida pela Petrobrás. Resultados comparativos realizados em instâncias reais indicam que a implementação GRASP supera a ferramenta de PR produzindo soluções com expressivos aumentos de produção
Abstract: This dissertation aimed at studying and solving a real world scheduling problem. We deal with the scheduling of offshore oil well development activities. A simpler version of this same problem was proved to be in NP-hard. Our approach treats this problem as faced by Petrobras, with all its characteristics and details. Before promising locations at petroliferous basins become productive oil wells, it is often necessary to complete activities of drilling, completion and interconnection at these locations. The scheduling of such activities must satisfy several conflicting constraints and aim at the maximization of oil production. The problem was solved in two parts: one without considering resource displacements and other taking into account such displacements. For such, we used a Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic and used several techniques and variants in order to obtain more efficiency and produce better solutions. The results are compared with schedules produced by a well-accepted constraint programming implementation. Computational experience on real instances indicates that the GRASP implementation is competitive, outperforming the constraint programming implementation
Mestrado
Otimização Combinatoria
Mestre em Ciência da Computação
44
Yee, Michael 1978. "Inferring noncompensatory choice heuristics." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36226.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2006.Includes bibliographical references (p. 121-128).
Human decision making is a topic of great interest to marketers, psychologists, economists, and others. People are often modeled as rational utility maximizers with unlimited mental resources. However, due to the structure of the environment as well as cognitive limitations, people frequently use simplifying heuristics for making quick yet accurate decisions. In this research, we apply discrete optimization to infer from observed data if a person is behaving in way consistent with a choice heuristic (e.g., a noncompensatory lexicographic decision rule). We analyze the computational complexity of several inference related problems, showing that while some are easy due to possessing a greedoid language structure, many are hard and likely do not have polynomial time solutions. For the hard problems we develop an exact dynamic programming algorithm that is robust and scalable in practice, as well as analyze several local search heuristics. We conduct an empirical study of SmartPhone preferences and find that the behavior of many respondents can be explained by lexicographic strategies.
(cont.) Furthermore, we find that lexicographic decision rules predict better on holdout data than some standard compensatory models. Finally, we look at a more general form of noncompensatory decision process in the context of consideration set formation. Specifically, we analyze the computational complexity of rule-based consideration set formation, develop solution techniques for inferring rules given observed consideration data, and apply the techniques to a real dataset.
by Michael J. Yee.
Ph.D.
45
Kavanaugh, Anya. "Effectiveness of Digital Response Art." Digital Commons at Loyola Marymount University and Loyola Law School, 2020. https://digitalcommons.lmu.edu/etd/905.
Full textAbstract:
This study looks at the effectiveness of digital media to create response art and deepen attunement with adolescent clients as well as develop self-awareness in the therapist. An arts- based qualitative heuristic self-study was used to analyze data gathered over a six-week period. The subject was the researcher/therapist and the data was gathered during the second-year practicum while working with adolescents at a non-public school. Data was gathered through a process of creating two post-session response artworks using video, animation, or digital drawing and a written reflection for each artwork. Nine artworks and eight written reflections were created in total. The data was analyzed using a phenomenological lens and a digital art therapy lens. Certain themes, such as use of color, rhythm and pace, self as subject, client process, progression of affect, management of environment, and representation of containment were analyzed. These themes revealed a high probability for digital media to assist in deepening attunement with an adolescent client and a more limited chance of development of self- awareness.
46
Bouchakhchoukha, Adel. "Modèles de résolution approchée et efficace pour les problèmes des réseaux de transport et de télécommunication." Thesis, Paris 1, 2015. http://www.theses.fr/2015PA010046.
Full textAbstract:
La capacité à gagner du temps et à diminuer ses efforts est l'une des qualités de l'être humain, qui a conduit à exercer la pensée depuis l'Antiquité jusqu'à ces dernières décennies, caractérisées par l'émergence du mélange entre la rapidité des calculs et la précision des résultats, et ce dans plusieurs domaines. Le problème des tournées de véhicules et ses extensions sont, pour les théoriciens de ces utilités, d'une réelle importance quant aux applications du monde réel. Des recherches récentes dans ce domaine ont permis des avancées significatives dans la formulation des problèmes ainsi que dans la conception et l'analyse d'algorithmes. Dans cette étude, nous nous intéressons au problème de la logistique. Notre attention se porte en particulier sur un cas des réseaux de télécommunication, 2ECON-NDPR, et sur la façon de créer des designs d'une manière intelligente pour assurer la vitalité et la durabilité de la circulation de l'information. En outre. Nous choisissons les variantes problème de tournées de véhicules avec fenêtres de temps et problème de tournées de véhicules sélectives des familles VRP et OP respectivement. C'est dans ce cadre que s'inscrit cette thèse. La conception des solutions pour ces problèmes fait appel à la technique de programmation approchée connue pour sa rapidité de calcul. Il s’agit de Beam-search et de la recherche locale à grand voisinage. Nous présentons tout d’abord une étude détaillée des dernières problématiques précitées ainsi que différents types de méthodes de résolutions. Puis, nous exposons une méthode de recherche locale à grand voisinage adaptée pour la conception de réseau de survie avec relais, une proposition d’un algorithme de résolution approchée à trois phases pour le CVRPTW et, enfin, une proposition d'un algorithme de résolution approchée hybride pour le TOPThe need to save time as well as minimize effort is part of the human condition and it has driven our though s from antiquity until these last few decades, now characterized by the emergence of a mix in all fields between rapidity of calculation and precision in the result. The vehicle routing problem and its extensions are an important field for theorists of these utilities for real-world applications. Recent research in the field has led to significant advantages in problem formulation and designing algorithm analyses. This study considers logistics problems. A particular locus was given to a certain case of telecommunications networks 2ECONNDPR, as well as the method of intelligently creating designs to ensure vitality and durability in information circulation. Furthermore, the study considered vehicle routing problems, with time windows and orienteering problems from the VRP and OP families, respectively. This is the framework for this thesis. Solutions to these problems use programming techniques known for their calculation speed, i .e ., Beam-search and very large-scale neighborhood searching. First, a detailed study is presented of these above mentioned problems, along with the various types or resolution methods. Next, a very large-scale neighborhood search method is presented, suited to the design of a survivable network with relay, a proposition for a three-stage heuristic for the capacitated vehicle routing problem with time windows and, finally, a proposition for a hybrid heuristic for the team orienteering problem
47
Ramos, Edson da Silva. "Modelos de simulação e otimização para sistemas hidrotérmicos." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/7713.
Full textAbstract:
Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-08-31T17:54:58Z
No. of bitstreams: 2
Dissertação - Edson da Silva Ramos - 2017.pdf: 3997839 bytes, checksum: 46c0db17187cdc3a0d29e581ce8b11f0 (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-09-15T13:42:24Z (GMT) No. of bitstreams: 2 Dissertação - Edson da Silva Ramos - 2017.pdf: 3997839 bytes, checksum: 46c0db17187cdc3a0d29e581ce8b11f0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-09-15T13:42:24Z (GMT). No. of bitstreams: 2 Dissertação - Edson da Silva Ramos - 2017.pdf: 3997839 bytes, checksum: 46c0db17187cdc3a0d29e581ce8b11f0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-09-15
The problem of planning the hydrothermal systems is complex, dynamic, stochastic, interconnected and nonlinear. In this work this problem is treated to meet one goal: minimize the use of water tank during a scenario of natural river flows lean period. This paper presents the application of meta-heuristics mono-objective of this problem, using a set of eight real plants in the National Interconnected System during the period of five years. The algorithms used were: PSO, ABeePSO, LSSPSO and KFPSO. The experiments were compared to studies using Nonlinear Programming and it appears that this work presents a simulation model and optimization for flexible hydrothermal system and highly adaptable to the use of different meta-heuristics allowing the researcher to apply different algorithms and compare the results between them.
O problema do planejamento da operação de sistemas hidrotérmicos é complexo, dinâmico, estocástico, interconectado e não linear. Nesse trabalho esse problema é tratado de forma a atender um objetivo: minimizar o uso do reservatório de água durante um cenário de período de escassez de vazão natural dos rios. Este trabalho apresenta a aplicação de meta-heurísticas mono-objetivo a esse problema, utilizando um conjunto de oito usinas reais do Sistema Interligado Nacional durante o período de cinco anos. Os algoritmos utilizados foram: PSO, ABeePSO, LSSPSO e KFPSO. Os experimentos realizados foram comparados com estudos que utilizaram Programação Não Linear. E conclui-se que esse trabalho apresenta um modelo de simulação e otimização para sistema hidrotérmicos flexível e altamente adaptável para o uso de diversas meta-heurísticas possibilitando o pesquisador aplicar diferentes algoritmos e comparar esses resultados entre os mesmos.
48
Diaz, Andres. "Heuristics in global combat logistic force operational planning." Monterey, California : Naval Postgraduate School, 2010. http://edocs.nps.edu/npspubs/scholarly/theses/2010/Mar/10Mar%5FDiaz%5FAndres.pdf.
Full textAbstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 2010.Thesis Advisor(s): Carlyle, W. Matthew. Second Reader: Burson, Patrick. "March 2010." Description based on title screen as viewed on April 26, 2010. Author(s) subject terms: Optimization, Navy Logistics, Operational Logistics, Navy Mission Planner, Combat Logistics Force Planner, Ship Scheduling, Optimization Decision Aid, Combat Logistics Force, Heuristics. Includes bibliographical references (p. 53). Also available in print.
49
Carvalho, Jeferson Dutra de. "Definição do modal de transporte ótimo para componentes comprados numa empresa aeronáutica brasileira." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/3/3148/tde-19092006-090138/.
Full textAbstract:
O presente trabalho tem por objetivo definir o modal de transporte ótimo para componentes comprados que abastecem a linha de produção de uma empresa aeronáutica, ao menor custo logístico. Devido a característica do material e das exigências de órgãos e entidades responsáveis pelo ambiente industrial aeronáutico, os fornecedores são especializados e de origem internacional, pois as indústrias nacionais ainda não têm a certificação exigida para produzir tais materiais, salvo algumas poucas exceções, o que onera e torna a cadeia de suprimentos muito mais complexa. Portanto, para atingir o objetivo proposto utilizou-se um modelo heurístico, que decide o modal de transporte ótimo para transportar estes materiais de sua origem, EUA ou Europa, até seu destino que é o Brasil.The present paper aims to define an optimum modal of transportation for acquired components used to supply the production line in a Aeronautical Company, based on the lowest logistic cost. Due to the caracteristics of such material and the special requirements of the Governamental agencies as well as the specific agencies that rule the aeronautical industrial environment, the suppliers which are in its vast majority of this net are from abroad. It happens due to the fact that the local Industry do not hold the required certification to manufacture or assemble such materials which throws the costs and its complexity much more present. Some few isolated companies constitute a exception of this general frame. Based on the exposed, to achieve the proposed goal a heuristic model was used, which defines that the best modal of transportation to transport those specific materials from its origin, USA or Europe, to your final destination in Brazil.
50
Hargraves, Emily. "An Art Therapist's Use of Art Making as Self Care in Pediatric Medicine." Digital Commons at Loyola Marymount University and Loyola Law School, 2021. https://digitalcommons.lmu.edu/etd/958.
Full textAbstract:
This heuristic research project examines my personal use of art making as a form of self-care while interning in a pediatric hospital. The review of the literature investigates the concept of self-care and the use of art making as a therapeutic outlet for working art therapists, for professionals in the healthcare field, and for art therapy students working specifically in hospital settings. The literature suggests that self-care is a necessary process, that self-care is not just for the physical self, but also for one’s mental health. The literature also indicates that art therapists have found that art making as a specific self-care modality is demanded. The research then contains my own personal use and record of art making as a way to support myself while working as an art therapy trainee at Children’s Hospital Los Angeles. I gave myself the structure of making response art once a week on site for 15 weeks. The data includes said weekly art responses, as well as any written responses or observations made during art making. The patterns I found pertain to similarity in the materials used, the visuals created, and the contexts of each image. By actively making response artwork, I was able to deepen my understanding of the importance of art making for the art therapist. In addition, this research highlights the importance and responsibility that comes with self-care as an art therapist, and additionally, heuristic research in art making as a form of active self-care could be especially beneficial for the art therapy student.