To see the other types of publications on this topic, follow the link: Neighborhood Problems.
Dissertations / Theses on the topic 'Neighborhood Problems'
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 'Neighborhood Problems.'
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
Parker, Joseph C. "The Chestnut neighborhood revitalization project a church-neighborhood partnership to develop and implement a neighborhood plan as an approach to reclaiming God's prodigal communities /." Online full text .pdf document, available to Fuller patrons only, 2003. http://www.tren.com.
Full text
2
Jha, Krishna Chandra. "Very large-scale neighborhood search heuristics for combinatorial optimization problems." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0004352.
Full text
3
Sharma, Dushyant 1975. "Cyclic exchange and related neighborhood structures for combinatorial optimization problems." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/8526.
Full textAbstract:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.Includes bibliographical references (p. 122-126).
In this thesis, we concentrate on neighborhood search algorithms based on very large-scale neighborhood structures. The thesis consists of three parts. In the first part, we develop a cyclic exchange neighborhood search based approach for partitioning problems. A partitioning problem is to divide a set of n elements into K subsets S1,... ,SK so as to minimize f(S1)+...+f(SK) for some specified function f. A partition S'1,.. ,S'K is called a cyclic exchange neighbor of the partition S1,...,SK if [...]. The problem of searching the cyclic exchange neighborhood is NP-hard. We develop new exact and heuristic algorithms to search this neighborhood structure. We propose cyclic exchange based neighborhood search algorithms for specific partitioning problems. We provide computational results on these problems indicating that the cyclic exchange is very effective and can be implemented efficiently in practice. The second part deals with the Combined Through and Fleet Assignment Model (ctFAM). This model integrates two airline planning models: (i) Fleet Assignment Model and (ii) Through Assignment Model, which are currently solved in a sequential manner because the combined problem is too large. This leads to sub-optimal solutions for the combined problem we develop very large-scale neighborhood search algorithms for the ctFAM. We also extend our neighborhood search algorithms to solve the multi-criteria objective function version of the ctFAM. Our computational results using real-life data show that neighborhood search can be a useful supplement to the current integer-programming optimization methods in airline scheduling.
(cont.) In the third part, we investigate the structure of neighborhoods in general. We call two neighborhood structures LO-equivalent if they have the same set of local optima for all instances of a combinatorial optimization problem. We define the extended neighborhood of a neighborhood structure N as the largest neighborhood structure that is LO-equivalent to N. In this thesis, we develop some theoretical properties of the extended neighborhood and relate these properties to the performance of a neighborhood structure. In particular, we show that the well-known 2-opt neighborhood structure for the Traveling Salesman Problem has a very large extended neighborhood, providing justification for its favorable empirical performance.
by Dushyant Sharma.
Ph.D.
4
Qiao, Wenbao. "GPU component-based neighborhood search for Euclidean graph minimization problems." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCA020.
Full textAbstract:
Dans cette thèse, nous proposons des solutions parrallèles basées sur le systèmes actuel GPU (graphics processing unit) pour deux problèmes de minimisation de graphe Euclidien, à savoir le problème de forêt/arbre couvrant minimum Euclidien (EMSF / EMST) et le problème du voyageur commerce (TSP). Les solutions proposées résolvent également aussi le problème d'une paire bichromatique la plus proche (BCP), et suivent la technique de ``contrôle décentralisé, du parallélisme des données et des mémoires partagées par GPU".Nous proposons une technique de recherche dans le voisinage le plus proche de dimension K Euclidienne basée sur les approches classiques de NNS d’Elias qui divisent l’espace Euclidien en cellules congruentes et ne se chevauchant pas, où la taille des points de chaque cellule est délimitée. Nous proposons aussi une technique d'élagage pour obtenir le NNS à base de composants afin de trouver le point de sortie le plus proche de l'ensemble de points de requête de Q dans la complexité temporelle linéaire séquentielle lorsque les données sont uniformément réparties. Ces techniques sont utilisées conjointement avec deux GPU algorithmes proposés pour arbre traversement, à savoir la recherche en largeur bidirectionnelle GPU et la liste chaînée dynamique distribuée, afin d'adresser le BCP. Basé sur la solution BCP, un algorithme parallèle Divide and Conquer est implémenté pour construire EMSF et EMST totalement côté GPU. Le TSP est adressé avec différents algorithmes de recherche locaux parallèles 2-opt, dans lesquels nous proposons une méthodologie ``évaluation multiple K-opt, mouvements multiples K-opt" afin d’exécuter simultanément, sans interférence, des processus massifs 2-/3-opt mouvements qui se retrouvent globalement sur le même circuit TSP pour de nombreux bords. Cette méthodologie est expliquée en détail pour montrer comment nous obtenons un calcul haute performance à la fois du côté du GPU et CPU. Nous testons les solutions proposées et rapportons des résultats de comparaison expérimentale par rapport aux algorithmes de pointeIn this thesis, we propose parallel solutions based on current graphics processing unit (GPU) system for two Euclidean graph minimization problems, namely the Euclidean minimum spanning forest/tree (EMSF/EMST) and the travelling salesman problem (TSP). The proposed solutions also solve the bichromatic closest pair (BCP) problem, and follow technique of ``decentralized control, data parallelism, GPU shared memories".We propose a Euclidean K-dimensional nearest neighbourhood search (NNS) technique based on classical Elias' NNS approaches that divide the Euclidean space into congruent and non-overlapping cells where size of points in each cell is bounded. We propose a pruning technique to obtain component-based NNS to find a query point set Q's closest outgoing point within sequential linear time complexity when the data is uniformly distributed. These techniques are used together with two proposed GPU tree traversal algorithms, namely the GPU two-direction Breadth-first search and distributed dynamic linked list, to address the BCP. Based on the BCP solution, a divide and conquer parallel algorithm is implemented for building EMSF and EMST totally on GPU side. The TSP is addressed with different parallel 2-opt local search algorithms, in which we propose a ``multiple K-opt evaluation, multiple K-opt moves" methodology in order to simultaneously execute, without interference, massive 2-/3-opt moves that are globally found on the same TSP tour for many edges. This methodology is explained in details to show how we obtain high performance computing both on GPU and CPU side. We test the proposed solutions and report experimental comparison results against the state-of-the-art algorithms
5
Kang, Jeehye. "Behavioral Problems of Children in L.A| Extended Family, Neighborhood, and Nativity." Thesis, University of Maryland, College Park, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10286698.
Full textAbstract:
This dissertation consists of three papers that examine the association between family living arrangements and internalizing and externalizing behavioral problems in children. With increasing immigration and growing heterogeneity in family forms, extended family members are of increasing importance in children’s lives. However, knowledge about extended family living arrangements is lacking. The first paper examines the association between the presence of co-resident extended kin and children’s internalizing and externalizing behaviors. Children in the sample were found to be disadvantaged in extended households, especially with regard to internalizing behaviors. This association was found mostly among married-parent extended households. Further, this pattern emerged more clearly among children of documented immigrants, compared to those with native-born parents and those whose parents were undocumented immigrants. These findings suggest a need to revisit previous theories on extended family living arrangements. The second paper examines what kinds of household extension are associated with child behavioral problems. I specify the types of household extension by their relation to the householder—vertical, horizontal, and non-kin. Results from the cross-sectional sample indicate that horizontal extension is associated with higher internalizing behavior problems in children. However, the results from fixed effects models suggest that this pattern may be due to selection effects. Fixed effects estimations show that children moving into vertically extended household increase externalizing behaviors or that children moving out of a vertically extended household decrease externalizing behaviors. I discuss what implications this type of transition represents. The third paper examines the interaction between extended family household structure and neighborhood characteristics on children’s behavioral functioning. Findings suggest that the co-residence with extended kin is associated with both higher internalizing and externalizing behaviors for children. Although the health disadvantage of living with extended kin seems to be independent of the neighborhood income and racial minority concentration levels, extended kin moderate the associations with neighborhood structure. The advantage of living in higher-income neighborhood strengthens for extended families, reducing internalizing behavioral problems in children. Minority concentrated neighborhood functions as an advantage for extended families, decreasing externalizing behavioral problems. I conclude with discussion of future research and policy implications.
6
Callahan, Kristin. "The Direct and Interactive Effects of Neighborhood Risk and Harsh Parenting on Childhood Externalizing and Internalizing Behavior." ScholarWorks@UNO, 2006. http://scholarworks.uno.edu/td/364.
Full textAbstract:
The present study investigated the direct and interactional effects of neighborhood disadvantage and harsh parenting on concurrent assessments and change in externalizing and internalizing behavior in toddlerhood. The study included 55 mothers and their children; families completed in-home assessments when children were 2 and 3 years of age. Mothers' reports were used to measure neighborhood disadvantage and children's problem behaviors. Observer ratings derived from a clean up task were used to measure harsh parenting. Four hierarchical regression equations were computed to test each study hypothesis. Results indicated marginally significant effects of harsh parenting on externalizing problems at age 2. Surprisingly, harsh parenting and exposure to neighborhood risk did not significantly predict increases in externalizing behavior problems from age 2 to 3. Harsh parenting was marginally related to children's internalizing problems under conditions of high levels of neighborhood disadvantage and predicted increases in internalizing over time. The theoretical implications of the results are discussed.
7
Curtis, Daniel Lawrence. "A bridge to the neighborhood a partnership model for integrating neighborhood residents into leadership positions at Grace United Methodist Church of Lima, Ohio /." Online full text .pdf document, available to Fuller patrons only, 2003. http://www.tren.com.
Full text
8
Gutierrez, M. Maria Isabel. "The growth of conduct problems in early adolescence does neighborhood environment really matter /." Available to US Hopkins community, 2002. http://wwwlib.umi.com/dissertations/dlnow/3068160.
Full text
9
Hango, Darcy William. "The effect of neighborhood poverty and residential mobility on child well-being." Connect to this title online, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1069324610.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2003.Title from first page of PDF file. Document formatted into pages; contains xi, 178 p.; also includes graphics Includes bibliographical references (p. 163-178). Available online via OhioLINK's ETD Center
10
Petropulos, Anthony J. A. (Anthony John Alexander). "Understanding the dynamics of drug-related problems in public housing and its surrounding neighborhood." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/69362.
Full text
11
Hemmelmayr, Vera, Jean Francois Cordeau, and Teodor Gabriel Crainic. "An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics." Elsevier, 2012. http://dx.doi.org/10.1016/j.cor.2012.04.007.
Full textAbstract:
In this paper,we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP).The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final
customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the
problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm out performs existing solution methods for the 2E-VRP and achieves excellent results on the LRP.
12
Winesburg, Melissa. "Perceptions Of Neighborhood Problems: Agreement Between Police and Citizens and Impact on Citizen Attitudes Toward Police." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1299178960.
Full text
13
Breil, Pamela E. "An analysis of individuals' attitudes and adaptations to chronic household water supply problems in a rural neighborhood." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-10312009-020310/.
Full text
14
Pittman, Bertha Elizabeth Smith. "The importance of building a faith-based initiative in a poor oppressed urban neighborhood in Brockton, MA." Online full text .pdf document, available to Fuller patrons only, 2003. http://www.tren.com.
Full text
15
Albright, Alea Brook. "Parental Supervisory Knowledge and Neighborhood Disadvantage as Moderators of the Link from Childhood Externalizing Problems to Substance Use Initiation." University of Dayton / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1591817377933849.
Full text
16
Faulkner, Thomas G. "The neighborhood retreat a window into the kingdom of God /." Due West, SC : Erskine Theological Seminary, 2007. http://dx.doi.org/10.2986/tren.064-0133.
Full text
17
Wang, Chen. "Variants of Deterministic and Stochastic Nonlinear Optimization Problems." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112294/document.
Full textAbstract:
Les problèmes d’optimisation combinatoire sont généralement réputés NP-difficiles, donc il n’y a pas d’algorithmes efficaces pour les résoudre. Afin de trouver des solutions optimales locales ou réalisables, on utilise souvent des heuristiques ou des algorithmes approchés. Les dernières décennies ont vu naitre des méthodes approchées connues sous le nom de métaheuristiques, et qui permettent de trouver une solution approchées. Cette thèse propose de résoudre des problèmes d’optimisation déterministe et stochastique à l’aide de métaheuristiques. Nous avons particulièrement étudié la méthode de voisinage variable connue sous le nom de VNS. Nous avons choisi cet algorithme pour résoudre nos problèmes d’optimisation dans la mesure où VNS permet de trouver des solutions de bonne qualité dans un temps CPU raisonnable. Le premier problème que nous avons étudié dans le cadre de cette thèse est le problème déterministe de largeur de bande de matrices creuses. Il s’agit d’un problème combinatoire difficile, notre VNS a permis de trouver des solutions comparables à celles de la littérature en termes de qualité des résultats mais avec temps de calcul plus compétitif. Nous nous sommes intéressés dans un deuxième temps aux problèmes de réseaux mobiles appelés OFDMA-TDMA. Nous avons étudié le problème d’affectation de ressources dans ce type de réseaux, nous avons proposé deux modèles : Le premier modèle est un modèle déterministe qui permet de maximiser la bande passante du canal pour un réseau OFDMA à débit monodirectionnel appelé Uplink sous contraintes d’énergie utilisée par les utilisateurs et des contraintes d’affectation de porteuses. Pour ce problème, VNS donne de très bons résultats et des bornes de bonne qualité. Le deuxième modèle est un problème stochastique de réseaux OFDMA d’affectation de ressources multi-cellules. Pour résoudre ce problème, on utilise le problème déterministe équivalent auquel on applique la méthode VNS qui dans ce cas permet de trouver des solutions avec un saut de dualité très faible. Les problèmes d’allocation de ressources aussi bien dans les réseaux OFDMA ou dans d’autres domaines peuvent aussi être modélisés sous forme de problèmes d’optimisation bi-niveaux appelés aussi problèmes d’optimisation hiérarchique. Le dernier problème étudié dans le cadre de cette thèse porte sur les problèmes bi-niveaux stochastiques. Pour résoudre le problème lié à l’incertitude dans ce problème, nous avons utilisé l’optimisation robuste plus précisément l’approche appelée « distributionnellement robuste ». Cette approche donne de très bons résultats légèrement conservateurs notamment lorsque le nombre de variables du leader est très supérieur à celui du suiveur. Nos expérimentations ont confirmé l’efficacité de nos méthodes pour l’ensemble des problèmes étudiésCombinatorial optimization problems are generally NP-hard problems, so they can only rely on heuristic or approximation algorithms to find a local optimum or a feasible solution. During the last decades, more general solving techniques have been proposed, namely metaheuristics which can be applied to many types of combinatorial optimization problems. This PhD thesis proposed to solve the deterministic and stochastic optimization problems with metaheuristics. We studied especially Variable Neighborhood Search (VNS) and choose this algorithm to solve our optimization problems since it is able to find satisfying approximated optimal solutions within a reasonable computation time. Our thesis starts with a relatively simple deterministic combinatorial optimization problem: Bandwidth Minimization Problem. The proposed VNS procedure offers an advantage in terms of CPU time compared to the literature. Then, we focus on resource allocation problems in OFDMA systems, and present two models. The first model aims at maximizing the total bandwidth channel capacity of an uplink OFDMA-TDMA network subject to user power and subcarrier assignment constraints while simultaneously scheduling users in time. For this problem, VNS gives tight bounds. The second model is stochastic resource allocation model for uplink wireless multi-cell OFDMA Networks. After transforming the original model into a deterministic one, the proposed VNS is applied on the deterministic model, and find near optimal solutions. Subsequently, several problems either in OFDMA systems or in many other topics in resource allocation can be modeled as hierarchy problems, e.g., bi-level optimization problems. Thus, we also study stochastic bi-level optimization problems, and use robust optimization framework to deal with uncertainty. The distributionally robust approach can obtain slight conservative solutions when the number of binary variables in the upper level is larger than the number of variables in the lower level. Our numerical results for all the problems studied in this thesis show the performance of our approaches
18
Lahyani, Rahma. "Une matheuristique unifiée pour résoudre des problèmes de tournées de véhicules riches." Thesis, Ecole centrale de Lille, 2014. http://www.theses.fr/2014ECLI0011/document.
Full textAbstract:
L’objectif de cette thèse est de développer un cadre méthodologique pour les problèmes de tournées de véhicules riches (RVRPs). Nous présentons d’abord une taxonomie et une définition élaborée des RVRPs basée sur une analyse typologique réalisée en fonction de deux critères discriminatoires. Dans cette thèse, nous nous intéressons à la résolution du problème de tournées de véhicules multi-dépôt multi-compartiment multi-produits avec fenêtres de temps (MDMCMCm-VRPTW). Nous proposons une heuristique de génération de colonnes unifiée qui inclut une matheuristique de type VNS. La matheuristique combine plusieurs heuristiques de routage de type destruction et insertion ainsi que des procédures efficaces de contrôle de réalisabilité des contraintes afin de résoudre le MDMCMCm-VRPTW pour un seul véhicule. Deux voisinages de chargement, basés sur la résolution de programmes mathématiques sont proposées. Des études expérimentales approfondies sont conduites sur un ensemble de 191 instances pour des VRPs moins complexes. Les expérimentations valident la compétitivité de la matheuristique unifiée. Une analyse de sensibilité révèle l’importance de certains choix algorithmiques et des voisinages de chargement pour parvenir à des solutions de très bonne qualité. La matheuristique basée sur la méthode de VNS est intégrée dans l’heuristique de génération de colonnes pour résoudre le MDMCMCm-VRPTW. Nous proposons une méthode exacte de post-traitement capable d’optimiser l’affectation des clients aux tournées de véhicules. Enfin, nous résolvons un RVRP qui survient dans le processus de collecte de l’huile d’olive en Tunisie à l’aide d’un algorithme exact de type branch-and-cutThe purpose of this thesis is to develop a solution framework for Rich Vehicle Routing Problems (RVRPs). We first provide a comprehensive survey of the RVRP literature as well as a taxonomy. Selected papers addressing various variants are classified according to the proposed taxonomy. A cluster analysis based on two discriminating criteria is performed and leads to define RVRPs. In this thesis we are interested in solving a multi-depot multi-compartment multi-commodity vehicle routing problem with time windows (MDMCMCm-VRPTW). We propose a unified column generation heuristic cooperating with a variable neighborhood search (VNS) matheuristic. The VNS combines several removal and insertion routing heuristics as well as computationally efficient constraint checking. Two loading neighborhoods based on the solution of mathematical programs are proposed to intensify the search. On a set of 191 instances of less complex routing problems, the unified matheuristic turns to be competitive. A sensitivity analysis, performed on more complex generated instances reveals the importance of some algorithmic features and of loading neighborhoods for reaching high quality solutions. The VNS based matheuristic is embedded in a column generation heuristic to solve the MDMCMCm-VRPTW. We propose an exact post-processing method to optimize the assignment ofcustomers to vehicle routes. Last, we introduce, model and solve to optimality a RVRP arising in the olive oil collection process in Tunisia. We propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios
19
Reis, Jorge Von Atzingen dos. "Meta-heurísticas baseadas em busca em vizinhança variável aplicadas a problemas de operação de transportes." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-22092014-150121/.
Full textAbstract:
Esta pesquisa trata da aplicação de meta-heurísticas baseadas em busca em vizinhança variável em problemas de operação de transportes. Desta forma, buscou-se encontrar problemas complexos durante a operação de sistemas de transportes, nas grandes cidades, que possam ser resolvidos com a aplicação de meta-heurística baseada em busca em vizinhança variável. Este trabalho aborda dois diferentes problemas de planejamento e operação de transportes. O primeiro problema abordado neste trabalho é o Problema de Programação da Tabela de Horários, de Veículos e de Tripulantes de Ônibus, no qual as viagens que comporão a tabela de horários, os veículos que executarão as viagens e as tripulações que operarão os veículos são alocadas simultaneamente e de maneira integrada. O segundo problema a ser abordado é o problema de distribuição física, o qual envolve o agrupamento e a alocação de entregas a uma frota de veículos visando minimizar o frete total. Uma abordagem para a modelagem matemática deste problema é modelar como um problema de bin-packing, com bins de tamanho variável unidimensional (do inglês Variable Sized Bin-Packing Problem - VSBPP), ou seja, uma generalização do tradicional problema de bin-packing no qual bins (veículos) de diferentes capacidades e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), de modo que o custo total dos bins (veículos) utilizados seja mínimo. A outra abordagem proposta para o problema de distribuição física é modelar o problema como um problema de bin-packing, com bins de tamanho variável bidimensional (do inglês Bidimensional Variable Sized Bin-Packing Problem BiD-VSBPP). Assim sendo, trata-se de uma expansão do problema de bin-packing com bins de tamanho variável unidimensional (VSBPP), no qual bins (veículos) de diferentes capacidades (capacidade volumétrica e capacidade de carga) e custos estão disponíveis para a alocação de um conjunto de objetos (cargas), os quais possuem as dimensões peso e volume, de modo que o custo total dos bins (veículos) utilizados seja mínimo. Durante a realização deste trabalho, foi desenvolvido um programa computacional em C++, o qual implementa a meta-heurística Busca em Vizinhança Variável (VNS) e duas meta-heurísticas baseadas em VNS. São apresentados resultados de experimentos computacionais com dados reais e dados benchmarking. Os resultados obtidos comprovam a eficácia das meta-heurísticas propostas.This work approaches variable neighborhood search meta-heuristic applicate on transport operation problems. This way, we sought find complex transport operation problems in large cities that can be solved with the variable neighborhood search meta-heuristic application. This work approaches two different transport planning and operation problems. The first problem approached in this paper is the Bus Timetable Vehicle Crew Scheduling Problem, in which timetabling, bus and crew schedules are simultaneously determined in an integrated approach. The second problem to be approached is the physical distribution problem which comprises grouping and assigning deliveries to a heterogeneous fleet of vehicles aiming to minimize the total freight cost. The problem can be mathematical modeled as one-dimensional Variable Sized Bin-Packing Problem (VSBPP), a generalization of the traditional bin-packing problem, in which bins (vehicles) with different sizes and costs are available for the assignment of the objects (deliveries) such that the total cost of the used bins (vehicles) is minimized. Another proposed approach to the problem of physical distribution is model as two dimensional Variable Sized Bin-Packing Problem (BiD-VSBPP). Therefore, it is an expansion of the bin-packing problem with bins variable-length-dimensional (VSBPP), in which bins (vehicle) of different capacity (capacity and load carrying capacity) and costs are available for allocation a set of objects (loads), which have the dimensions weight and volume, so that minimized the total cost of bins (vehicle). In this work, was developed a C++ software implemented, which was implemented a meta-heuristic Variable Neighborhood Search (VNS) and two others meta-heuristics based on VNS. Computational results for real-world problems and benchmarking problems are presented, showing the effectiveness of these proposed meta-heuristics.
20
Trenta, Arnaud. "La participation associative dans les quartiers populaires : associations, problèmes publics et configurations politiques locales dans la périphérie urbaine de Paris et de Buenos Aires." Thesis, Paris, CNAM, 2014. http://www.theses.fr/2014CNAM0928/document.
Full textAbstract:
La thèse se positionne au croisement de la problématique de la publicisation des problèmes sociaux et de celle de la transformation des engagements militants. La recherche entend expliquer, par une double approche locale et internationale, l’essor de la participation associative depuis les années 1970 dans les quartiers populaires urbains situés en périphérie de Paris et de Buenos Aires. La première partie est consacrée à l’analyse des théories politiques du fait associatif et à leur insertion au sein d’une sociologie empirique de la participation associative. La généalogie de la notion de société civile est mise en relation avec l’avènement de la démocratie moderne afin d’inscrire l’essor associatif des dernières décennies dans une perspective historique de longue portée. Notre approche de la participation associative est ensuite explicitée en référence à trois grandes thématiques du fait associatif : le tiers secteur, le capital social et l’engagement militant.La deuxième partie articule la participation associative avec les transformations socio-économiques des classes populaires et le développement des politiques sociales territorialisées. L’analyse d’une association dans le territoire français illustre d’abord les possibilités offertes par la désagrégation du système politique communiste des « banlieues rouges » et l’intervention croissante de l’État dans les quartiers populaires au travers de la politique de la ville. L’étude de l’activité et du fonctionnement de cette association, des années 1980 aux années 2000, met en lumière à la fois la capacité des acteurs à s’auto-organiser en référence à un problème public local et les tensions générées par la relation partenariale avec les pouvoirs publics. En Argentine, les conséquences de la fragilisation de la société salariale sur les formes de sociabilités populaires dans la périphérie urbaine de Buenos Aires sont analysées au travers d’une association qui s’inscrit dans le prolongement du mouvement social des travailleurs au chômage (piqueteros). Le rôle d’intermédiaire des politiques sociales joué par cette association permet de questionner les liens qui unissent ces organisations populaires aux pouvoirs publics et le possible redéploiement des réseaux politiques clientélaires du péronisme.La troisième partie s’attache à analyser la participation associative en relation avec les évolutions des principaux partis politiques des classes populaires et les changements intervenus dans les configurations politiques locales. Dans le cas français, les phénomènes de désengagement communiste et de désarticulation des « organisations satellites » du parti sont intégrés à l’analyse d’une association regroupant d’anciens militants communistes. Les trajectoires de ces militants et le fonctionnement de cette association permettent de cerner les raisons d’un changement dans les formes d’engagement et de s’interroger sur le processus d’autonomisation des associations locales à l’égard des systèmes politiques. Dans le cas argentin, la recomposition des liens entre le parti justicialiste et les classes populaires est questionnée au travers de l’analyse d’une association fondée par des militants péronistes dans le contexte d’un discrédit des institutions politiques. L’adaptation de ces militants politiques à la forme associative illustre les changements dans les modalités d’engagement et permet une réflexion sur la proximité entre les associations locales et les partis politiquesThis thesis is situated at the intersection of two historical phenomena: the publicization of social problems and the transformation of activist commitment. The research undertaken has sought to explain, through an approach that is both local and international in scope, the rise of grassroots volunteering since the 1970s in working-class urban neighborhoods on the periphery of Paris and Buenos Aires. The first part presents an analysis of the various political theories which relate to the voluntary movement, and discusses their place within an empirical sociological study of grassroots volunteering. The intellectual genealogy of the notion of civil society is considered in relation to the appearance of modern democracy, in order to situate the rise of volunteerism in recent decades within a larger historical perspective. Attention is given to the emergence of three characteristic themes: the third sector, social capital, and activism. The second part relates volunteerism to socio-economic transformations within the working class and to the development of social policy at the local community level. The study of grassroots organization in France reveals the importance of possibilities created by the breakdown of the communist political system in certain Paris suburbs (banlieues rouges) along with increased state intervention in working-class neighborhoods through urban policy initiatives. An analysis of the activities and the workings of the grassroots organizations which appeared in these neighborhoods between the 1980s and the 2000s, reveals that these organizations had the capacity to self-organize for the purpose of addressing public problems at a local level, and that tensions resulted from partnership arrangements with local public authorities. In Argentina, consequences of the labor society’s weakening in terms of working-class social solidarity in neighborhoods on the outskirts of Buenos Aires are analyzed through the prism of grassroots organizations operating in the wake of social movements among unemployed workers (piqueteros). The grassroots organization’s role as an intermediary for social policy raises questions concerning the link between these popular movements and public authorities, and the possible redeployment of Peronist corporatism. The third part relates volunteer participation to historical transformations within the principal working-class political parties and to the changes observed in the local political landscape. In France, popular withdrawal from communism and the disassociation of the Party’s former “satellite organizations” are considered through an analysis of a grassroots organization composed primarily of former communist partisans. Their personal trajectories as activists, as well as the workings of their organization, reveal the causes of a change in the operative forms of political commitment and give rise to questions concerning the processes by which these local organizations are made autonomous of political systems. In Argentina, new links emerging between the Justicialist party and the working class are considered through the study of an organization founded by Peronist partisans in a context where political institutions are represented as lacking legitimacy. The adaptation of these political activists to grassroots volunteerism is likewise indicative of changes in the operative forms of political commitment and gives rise to questions concerning the proximity between grassroots organizations and political parties
21
Cheh, Kah Mun 1965, and Kah Mun 1965 Cheh. "The effect of neighborhood structure on simulated annealing." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277156.
Full textAbstract:
This thesis investigates the effect of neighborhood structure on simulated annealing, a random search algorithm that has the ability to search through a sequence of local optimal solutions and return the globally optimal solution. Neighborhood sizes of one, two, three, four and N (equal to the size of the problem) decision variable alterations have been experimentally tested on the following problem types: Quadratic Assignment problem; Quadratic Selection problem; Stochastic Optimization problem; and Traveling Salesman problem. Empirical results indicate that a smaller neighborhood size is better. However, for some instances, a neighborhood size of one larger than the smallest defined neighborhood size performed best.
22
Yoon, Miyoung. "NEIGHBORHOODS AND PROBLEM BEHAVIORS AMONG AT-RISK ADOLESCENTS." Case Western Reserve University School of Graduate Studies / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case15911981326103.
Full text
23
Sahutoglu, Sonmez. "Compactness of the dbar-Neumann problem and Stein neighborhood bases." Texas A&M University, 2003. http://hdl.handle.net/1969.1/3879.
Full textAbstract:
This dissertation consists of two parts. In the first part we show that for 1 k 1, a complex manifold M of dimension at least k in the boundary of a smooth
bounded pseudoconvex domain
in Cn is an obstruction to compactness of the @-
Neumann operator on (p, q)-forms for 0 p k n, provided that at some point
of M, the Levi form of b
has the maximal possible rank n − 1 − dim(M) (i.e. the
boundary is strictly pseudoconvex in the directions transverse to M). In particular,
an analytic disc is an obstruction to compactness of the @-Neumann operator on
(p, 1)-forms, provided that at some point of the disc, the Levi form has only one
vanishing eigenvalue (i.e. the eigenvalue zero has multiplicity one). We also show
that a boundary point where the Levi form has only one vanishing eigenvalue can
be picked up by the plurisubharmonic hull of a set only via an analytic disc in the
boundary.
In the second part we obtain a weaker and quantified version of McNealÂs Property
( eP) which still implies the existence of a Stein neighborhood basis. Then we give
some applications on domains in C2 with a defining function that is plurisubharmonic
on the boundary.
24
Kowaleski-Jones, Lori. "Staying out of trouble : neighborhood influences on adolescent problem behavior." Connect to resource, 1996. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1261059926.
Full text
25
Baker, Frances L. "A study of nine urban churches and their neighborhoods." Theological Research Exchange Network (TREN), 1995. http://www.tren.com.
Full text
26
Agarwal, Richa. "Composite very large-scale neighborhood structure for the vehicle-routing problem." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1001111.
Full text
27
Thirathon, Nattavude 1980. "Cyclic exchange neighborhood search technique for the K-means clustering problem." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17981.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 151-152).
Cyclic Exchange is an application of the cyclic transfers neighborhood search technique for the k-means clustering problem. Neighbors of a feasible solution are obtained by moving points between clusters in a cycle. This method attempts to improve local minima obtained by the well-known Lloyd's algorithm. Although the results did not establish usefulness of Cyclic Exchange, our experiments reveal some insights on the k-means clustering and Lloyd's algorithm. While Lloyd's algorithm finds the best local optimum within a thousand iterations for most datasets, it repeatedly finds better local minima after several thousand iterations for some other datasets. For the latter case, Cyclic Exchange also finds better solutions than Lloyd's algorihtm. Although we are unable to identify the features that lead Cyclic Exchange to perform better, our results verify the robustness of Lloyd's algorithm in most datasets.
by Nattavude Thirathon.
M.Eng.
28
Hayman, Lackey Jennifer. "Parent-Child Agreement on Perceptions of Neighborhood Characteristics and Problem Behaviors." Bowling Green State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1372093269.
Full text
29
Aleman, Rafael E. "A Guided Neighborhood Search Applied to the Split Delivery Vehicle Routing Problem." Wright State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=wright1237575805.
Full text
30
Lacroix, Katherine. "L’influence du quartier de résidence et des problèmes de comportement extériorisés sur le rendement scolaire des adolescents." Mémoire, Université de Sherbrooke, 2017. http://hdl.handle.net/11143/11553.
Full textAbstract:
Cette étude examine si la composition et l’organisation sociale du quartier résidentiel sont associées au rendement scolaire d’élèves québécois âgés de 12 à 15 ans (N = 630). L’effet modérateur des problèmes de comportement extériorisés sur ces associations est aussi analysé. Les résultats montrent que le désordre physique et social du quartier ainsi que son niveau de désavantage socioéconomique sont associés à des aspects du rendement scolaire des élèves au-delà de leurs caractéristiques familiales et individuelles. La présence de problèmes de comportement chez les jeunes modère cependant certaines de ces associations. Ces résultats sont discutés en fonction des retombées pour la pratique.Abstract : This study investigates if the socioeconomic composition, as well as the physical and social disorder of neighborhoods were associated with academic performance among Quebec school children, with and without conduct problems, aged 12 to 15 (N = 630). In particular, the moderating role of conduct problems was explored. Findings indicated that physical and social disorder, along with the percentage of low income individuals in the neighborhood were associated with some aspects of academic performance. Conduct problems did, however, moderate between neighborhood variables and school performance. The implications of these findings will also be discussed.
31
Tchapnga, Takoudjou Rodrigue. "Méthodes de modélisation et d'optimisation par recherche à voisinages variables pour le problème de collecte et de livraison avec transbordement." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0052/document.
Full textAbstract:
La présente thèse se déroule dans le cadre du projet ANR PRODIGE et est axée sur la recherche de stratégies permettant l’optimisation du transport en général et du transport routier de marchandises en particulier. Le problème de transport support de cette étude est le problème de collecte et livraison avec transbordement. Ce problème généralise plusieurs problèmes de transports classiques. Le transbordement y est utilisé comme levier de flexibilité et d’optimisation. Pour analyser et résoudre ce problème, les analyses sont effectuées suivant trois axes : le premier axe concerne l’élaboration d’un modèle analytique plus précisément d’un modèle mathématique en variables mixtes. Ce modèle permet de fournir dessolutions optimales au décisionnaire du transport mais présente l’inconvénient de nécessiter un temps de résolution qui croit exponentiellement avec la taille du problème. Cette limitation est levée par le deuxième axe d’étude qui permet de résoudre le problème de transport étudié par une méthode d’optimisation approchée tout en garantissant des solutions satisfaisantes.La méthode utilisée est une métaheuristique inspirée de la recherche à voisinages variables (VNS). Dans le troisième axe, l’ensemble des résultats obtenus dans la thèse sont testés en situation de transports réels via le projet PRODIGEThe thesis is conducted under the ANR project PRODIGE and it is focused on seeking strategies allowing the optimization of transport in general and road freight transport in particular. The transportation problem support for this study is the pickup and delivery problem with transshipment.This problem generalizes several classical transportation problems.Transshipment is used as optimization and flexibility leverage. To study and solve this problem, analyzes are performed along three axes :the first objective concerns the development of an analytical model, more accurately a mathematical model with mixed variables. This model allows providing optimal solution to the decision maker, but has the disadvantage of requiring a time resolution that grows exponentially with the size of the problem. This limitation is overcome by the second line of the study that solves the transportation problem studied by an approximate optimization method while ensuring satisfactory solutions. The method used is a mataheuristic broadly followed the variables neighborhoods research principles. In the third objective, the overall results obtained in the thesis are tested in real transport situation via the PRODIGE project
32
Jonsson, Håkan. "The euclidean traveling salesman problem with neighborhoods and a connecting fence /." Luleå, 2000. http://epubl.luth.se/1402-1544/2000/36/index.html.
Full text
33
Jonsson, Håkan. "The Euclidean traveling salesman problem with neighborhoods and a connecting fence." Doctoral thesis, Luleå tekniska universitet, Datavetenskap, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26604.
Full textAbstract:
An important class of problems in robotics deals with the planning of paths. In this thesis, we study this class of problems from an algorithmic point of view by considering cases where we have complete knowledge of the environment and each solution must ensure that a point-sized robot capable of moving continuously and turning arbitrarily accomplishes the following: (1) visits a given set of objects attached to an impenetrable simple polygon in the plane, and (2) travels along a path of minimum length over all the possible paths that visit the objects without crossing the polygon. In its general form, this is The (Euclidean) Traveling Salesman Problem with Neighborhoods and a Connecting Fence. We make several contributions. One is an algorithm that computes a shortest watchman path in a rectilinear polygon in time polynomial in the size of the polygon. Each point in the polygon is visible from some point along the computed path, which is a shortest visiting path for a set of convex polygons, each of which is bounded by a chord in the interior of the polygon. For the special case of computing a shortest watchman route, where the end points of the resulting path must coincide, we give a polynomial-time algorithm for general simple polygons. We also give substantially faster and more practical algorithms for computing provably short approximations, that is watchman paths/routes with lengths guaranteed to be at most a constant times longer than the length of a shortest watchman path/route only. To achieve one of these approximations, we develop a linear-time algorithm for computing a constant factor approximation in the case where the convex polygons are impenetrable. For this problem, which is called the Zookeeper's Problem, we show how an exact solution can be computed in linear time when the number of convex polygons is constant. We also present an application of our results to the computation of both exact and approximate solutions to the problem of computing a shortest visiting route for a set of lines in the plane.Godkänd; 2000; 20061116 (haneit)
34
PACHECO, TONI TIAGO DA SILVA. "EFFICIENT LARGE NEIGHBORHOOD SEARCHES FOR THE TRAVELING SALESMAN PROBLEM WITH PICKUP AND DELIVERY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35781@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Em vários problemas de distribuição e logística, os produtos devem ser coletados em uma origem e entregues em um destino. Exemplos incluem o transporte de pessoas com deficiência, serviços de correio expresso, logística de suprimentos médicos, etc. O problema de roteamento abordado neste trabalho, conhecido como Traveling Salesman Problem with Pickup and Delivery (TSPPD), é da classe de problemas do caixeiro viajante com restrições de precedência. Neste problema, existe um mapeamento um-para-um entre coleta-entrega no qual cada cliente do tipo coleta possui um cliente do tipo entrega associado. Os clientes do tipo entrega somente podem ser visitados posteriormente à coleta associada. O TSPPD é um problema NP-difícil uma vez que generaliza o Traveling Salesman Problem (TSP). O TSP pode ser visto como um caso particular do TSPPD onde cada coleta coincide espacialmente com a respectiva entrega. As variantes com restrições de capacidade, janelas de tempo e diferentes políticas de carregamento têm recebido maior atenção na última década, embora ainda existam significantes avanços a serem realizados em termos de qualidades de soluções na versão básica do problema. Para resolver este problema, propomos um algoritmo meta-heurístico híbrido com vizinhanças largas exploradas eficientemente em O(n2). Nossos experimentos demonstram uma redução significativa no tempo computacional e também melhoria na qualidade de soluções previamente conhecidas na literatura.
In various distribution and logistics issues, products must be collected at one source and delivered to a destination. Examples include disabled people transportation, express mail services, medical supplies logistics, etc. The routing problem addressed by this work, known as Traveling Salesman Problem with Pickup and Delivery (TSPPD), belongs to the class of traveling salesman problems with precedence constraints. In this problem, there is a one-to-one pickup-delivery mapping in which, for each pickuptype client, there is exactly one associated delivery-type client. Delivery clients can only be visited after the associated pickup. Since the TSPPD generalizes the TSP it is also a NP-hard problem, as the TSP is a particular casa of TSPPD where each pickup matches spatially with it s respective delivery. Variants with capacity constraints, time windows and different loading policies have received more attention in the last decade, although there are still significant advances to be made in terms of solution quality for the basic version of the problem. To solve this problem, we propose a hybrid metaheuristic algorithm with large neighborhoods efficiently explored in O(n2). Our experiments demonstrate a significant computational time reduction and also solutions quality improvement compared to the previous works.
35
Hemmelmayr, Vera. "Sequential and parallel large neighborhood search algorithms for the periodic location routing problem." Elsevier, 2015. http://dx.doi.org/10.1016/j.ejor.2014.11.024.
Full textAbstract:
We propose a large neighborhood search (LNS) algorithm to solve the periodic location routing problem (PLRP). The PLRP combines location and routing decisions over a planning horizon in which customers require visits according to a given frequency and the specific visit days can be chosen. We use parallelization strategies that can exploit the availability of multiple processors. The computational results show that the algorithms obtain better results than previous solution methods on a set of standard benchmark instances from the literature.
36
Firat, Kamil. "Urban Alevilik: Self Perceptions Of The Two Neighborhoods In Ankara." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605316/index.pdf.
Full textAbstract:
Based on field research carried out in two neighborhoods of Ankara, the primary aim of this study is to explore urban Alevilik and its basic characteristics as perceived by the Alevis which is compared with traditional Alevilik and its features as perceived by the Alevis in urban setting. Additionally, this study is to examine the basic factors that are behind the differences in perceptions of the Alevis, if there are some significant differences in the perception of Alevis regarding these subjects. In this context, a field research that consisted of 208 questionnaires that were applied to the Alevis who are syncretistic religious community and 6 in-depth interviews was carried out in order to examine the basic questions of this study in Ankara. Furthermore, I divided the respondents into four groups, according to whether state of membership of any Alevi association or not and the place of residence which based on different class positions, so that I could make a comparison between these groups. Besides age, educational level and ethnic origin of the respondents, whether or not state of membership of any Alevi association significantly affect the contents of Alevilik, its social and religious institutions and basic rituals as perceived by the Alevis. On the other hand, there is no meaningful relationship between the perceptions of Alevilik and its religious and social institutions and rituals and the place of residence of the respondents.
37
Mitchell, Bridgette Josette. "The Relationship Between Neighborhood Risk and Problem Behaviors: The Moderating Effects of Personal Competence." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1054321249.
Full text
38
Mitchell, Bridgette J. "The relationship between neighborhood risk and problem behaviors the moderating effects of personal competence /." Cincinnati, Ohio : University of Cincinnati, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=1054321249.
Full text
39
Svensson, Jesper. "Designing a large neighborhood search method to solve a multi-processor avionics scheduling problem." Thesis, Linköpings universitet, Tillämpad matematik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-177878.
Full textAbstract:
This thesis introduces a Large Neighborhood Search (LNS) method to solve a multi-processor avionics scheduling problem. In a typical scheduling problem, tasks are scheduled with exact starting times. In this thesis however, tasks will instead be assigned to disjoint time segments, called buckets. For an assignment to be feasible, precedence relations and capacity constraints related to network and computing resources need to be fulfilled. The introduced LNS method relies on solving Mixed-Integer Programming (MIP)-models. To make progress in the search for a feasible assignment, we construct a MIP-model that allows violation of the problem constraints at a cost of increased objective value. The LNS method uses two operators, a destroy operator that chooses a set of tasks that are allowed to change buckets, and a repair operator that through solving the MIP-model creates a new schedule. This thesis develops 11 types of destroy operators and 30 (concrete) variants of them. The MIP-based LNS is evaluated on a set of 60 instances with up to 84 000 tasks and 21 processors. The instances belongs to six categories of varying difficulty. The MIP-based LNS solves 50 instances within our time limit, and the largest instance solved has 77 757 tasks. This is significantly better than solving the complete MIP-model in a single step. With this approach only 36 instances can be solved within our time limit and the largest instance solved has 48554 tasks.
40
Zemzami, Maria. "Variations sur PSO : approches parallèles, jeux de voisinages et applications Application d’un modèle parallèle de la méthode PSO au problème de transport d’électricité A modified Particle Swarm Optimization algorithm linking dynamic neighborhood topology to parallel computation An evolutionary hybrid algorithm for complex optimization problems Interoperability optimization using a modified PSO algorithm A comparative study of three new parallel models based on the PSO algorithm Optimization in collaborative information systems for an enhanced interoperability network." Thesis, Normandie, 2019. http://www.theses.fr/2019NORMIR11.
Full textAbstract:
Reconnue depuis de nombreuses années comme une méthode efficace pour la résolution de problèmes difficiles, la méta-heuristique d’optimisation par essaim de particules PSO (Particle Swarm Optimization) présente toutefois des inconvénients dont les plus étudiés sont le temps de calcul élevé et la convergence prématurée. Cette thèse met en exergue quelques variantes de la méthode PSO visant à échapper à ces deux inconvénients de la méthode. Ces variantes combinent deux approches : la parallélisation de la méthode de calcul et l’organisation de voisinages appropriés pour les particules. L’évaluation de la performance des modèles proposés a été effectuée sur la base d'une expérimentation sur une série de fonctions tests. A la lumière de l’analyse des résultats expérimentaux obtenus, nous observons que les différents modèles proposés donnent des résultats meilleurs que ceux du PSO classique en termes de qualité de la solution et du temps de calcul. Un modèle basé PSO a été retenu et développé en vue d'une expérimentation sur le problème du transport d’électricité. Une variante hybride de ce modèle avec la méthode du recuit simulé SA (Simulated Annealing) a été considérée et expérimentée sur la problématique des réseaux de collaborationKnown for many years as a stochastic metaheuristic effective in the resolution of difficult optimization problems, the Particle Swarm Optimization (PSO) method, however, shows some drawbacks, the most studied: high running time and premature convergence. In this thesis we consider some variants of the PSO method to escape these two disadvantages. These variants combine two approaches: the parallelization of the calculation and the organization of appropriate neighborhoods for the particles. To prove the performance of the proposed models, we performed an experiment on a series of test functions. By analyzing the obtained experimental results, we observe that the proposed models based on the PSO algorithm performed much better than basic PSO in terms of computing time and solution quality. A model based on the PSO algorithm was selected and developed for an experiment on the problem of electricity transmission. A hybrid variant of this model with Simulated Annealing (SA) algorithm has been considered and tested on the problem of collaborative networks
41
Rahim, Fatih. "A Variable Neighborhood Search Procedure For The Combined Location With Partial Coverage And Selective Traveling Salesman Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611949/index.pdf.
Full textAbstract:
In this study, a metaheuristic procedure, particularly a variable neighborhood search procedure, is proposed to solve the combined location and selective traveling salesman problem in glass recycling. The collection of used glass is done by a collecting vehicle that visits a number of predefined collection centers, like restaurants and hospitals that are going to be referred to as compulsory points. Meanwhile, it is desired to locate a predetermined number of bottle banks to
residential areas. The aim is to determine the location of these bottle banks and the route of the collecting vehicle so that all compulsory points and all bottle banks are visited and the maximum profit is obtained. Population zones are defined in residential areas and it is assumed that the people in a particular population zone will recycle their used glass to the closest bottle bank that fully or partially covers their zone. A Variable Neighborhood Search algorithm and its variant have been utilized for the solution of the problem. Computational
experiments have been made on small and medium scale test problems, randomly generated and adapted from the literature.
42
White, Rachel. "Perceived Parental Characteristics and Neighborhood Support: How Do They Relate to Adolescents' Externalizing Behavior Problem." Master's thesis, University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2184.
Full textAbstract:
Externalizing behavior problems are related to many problematic outcomes for children and adolescents in their home, school, and community settings. Given the ramifications of difficulties related to externalizing behavior problems, the present study examines the relationships among adolescents' externalizing behavior problems, characteristics of adolescents' families, and their perceived neighborhood support in a sample of adolescents who are in the Sixth through Eighth Grades. As part of this study, adolescents were assessed one time in their school setting with a set of brief questionnaires. In particular, adolescents completed measures assessing their levels of externalizing behavior problems, characteristics of their families, their perceptions of neighborhood support and of their teachers, and their ratings of their own acculturation. Results suggest that, although a moderation relationship does not exist between parental warmth, neighborhood support, and the development of externalizing behavior problems, variables such as maternal warmth, overall parental emotional support, and overall neighborhood support are important predictors of the development of externalizing behavior problems. Further regression analyses reveal that, in addition to neighborhood and parental characteristics, adolescents' perceived social acceptance and global self-worth are significant predictors of adolescents' externalizing behavior problems. In conclusion, when identifying adolescents who are at risk for the development of externalizing behavior problems, an ecological conceptualization encompassing culture, community, and home environments can be helpful.M.S.
Department of Psychology
Sciences
Psychology PhD
43
Moreira, Andreza Cristina Beezão. "O problema de minimização de trocas de ferramentas." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-06012017-104534/.
Full textAbstract:
Especialmente nas últimas quatro décadas, muitos estudos se voltaram às variáveis determinantes para a implementação efetiva de sistemas flexíveis de manufatura, tais como seu design, sequenciamento e controle. Neste ínterim, o manejo apropriado do conjunto de ferramentas necessárias para a fabricação de um respectivo lote de produtos foi destacado como fator crucial no desempenho do sistema de produção como um todo. Neste trabalho, abordamos a otimização do número de inserções e remoções de ferramentas no magazine de uma ou mais máquinas numericamente controladas, admitindo-se que uma parcela significativa do tempo de produção é dispensada com estas trocas de ferramentas. De forma mais precisa, a minimização do número de trocas de ferramentas consiste em determinar a ordem de processamento de um conjunto de tarefas, bem como o carregamento ótimo do(s) compartimento(s) de ferramentas da(s) máquina(s), a fim de que o número de trocas seja minimizado. Como demostrado na literatura, mesmo o caso restrito à existência de apenas uma máquina de manufatura (MTSP, do inglês Minimization of Tool Switches Problem) é um problema NP-difícil, o que pode justificar o fato observado de que a maioria dos métodos de solução existentes o abordam de maneira heurística. Consequentemente, concluímos que a extensão ao contexto de múltiplas máquinas é também um problema NP-difícil, intrinsecamente complicado de se resolver. Nosso objetivo consiste em estudar formas eficientes de otimizar o número de trocas de ferramentas em ambientes equipados com máquinas flexíveis de manufatura. Para tanto, abordamos o problema básico, MTSP, e duas de suas variantes, em níveis crescentes de abrangência, que consideram o sequenciamento de tarefas em um conjunto de: (i) máquinas paralelas e idênticas (IPMTC, do inglês Identical Parallel Machines problem with Tooling Constraints); e (ii) máquinas paralelas e idênticas inseridas em um ambiente do tipo job shop (JSSPTC, do inglês Job Shop Scheduling Problem with Tooling Constraints). Classificamos as principais contribuições desta tese com respeito a três aspectos. Primeiramente, empurramos as fronteiras da literatura do MTSP propondo formulações matemáticas para os problemas IPMTC e JSSPTC. Desenvolvemos, também, algoritmos baseados em diferentes técnicas de resolução, como redução de domínio, Path relinking, Adaptive large neighborhood search e a elaboração de regras de despacho. Por último, com o intuito de bem avaliar a eficiência e o alcance de nossos métodos, propomos três novos conjuntos de instâncias teste. Acreditamos, assim, que este trabalho contribui positivamente com pesquisas futuras em um cenário abrangente dentro da minimização das trocas de ferramentas em um sistema flexível de manufatura.Several studies, especially in the last four decades, have focused on decisive elements for the effective implementation of flexible manufacturing systems, such as their design, scheduling and control. In the meantime, the appropriate management of the set of tools needed to manufacture a certain lot of products has been highlighted as a crucial factor in the performance of the production system as a whole. This work deals with the optimization of the number of insertions and removals from the magazine of one or more numerical controlled machines, assuming that a significant part of the production time is wasted with such tool switches. More precisely, the minimization of tool switches problem (MTSP) consists on determining the processing order of a set of jobs, as well as the optimal loading of the magazine(s) of the machine(s), so that the total number of switches is minimized. As formally demonstrated in the literature, the MTSP is a NP-hard problem even when considering the existence of only one manufacturing machine, which could justify the fact that most of the solution methods tackles it heuristically. We thus conclude that its extension to the case of multiples machines is also NP-hard and, therefore, a problem intrinsically difficult to solve. Our goal consists in studying efficient ways to optimize the number of tool switches in environments equipped with flexible manufacturing machines. For that, we address the basic problem, MTSP, and two MTSP variants, in increasing levels of reach, that consider the job sequencing in a set of: (i) identical parallel machines (Identical Parallel Machines problem with Tooling Constraints, IPMTC); and (ii) identical parallel machines inserted in a job shop environment (Job Shop Scheduling Problem with Tooling Constraints, JSSPTC). The main contributions of this thesis are classified according three aspects. First, we pushed the frontier of the MTSP literature by proposing mathematical formulations for IPMTC and JSSPTC. We also developed algorithms based on different solution techniques, such as domain reduction, Path Relinking, Adaptive Large Neighborhood Search and dispatching rules. Finally, to fully evaluate the effectiveness and limits of our methods, three new sets of benchmark instances were generated. We believe that this work contributes positively to the future of research in a broad scenario inside the minimization of tool switches in flexible manufacturing systems.
44
Mason, Craig Alan. "The effects of neighborhood problem behavior, father absence, and peer antisocial behavior upon adolescent problem behavior : a risk and protective factors model /." Thesis, Connect to this title online; UW restricted, 1993. http://hdl.handle.net/1773/9193.
Full text
45
Goodson, Justin Christopher. "Solution methodologies for vehicle routing problems with stochastic demand." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/675.
Full textAbstract:
We present solution methodologies for vehicle routing problems (VRPs) with stochastic demand, with a specific focus on the vehicle routing problem with stochastic demand (VRPSD) and the vehicle routing problem with stochastic demand and duration limits (VRPSDL). The VRPSD and the VRPSDL are fundamental problems underlying many operational challenges in the fields of logistics and supply chain management.
We model the VRPSD and the VRPSDL as large-scale Markov decision processes. We develop cyclic-order neighborhoods, a general methodology for solving a broad class of VRPs, and use this technique to obtain static, fixed route policies for the VRPSD. We develop pre-decision, post-decision, and hybrid rollout policies for approximate dynamic programming (ADP). These policies lay a methodological foundation for solving large-scale sequential decision problems and provide a framework for developing dynamic routing policies.
Our dynamic rollout policies for the VRPSDL significantly improve upon a method frequently implemented in practice. We also identify circumstances in which our rollout policies appear to offer little or no benefit compared to this benchmark. These observations can guide managerial decision making regarding when the use of our procedures is justifiable. We also demonstrate that our methodology lends itself to real-time implementation, thereby providing a mechanism to make high-quality, dynamic routing decisions for large-scale operations.
Finally, we consider a more traditional ADP approach to the VRPSDL by developing a parameterized linear function to approximate the value functions corresponding to our problem formulation. We estimate parameters via a simulation-based algorithm and show that initializing parameter values via our rollout policies leads to significant improvements. However, we conclude that additional research is required to develop a parametric ADP methodology comparable or superior to our rollout policies.
46
Winter, Kelly M. "Elucidating the Role of Neighborhood Deprivation in Hypertensive Disorders of Pregnancy." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3798.
Full textAbstract:
This dissertation examined risk factors for hypertensive disorders of pregnancy (HDP) — specifically whether neighborhood socioeconomic deprivation exacerbates individual socioeconomic disadvantage (deprivation amplification) to increase the likelihood of developing HDP. To select the optimal areal unit at which to investigate HDP, geographic proxies for neighborhoods were explored.
A thematic review qualitatively examined nontraditional neighborhood boundaries identified through internet sources. Data from 2008–2012 Miami-Dade County, Florida birth records (n=121,421) and the U.S. Census Bureau were used for the remaining analyses. Ordinary least squares (OLS) and geographically weighted regression (GWR) analysis empirically compared the proportion of HDP prevalence explained by six areal units: census block groups, census tracts, ZIP code tabulation areas (ZCTAs), and three types of natural neighborhood — census units clustered based on an eight-item Neighborhood Deprivation Index. Multilevel logistic regression examined relationships between HDP, neighborhood deprivation, and individual-level factors. Odds ratios (OR) and adjusted odds ratios (aOR) were calculated.
The thematic review found 22 potential alternatives to census boundaries developed through techniques such as crowd-sourcing and qualitative research. In the sensitivity analysis, census tracts aggregated at the scale of ZCTAs performed twice as well as any other model (GWR2 = 0.27) and were used as the Aim 3 unit of analysis. In the multilevel logistic regression, HDP was associated with moderate (aOR=1.13; CI: 1.05, 1.21) and high neighborhood deprivation (aOR=1.16; CI: 1.07, 1.26).
Compared with mothers with private insurance, uninsured women (aOR=1.69; CI: 1.56, 1.84) and Medicaid recipients (aOR=1.12; CI: 1.05, 1.18) had higher HDP odds. Non-Hispanic Black women’s HDP odds were 1.58 times those of non-Hispanic White women. Cross-level interactions — between neighborhood deprivation and educational attainment and neighborhood deprivation and insurance status — did not reach statistical significance.
Private sector neighborhood boundaries hold promise for developing new public health tools. Because they are relatively easy to generate from census data, natural neighborhoods may balance tradition and innovation. While no evidence of deprivation amplification was found, results suggested that individual-level and neighborhood deprivation are HDP risk factors. Interventions that target expectant mothers in deprived neighborhoods — particularly non-Hispanic Black and Hispanic women who lack health insurance — may help reduce HDP prevalence and disparities.
47
Muccino, Lori A. "Who You Are and Where You Live: Immigrant Status, Context, and Adolescent Problem Behavior." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1217534211.
Full text
48
Gentilini, Iacopo. "Multi-Goal Path Optimization for Robotic Systems with Redundancy based on the Traveling Salesman Problem with Neighborhoods." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/154.
Full textAbstract:
Finding an optimal path for a redundant robotic system to visit a sequence of several goal locations is a complex optimization problem and poses two main technical challenges. Because of the redundancy in the system, the robot can assume an infinite number of goal configurations to reach each goal location. Therefore, not only an optimal sequence of the goals has to be defined, but also, for each goal, an optimal configuration has to be chosen among infinite possibilities. Second, the actual cost for the system to move from one configuration to the next depends on many factors, such as obstacle avoidance or energy consumption, and can be calculated only through the employment of specific path planning techniques.
We first address the optimization problem of finding an optimal sequence of optimal configurations, while assuming the cost function to be analytically defined. This problem is modeled as a Traveling Salesman Problem with Neighborhoods (TSPN), which extends the well-known TSP to more general cases where each vertex (goal configuration) is allowed to move in a given region (neighborhood). In the literature, heuristic solution approaches are available for TSPN instances with only circular or spherical neighborhoods. For more general neighborhood topologies, but limited to the Euclidean norm as edge weighting function, approximation algorithms have also been proposed. We present three novel approaches: (1) a global Mixed Integer Non Linear Programming (MINLP) optimizer and (2) a convex MINLP optimizer are modified to solve to optimality TSPN instances with up to 20 convex neighborhoods, and (3) a hybrid random-key Genetic Algorithm (GA) is developed to address more general problems with a larger number of possibly non-convex neighborhoods and with different types of edge weighting functions. Benchmark tests show that the GA is able to find the same optimal tour calculated by the MINLP solvers while drastically reducing the computational cost, and it always improves the best known solutions for available test problems with up to 1,000 neighborhoods.
Second, we integrate the GA with a probabilistic path planning technique to apply the proposed procedure to two practical applications. We minimize the time currently required by an industrial vision inspection system to complete a multi-goal cycle, where the neighborhoods are defined using piecewise cubic splines in a seven-dimensional configuration space. Afterwards, we optimize the flight path and the energy consumption of a quadrotor Unmanned Aerial Vehicle (UAV) on an urban survey mission. The specifications of the camera installed on the UAV are used here to define the neighborhoods as three-dimensional polyhedra.
49
Sapotichne, Brenna. "Fearful Temperament Moderates the Effect of Harsh Parenting on Early Childhood Problem Behaviors within Dangerous Neighborhoods: A Multilevel Analysis." ScholarWorks@UNO, 2015. http://scholarworks.uno.edu/td/2106.
Full text
50
Köber, Göran [Verfasser], and Dietrich [Akademischer Betreuer] Oberwittler. "A dynamic and relational perspective on vulnerability and fear of crime : : the role of physical, psychological, and social factors as well as life events and neighborhood contexts using a between-within person approach." Freiburg : Universität, 2018. http://d-nb.info/1184198837/34.
Full text