Дисертації з теми "Discrete location"

Submitted by Letícia Nunes (leticiafcnunes@gmail.com) on 2015-06-11T16:44:52Z No. of bitstreams: 1 Dissertação - Leticia Nunes - Practice Location of Physicians.pdf: 569206 bytes, checksum: bde07c17bc4ab59a76a947e9fa27f35e (MD5)<br>Approved for entry into archive by BRUNA BARROS (bruna.barros@fgv.br) on 2015-06-18T13:46:34Z (GMT) No. of bitstreams: 1 Dissertação - Leticia Nunes - Practice Location of Physicians.pdf: 569206 bytes, checksum: bde07c17bc4ab59a76a947e9fa27f35e (MD5)<br>Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2015-06-29T12:13:05Z (GMT) No. of bitstreams: 1 Dissertação - Leticia Nunes - Practice Location of Physicians.pdf: 569206 bytes, checksum: bde07c17bc4ab59a76a947e9fa27f35e (MD5)<br>Made available in DSpace on 2015-06-29T12:13:22Z (GMT). No. of bitstreams: 1 Dissertação - Leticia Nunes - Practice Location of Physicians.pdf: 569206 bytes, checksum: bde07c17bc4ab59a76a947e9fa27f35e (MD5) Previous issue date: 2015-04-07<br>Economists and policymakers have long been concerned with increasing the supply of health professionals in rural and remote areas. This work seeks to understand which factors influence physicians’ choice of practice location right after completing residency. Differently from previous papers, we analyse the Brazilian missalocation and assess the particularities of developing countries. We use a discrete choice model approach with a multinomial logit specification. Two rich databases are employed containing the location and wage of formally employed physicians as well as details from their post-graduation. Our main findings are that amenities matter, physicians have a strong tendency to remain in the region they completed residency and salaries are significant in the choice of urban, but not rural, communities. We conjecture this is due to attachments built during training and infrastructure concerns.

In power transmission systems, locating faults is an essential technology. When a fault occurs on a transmission line, it will affect the whole power system. To find the fault location accurately and promptly is required to ensure the power supply. In this paper, the study of traveling wave theory, fault location method, Karrenbauer transform, and Wavelet transform is presented. This thesis focuses on single ended fault location method. The signal processing technique and evaluation study are presented. The MATLAB SimPowerSystem is used to test and simulate fault scenarios for evaluation studies.

Thesis (Ph. D.)--West Virginia University, 1999.<br>Title from document title page. Document formatted into pages; contains x, 126 p. : ill. (some col.), maps (some col.). Includes abstract. Includes bibliographical references (p. 98-103).

Cette thèse porte sur la solution exacte des problèmes NP-difficiles du p-median et du p-centre, des problèmes d'optimisation combinatoire qui deviennent rapidement difficiles à résoudre lorsque la taille de l'instance augmente. Ces problèmes de localisation discrète consistent à ouvrir un nombre défini p d'installations, puis à leur affecter un ensemble de clients selon une fonction objectif à minimiser.Tout d'abord, nous étudions le problème du p-median qui cherche à minimiser la somme des distances entre les clients et les installations ouvertes auxquelles ils sont affectés. Nous développons un algorithme basé sur la décomposition de Benders qui surpasse les méthodes exactes de l'état de l'art. L'algorithme considère une approche en deux étapes et ainsi qu'un algorithme efficace pour la séparation des coupes de Benders. Cette méthode est évaluée sur plus de 230 instances de benchmark avec jusqu'à 238025 clients et sites. De nombreuses instances sont résolues à l'optimalité pour la première fois ou ont leur meilleure solution connue améliorée.Deuxièmement, nous explorons le problème du p-centre qui cherche à minimiser la plus grande distance entre un client et l'installation ouverte qui en est la plus proche. Nous comparons d'abord les cinq principales formulations MILP de la littérature. Nous étudions la décomposition de Benders et nous proposons également un algorithme exact basé sur une procédure de partionnement des clients reposant sur la structure du problème. Toutes les méthodes proposées sont comparées à l'état de l'art dans des instances de benchmark. Les résultats obtenus sont analysés, mettant en évidence les avantages et les inconvénients de chaque méthode.Enfin, nous étudions un problème robuste du p-centre en deux étapes avec une incertitude sur les demandes et les distances des nœuds. Nous introduisons la reformulation robuste du problème basée sur les cinq principales formulations déterministes MILP de la littérature. Nous prouvons que seul un sous-ensemble fini de scénarios de l'ensemble d'incertitude infini peut être pris en compte sans perdre l'optimalité. Nous proposons également un algorithme de génération de colonnes et de contraintes et ainsi qu'un algorithme de branch-and-cut pour résoudre efficacement ce problème. Nous montrons comment ces algorithmes peuvent également être adaptés pour résoudre le problème robuste d'une seule étape. Les différentes formulations proposées sont testées sur des instances générées aléatoirement et sur un cas d'étude de la littérature<br>This thesis focuses on the exact solution of the NP-hard problems p-median and p-center, combinatorial optimization problems that quickly become difficult to solve as the instance size increases. These discrete location problems involve opening a defined number p of facilities and then allocating to them a set of clients according to an objective function to be minimized.First, we study the p-median problem, which seeks to minimize the sum of distances between clients and the open facilities to which they are allocated. We develop an algorithm based on Benders decomposition that outperforms state-of-the-art exact methods. The algorithm considers a two-stage approach and an efficient algorithm for separating Benders cuts. The method has been evaluated on over 230 benchmark instances with up to 238025 clients and sites. Many instances are solved to optimality for the first time or have their best known solution improved.Secondly, we explore the p-center problem, which seeks to minimize the largest distance between a client and its nearest open facility. We first compare the five main MILP formulations in the literature. We study the Benders decomposition and also propose an exact algorithm based on a client clustering procedure based on the structure of the problem. All the proposed methods are compared with the state-of-the-art on benchmark instances. The results obtained are analyzed, highlighting the advantages and disadvantages of each method.Finally, we study a robust two-stage p-center problem with uncertainty on node demands and distances. We introduce the robust reformulation of the problem based on the five main deterministic MILP formulations in the literature. We prove that only a finite subset of scenarios from the infinite uncertainty set can be considered without losing optimality. We also propose a column and constraint generation algorithm and a branch-and-cut algorithm to efficiently solve this problem. We show how these algorithms can also be adapted to solve the robust single-stage problem. The different proposed formulations are tested on randomly generated instances and on a case study drawn from the literature

Life expectancy has continuously increased in most countries over the last decades and will probably continue to increase in the future. This leads to new challenges relative to the autonomy and the independence of elderly. The development of Smart Homes is a direction to face these challenges and to enable people to live longer in a safe and comfortable environment. Making a home smart consists in placing sensors, actuators and a controller in the house in order to take into account the behavior of their inhabitants and to act on their environment to improve their safety, health and comfort. Most of these approaches are based on the real-time indoor Location Tracking of the inhabitants. In this thesis, a whole new approach for model-based Location Tracking of an a priori unknown number of inhabitants is proposed. This approach is based on Discrete Event Systems paradigms, theory and tools. The usage of Finite Automata (FA) to model the detectable motion of the inhabitants as well as different methods to create such FA models have been developed. Based on these models, algorithms to perform efficient Location Tracking are defined. Finally, several approaches aiming at evaluating the relevance of the instrumentation of a Smart Home with the objective of Location Tracking are proposed. The approach has also been fully implemented and tested. Throughout the thesis, the different contributions are illustrated on case studies.

Society is increasingly concerned about the environmental impact of energy systems, and prefers to locate power lines underground. In future, certain socially/environmentally sensitive overhead transmission feeders will need to include underground cable sections. Fault location, especially when using travelling waves, become complicated when the combined transmission line includes a number of discontinuities, such as junction points, teed points and fault points. Consequently, a diverse range of fault locators were developed in this thesis, and the performance of the proposed fault locators investigated. For a combined transmission line (CTL), consisting of one or more overhead line sections and one or more underground cable sections, a hybrid fault location scheme is proposed. This utilises the robustness of an impedance based distance algorithm and the accuracy, but stability concerns, of a travelling wave based fault locator, to determine the faulted section. The distance algorithm can determine the approximate fault location, but if the fault is located near an “underground-overhead” junction point, the accuracy is not sufficient to decide whether the fault is located on the overhead or the underground section. This thesis proposes utilizing a single end travelling wave fault locator to improve the accuracy of the fault location decision. The single end travelling wave fault locator can determine the fault section according to the permutation of the polarity of the “special surges”, which is especially important when the fault is close to a junction point. However, this single end fault locator fails in certain “blind” areas, wand these require the use of a distance relay to help determine fault section. Simulation results demonstrated that this hybrid fault locator can reliably determine which section of the feeder is faulty. For all types of CTL, including teed networks, the multiple-end travelling wave fault locator, utilising the arrival time at the feeder ends of the first fault instigated surges, can estimate the fault location. One of the main features of the proposed fault locator is the classification of the time difference between the arrivals of a fault instigated surge at the feeder ends as standard values, when the fault is located at each of the junction points or teed points. Comparing the time differences measured during an actual fault with these standard values allows the faulted feeder section to be estimated. The simulation results show this multiple-end travelling wave fault locator is highly reliable and suitable for application on combined overhead and underground transmission lines.

Fault location within electric power systems is an important topic that helps reduce outage duration and increases reliability of the system. This paper explores the topic of fault location using traveling waves generated by fault conditions and the discrete wavelet transform used for time-frequency analysis. The single-ended and double-ended traveling wave methods are presented and evaluated on a single circuit and double circuit 500kV system modeled using MATLAB SIMULINK. Results are compared on the basis of wavelet used for analysis, sampling rate, and fault resistance.

Traffic incidents routinely impact the flow of vehicles on roadways. These incidents need to be identified, and responded to in a timely fashion in order to keep traffic moving safely and efficiently. One of the main areas of transportation research that remains of contemporary interest is the study of travel times. Travel time information technologies, until very recently, have not been efficient enough to provide instantaneous information for managing traffic flow. The Virginia Department of Transportation (VDOT) currently operates a number of surveillance technologies. Of particular interest to us are Automatic Vehicle Identification (AVI) tag readers to assimilate travel time information. One of VDOT's latest research thrusts has been to develop efficient algorithms for estimating link travel times using such advanced technologies. To achieve this purpose, VDOT is currently monitoring volunteer tagged cars by using AVI tag readers fixed at certain specific locations. This thesis focuses on devising an efficient methodology to capture as much travel time information as possible, by solving a Reader Location Problem that maximizes the benefit accruing from measuring travel time variability with respect to freeways. This problem is formulated as a quadratic 0-1 optimization problem. The objective function parameters in the optimization problem represent certain benefit factors resulting from the ability to measure travel time variability along various origin-destination paths. A simulation study using the INTEGRATION package is performed to derive these benefit factors for various types of freeway sections, and two composite functions that measure benefits for O-D paths that are comprised of several such sections are presented. The simulation results are presented as generic look-up tables, and can be used for any freeway section for the purpose of computing the associated benefit factor coefficient. An optimization approach based on the Reformulation-Linearization Technique coupled with Semidefinite Programming concepts is designed to solve the formulated reader location problem. This approach can be used to derive alternative equivalent formulations of the problem that vary in the degree of tightness of their underlying linear programming relaxations. Four such model representations are explored by using the software package, AMPL-CPLEX 6.5.3, to solve them for some sample transportation networks. The sensitivity of the reader locations to the different proposed benefit factor composite functions is also investigated. The results indicate that the first level continuous RLT relaxation to problem RL produces a tight underlying representation and that the optimal solution obtained for this relaxation tends to be very close to the actual integer optimum. Moreover, it is found that the optimal locations of the readers are insensitive to either the traffic, or the benefit factor used, or the density of the graph, when these factors are considered individually. However, a combination of two or more of these factors can lead to a change in the optimal locations of the readers.<br>Master of Science

Cette thèse se concentre sur l'interdépendance entre les choix de localisation résidentielle et professionnelle. Des questions telles que le processus de prise de décision, l'accessibilité à l'emploi, la répartition géographique des emplois, et le prise de décision collective des conjoints, entre autres, sont analysées en développant des modèles de choix discrets. Dans ce cadre, nous étudions les choix de localisation à partir de deux points de vues complémentaires. (1) Premièrement, nous étudions l'interdépendance entre les deux choix de localisation sans considérer le processus de décision au sein des ménages. Nous développons un modèle logit emboîté à trois niveaux, pour les choix de localisation résidentielle et professionnelle et nous étudions l'effet des mesures d'attractivité et d'accessibilité spécifiques à chaque individu (log-sommes). Les résultats du premier chapitre montrent que l'accessibilité spécifique à chaque individu est un facteur déterminant du choix de localisation résidentielle et que son effet diffère le long du cycle de vie des ménages. L'attractivité des types d'emploi est un meilleur indicateur du choix de localisation professionnelle que le nombre d'emplois. L'évolution des mesures d'attractivité et d'accessibilité aux emplois est analysée dans le deuxième chapitre. (2) Deuxièmement, nous étudions l'interdépendance de la localisation résidentielle et professionnelle au sein du ménage. Cette thèse contribue à la littérature des modèles collectifs en développant un modèle de choix avec processus de négociation au sein des ménages à la Chiappori, pour décrire le choix de localisation résidentielle des ménages bi-actifs. Le dernier chapitre développe et estime un modèle structurel en deux étapes pour faire la part des choses entre le pouvoir de négociation et les valeurs du temps des conjoints. Les résultats montrent que les nationalités du couple, leur niveau d'éducation, ainsi que la différence d'âge entre les conjoints jouent un rôle crucial dans la détermination de pouvoir de négociation<br>This thesis studies the interdependency between the choices of residential and workplace location. Issues such as the decision-making process, the accessibility to jobs, the geographical distribution of job types, and the spouses collective decision process, among others, are analyzed with discrete choice models. In this setting, we study the location decisions from two complementary points of view. (1) First, we study the interdependency between the two location choices without any within-household consideration. We develop a three-level nested logit model of residential and workplace location and study the effect of individual-specific attractiveness and accessibility (log-sum) measures. Results presented in the first chapter show that the individual-specific accessibility measure is an important determinant of the choice of residential location and its effect differs along the household life cycle. Additionally, the attractiveness of the types of employment is a better predictor of the workplace location than the usual total number of jobs. We analyze the evolution of the attractiveness and attractivity measures in the second chapter. (2) Second, we study the interdependency of residential location and workplaces within the household. This thesis contributes with a within-household bargaining process model of location decisions. As such, it applies the collectiveapproach à la Chiappori of household behavior to describe residential location choice of two-worker households. The last chapter develops and estimates a two-step structural model to disentangle bargaining powers from spouses' values of time. Results show that the nationalities of the couple, their education level, as well as the age difference between spouses play a crucial role in determining bargaining power

L’objectif de cette thèse est de proposer des solutions efficaces à des problèmes de décision qui ont un impact sur la vie des citoyens, et qui reposent sur des données incertaines. Au niveau des applications, nous nous intéressons à deux problèmes de localisation qui ont un impact sur l’espace public, notamment la localisation de nouveaux logements, et la localisation de vendeurs mobiles dans l’espace urbain. Les problèmes de localisation ne sont pas un sujet récent dans la littérature, toutefois, pour ces deux problèmes qui reposent sur des modèles de choix pour le comportement d’achat des consommateurs, l’incertitude dans le modèle génère un cas spécial qui permet d’étendre la littérature sur l’Optimisation Robuste. Les contributions de cette thèse peuvent s’appliquer à divers problèmes génériques d’optimisation<br>We address decision problems under uncertain information with non-linear structures of parameter variation, and devise solution methods in the spirit of Bertsimas and Sim’s Γ-Robustness approach. Furthermore, although the non-linear impact of uncertainty often introduces discrete structures to the problem, for tractability, we provide the conditions under which the complexity class of the nominal model is preserved for the robust counterpart. We extend the Γ-Robustness approach in three avenues. First, we propose a generic case of non-linear impact of parameter variation, and model it with a piecewise linear approximation of the impact function. We show that the subproblem of determining the worst-case variation can be dualized despite the discrete structure of the piece-wise function. Next, we built a robust model for the location of new housing where the non-linearity is introduced by a choice model, and propose a solution combining Γ-Robustness with a scenario-based approach. We show that the subproblem is tractable and leads to a linear formulation of the robust problem. Finally, we model the demand in a Location Problem through a Poisson Process inducing, when demands are uncertain, non-linear structures of parameter variation. We propose the concept of Nested Uncertainty Budgets to manage uncertainty in a tractable way through a hierarchical structure and, under this framework, obtain a subproblem that includes both continuous and discrete deviation variables

In 1993, a travel study was conducted along the Wasatch front in Utah (Research Systems Group INC, 2013). The main purpose of this study was to assess travel behavior to understand the needs for future growth in Utah. Since then, the Research Service Group (RSG), conducted a new study in 2012 to understand current travel preferences in Utah. This survey, called the Residential Choice Stated Preference survey, asked respondents to make ten choice comparisons between two hypothetical homes. Each home in the choice comparison was described by different attributes, those attributes that were used are, type of neighborhood, distance from important destinations, distance from access to public transport, street design, parking availability, commute distance to work, and price. The survey was designed to determine the extent to which Utah residents prefer alternative household attributes in a choice selection. Each attribute contained multiple characteristic levels that were randomly combined to define each alternative home in each choice comparison. Those choices can be explained by Random Utility Theory. Multinomial logistic regression will be used to estimate changes in utility when alternative attribute levels are present in a choice comparison. Using the coefficient estimate for price, a marginal willingness to pay (MWTP) for each attribute level will be calculated. This paper will use two different approaches to obtain MWTP estimates. Method One will use housing and rent price to recode the price variable in dollar terms as defined in the discrete choice experiment. Method Two will recode the price variable as an average ten percent change in home value to extrapolate a one-time payment for homes. As a result, we found that it is possible to obtain willingness to pay estimates using both methods. The resulting interpretations in dollar terms became more relatable. Metropolitan planning organization can use these results to understand how residents perceive home value in dollar terms in the context of location-based attributes for homes.

La compétitivité des entreprises manufacturières dépend fortement de la productivité des machines etdes moyens de production. Pour garantir un haut niveau de productivité il est indispensable de minimiser lestemps d'arrêt dus aux fautes ou dysfonctionnements. Cela nécessite des méthodes efficaces pour détecter et isolerles fautes apparues dans un système (FDI). Dans cette thèse, une méthode FDI à base de modèles est proposée.La méthode est conçue pour la classe des systèmes à événements discrets industriels composés d'une bouclefermée du contrôleur et du processus. En comparant les comportements observés et attendus par le modèle, il estpossible de détecter et d'isoler des fautes. A la différence de la plupart des approches FDI des systèmes àévénements discrets, une méthode basée sur des modèles du comportement normal au lieu de modèles descomportements fautifs est proposée. Inspiré par le concept des résidus bien connu pour le diagnostic dessystèmes continus, une nouvelle approche pour l'isolation des fautes dans les systèmes à événements discrets aété développée. La clé pour l'application des méthodes FDI basées sur des modèles est d'avoir un modèle justedu système considéré. Comme une modélisation manuelle peut être très laborieuse et coûteuse pour dessystèmes à l'échelle industrielle, une approche d'identification pour les systèmes à événements discrets enboucle fermée est développée. Basée sur un algorithme connu pour l'identification des modèles monolithiques,une adaptation distribuée est proposée. Elle permet de traiter de grands systèmes comportant un haut degré deparallélisme. La base de cette approche est une décomposition du système en sous systèmes. Cettedécomposition est automatisée en utilisant un algorithme d'optimisation analysant le comportement observé dusystème. Les méthodes conçues dans cette thèse ont été mises en oeuvre sur une étude de cas et sur uneapplication d'échelle industrielle.

In this thesis we study two discrete optimization problems: Traffic Light Synchronization and Location with Customers Orderings. A widely used approach to solve the synchronization of traffic lights on transport networks is the maximization of the time during which cars start at one end of a street and can go to the other without stopping for a red light (bandwidth maximization). The mixed integer linear model found in the literature, named MAXBAND, can be solved by optimization solvers only for small instances. In this manuscript we review in detail all the constraints of the original linear model, including those that describe all the cyclic routes in the graph, and we generalize some bounds for integer variables which so far had been presented only for problems that do not consider cycles. Furthermore, we summarized the first systematic algorithm to solve a simpler version of the problem on a single street. We also propose a solution algorithm that uses Tabu Search and Variable Neighbourhood Search and we carry out a computational study. In addition we propose a linear formulation for the shortest path problem with traffic lights constraints (SPTL). On the other hand, the simple plant location problem with order (SPLPO) is a variant of the simple plant location problem (SPLP) where the customers have preferences on the facilities which will serve them. In particular, customers define their preferences by ranking each of the potential facilities. Even though the SPLP has been widely studied in the literature, the SPLPO has been studied much less and the size of the instances that can be solved is very limited. In this manuscript, we propose a heuristic that uses a Lagrangean relaxation output as a starting point of a semi-Lagrangean relaxation algorithm to find good feasible solutions (often the optimal solution). We also carry out a computational study to illustrate the good performance of our method. Last, we introduce the partial and stochastic versions of SPLPO and apply the Lagrangean algorithm proposed for the deterministic case to then show examples and results.

This dissertation studies in depth the structure of the Discrete Ordered Median Problem (DOMP), to define new formulations and resolution algorithms. Furthermore we analyze an interesting extension for DOMP, namely MDOMP (Monotone Discrete Ordered Median Problem). This thesis is structured in three main parts.First, a widely theoretical and computational study is reported. It presents several new formulations for the Discrete Ordered Median Problem (DOMP) based on its similarity with some scheduling problems. Some of the new formulations present a considerably smaller number of constraints to define the problem with respect to some previously known formulations. Furthermore, the lower bounds provided by their linear relaxations improve the ones obtained with previous formulations in the literature even when strengthening is not applied. We also present a polyhedral study of the assignment polytope of our tightest formulation showing its proximity to the convex hull of the integer solutions of the problem. Several resolution approaches, among which we mention a branch and cut algorithm, are compared. Extensive computational results on two families of instances, namely randomly generated and from Beasley's OR-library, show the power of our methods for solving DOMP. One of the achievements of the new formulation consists in its tighter LP-bound. Secondly, DOMP is addressed with a new set partitioning formulation using an exponential number of variables. This chapter develops a new formulation in which each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding distances. We use a column generation approach to solve the continuous relaxation of this model. Then, we apply a branch-cut-and-price algorithm to solve to optimality small to moderate size of DOMP in competitive computational time.To finish, the third contribution of this dissertation is to analyze and compare formulations for the monotone discrete ordered median problem. These formulations combine different ways to represent ordered weighted averages of elements by using linear programs together with the p-median polytope. This approach gives rise to two efficient formulations for DOMP under a hypothesis of monotonicity in the lambda vectors. These formulations are theoretically compared and also compared with some other formulations valid for the case of general lambda vector. In addition, it is also developed another new formulation, for the general case, that exploits the efficiency of the rationale of monotonicity. This representation allows to solve very efficiently some DOMP instances where the monotonicity is only slightly lost. Detailed computational tests on all these formulations is reported in the dissertation. They show that specialized formulations allow to solve to optimality instances with sizes that are far beyond the limits of those that can solve in the general case.<br>Cette dissertation étudie en profondeur la structure du "Discrete Ordered Median Problem" (DOMP), afin de proposer de nouvelles formulations et de nouveaux algorithmes de résolution. De plus, une extension intéressante du DOMP nommée MDOMP ("Monotone Discrete Ordered Median Problem") a été étudiée.Cette thèse a été structurée en trois grandes parties.La première partie présente une étude riche aux niveaux théorique et expérimentale. Elle développe plusieurs formulations pour le DOMP qui sont basées sur des problèmes d'ordonnancement largement étudiés dans la littérature. Plusieurs d'entres elles nécessitent un nombre réduit de contraintes pour définir le problème en ce qui concerne certaines formulations connues antérieurement. Les bornes inférieures, qui sont obtenues par la résolution de la relaxation linéaire, donnent de meilleurs résultats que les formulations précédentes et ceci même avec tout processus de renforcement désactivé. S'ensuit une étude du polyhèdre de notre formulation la plus forte qui montre sa proximité entre l'enveloppe convexe des solutions entières de notre problème. Un algorithme de branch and cut et d'autres méthodes de résolution sont ensuite comparés. Les expérimentations qui montrent la puissance de nos méthodes s'appuient sur deux grandes familles d'instances. Les premières sont générées aléatoirement et les secondes proviennent de Beasley's OR-library. Ces expérimentations mettent en valeur la qualité de la borne obtenue par notre formulation.La seconde partie propose une formulation "set partitioning" avec un nombre exponentiel de variables. Dans ce chapitre, la formulation comporte des variables associées à un ensemble de demandes affectées à la même facilité selon l'ordre établi sur leurs distances correspondantes. Nous avons alors développé un algorithme de génération de colonnes pour la résolution de la relaxation continue de notre modèle mathématique. Cet algorithme est ensuite déployé au sein d'un Branch-and-Cut-and-Price afin de résoudre des instances de petites et moyennes tailles avec des temps compétitifs.La troisième partie présente l'analyse et la comparaison des différentes formulations du problème DOMP Monotone. Ces formulations combinent plusieurs manières de formuler l'ordre des éléments selon les moyennes pondérées en utilisant plusieurs programmes linéaires du polytope du p-median. Cette approche donne lieu à deux formulations performantes du DOMP sous l'hypothèse de monotonie des vecteurs lambda. Ces formulations sont comparées de manière théorique puis comparées à d'autres formulations valides pour le cas général du vecteur lambda. Une autre formulation est également proposée, elle exploite l'efficacité du caractère rationnel de la monotonie. Cette dernière permet de résoudre efficacement quelques instances où la monotonie a légèrement disparue. Ces formulations ont fait l'objet de plusieurs expérimentations dècrites dans ce manuscrit de thèse. Elles montrent que les formulations spécifiques permettent de résoudre des instances plus importantes que pour le cas général.<br>Este trabajo estudia en profundidad la estructura del problema disctreto de la mediana ordenada (DOMP, por su acrónimo en inglés) con el objetivo de definir nuevas formulaciones y algoritmos de resolución. Además, analizamos una interesante extensión del DOMP conocida como el problema monótono discreto de la mediana ordenada (MDOMP, de su acrónimo en inglés).Esta tesis se compone de tres grandes bloques.En primer lugar, se desarrolla un detallado estudio teórico y computacional. Se presentan varias formulaciones nuevas para el problema discreto de la mediana ordenada (DOMP) basadas en su similaridad con algunos problemas de secuenciación. Algunas de estas formulaciones requieren de un cosiderable menor número de restricciones para definir el problema respecto a algunas de las formulaciones previamente conocidas. Además, las cotas inferiores proporcionadas por las relajaciones lineales mejoran a las obtenidas con formulaciones previas de la literatura incluso sin reforzar la nueva formulación. También presentamos un estudio poliédrico del politopo de asignación de nuestra formulación más compacta mostrando su proximidad con la envolvente convexa de las soluciones enteras del problema. Se comparan algunos procedimientos de resolución, entre los que destacamos un algoritmo de ramificación y corte. Amplios resultados computacionales sobre dos familias de instancias -aleatoriamente generadas y utilizando la Beasley's OR-library- muestran la potencia de nuestros métodos para resolver el DOMP.En el segundo bloque, el problema discreto de la mediana ordenada es abordado con una formulación de particiones de conjuntos empleando un número exponencial de variables. Este capítulo desarrolla una nueva formulación en la que cada variable corresponde a un conjunto de puntos de demanda asignados al mismo servidor con la información de la posición obtenida de ordenar las distancias correspondientes. Utilizamos generación de columnas para resolver la relajación continua del modelo. Después, empleamos un algoritmo de ramificación, acotación y "pricing" para resolver a optimalidad tamaños moderados del DOMP en un tiempo computacional competitivo.Por último, el tercer bloque de este trabajo se dedica a analizar y comparar formulaciones para el problema monótono discreto de la mediana ordenada. Estas formulaciones combinan diferentes maneras de representar medidas de pesos ordenados de elementos utilizando programación lineal junto con el politopo de la $p$-mediana. Este enfoque da lugar a dos formulaciones eficientes para el DOMP bajo la hipótesis de monotonía en su vector $lambda$. Se comparan teóricamente las formulaciones entre sí y frente a algunas de las formulaciones válidas para el caso general. Adicionalmente, se desarrolla otra formulación válida para el caso general que explota la eficiencia de las ideas de la monotonicidad. Esta representación permite resolver eficientemente algunos ejemplos donde la monotonía se pierde ligeramente. Finalmente, llevamos a cabo un detallado estudio computacional, en el que se aprecia que las formulaciones ad hoc permiten resolver a optimalidad ejemplos cuyo tamaño supera los límites marcados en al caso general.<br>Doctorat en Sciences<br>info:eu-repo/semantics/nonPublished

Doctor of Philosophy<br>Department of Computing and Information Sciences<br>David Gustafson<br>We use probabilistic graphs to predict the location of swarms over 100 steps in simulations in grid worlds. One graph can be used to make predictions for worlds of different dimensions. The worlds are constructed from a single 5x5 square pattern, each square of which may be either unoccupied or occupied by an obstacle or a target. Simulated robots move through the worlds avoiding the obstacles and tagging the targets. The interactions between the robots and the robots and the environment lead to behavior that, even in deterministic simulations, can be difficult to anticipate. The graphs capture the local rate and direction of swarm movement through the pattern. The graphs are used to create a transition matrix, which along with an occupancy matrix, can be used to predict the occupancy in the patterns in the 100 steps using 100 matrix multiplications. In the future, the graphs could be used to predict the movement of physical swarms though patterned environments such as city blocks in applications such as disaster response search and rescue. The predictions could assist in the design and deployment of such swarms and help rule out undesirable behavior.

La présente thèse de doctorat a pour objectif d'examiner la place et l'importance de l'accessibilité dans les modèles de choix de localisation des ménages et des entreprises. Ces modèles sont deux éléments clés de la conception et la construction des modèles d'interaction transport – usages du sol. Il s’agit, plus précisément, d’analyser l’effet de divers choix méthodologiques d’un point de vue théorique et empirique afin de donner des réponses à des interrogations tout aussi théoriques, méthodologiques, empiriques et politiques. Pour y répondre, quatre articles de recherche constituent le travail principal de la thèse. Les quatre travaux produits ont pour objet l’étude de l’aire urbaine lyonnaise et utilisant des modèles de choix discrets pour expliquer les choix de localisation.Dans le premier article, l’objectif est d’analyser l’effet de la mesure d’accessibilité sur les résultats du modèle de choix de localisation résidentielle. Alors que l'accessibilité a toujours été importante au niveau théorique, certains travaux relativisent son importance au niveau empirique, considérant que d'autres attribues de localisation sont plus influentes. Cet article analyse si différentes méthodes de mesure de l'accessibilité peuvent conduire à des résultats divergents. La conclusion principale estque l'accessibilité est une variable indispensable pour les modèles de choix localisation résidentielle et ce quelle que soit la mesure. Sans la variable de l’accessibilité, le modèle donne des résultats incohérents.Dans le deuxième article, l’objectif est d’analyser les différences de préférences en matière d’accessibilité entre les entreprises nouvellement créées et les entreprises qui se relocalisent. L'accessibilité est l'un des facteurs les plus importants du choix de localisation d’une entreprise. Cependant, même si cela semble intuitif, les travaux analysant les différences entre les créations et les relocalisations sont peu nombreux. En utilisant des données pour huit secteurs d’activités économiques et en confrontant les créations aux relocalisations, les résultats démontrent que l’effet de l’accessibilité diffère d’un secteur économique à l’autre. Cette différence dépend du type d’activité économique du secteur mais aussi du type d’accessibilité.Dans le troisième article, l’objectif est d’évaluer la différence d’impact de l’accessibilité sur les choix de localisation des entreprises du secteur des services aux entreprises. En distinguant les services entre Front Office et Back Office selon leur fonction dans un modèle de choix de localisation, les résultats démontrent que l'effet de l'accessibilité diffère d'un sous-secteur économique à l'autre. Dans le quatrième papier, l'objectif est d'analyser l'évolution temporelle des préférences en matièred'accessibilité des choix résidentiels. De plus en plus de ménages choisissent d’acheter une résidence en banlieue, profitant ainsi de l’augmentation de l’accessibilité. En opposition, les jeunes ménages, appelés aussi «millennials», choisissent de louer dans les zones centrales. Distinguant les locataires des propriétaires, l'analyse des élasticités de périodes 1999, 2006 et 2013 confirme l'intuition initiale qui est que les locataires sont plus sensibles à l'accessibilité à l'emploi. Plus important encore, lapréférence des locataires évolue et croit au cours de la période analysée, alors que celle des propriétaires évolue de façon inverse. Nous suggérons aux planificateurs et aux concepteurs de modèles d’intégrer la dynamique temporelle dans leurs modèles afin d'anticiper au mieux les tendances futures<br>This PhD thesis has as objective to examine the place and the importance of accessibility in location choice models of households and firms, two key construction elements of Land-Use Transport Interaction models. More specifically, the aim is to analyse the effect of various methodological choices from a theoretical and empirical point of view in order to give some answers to theoretical, methodological, empirical and policy issues. Having as a case study the urban area of Lyon and using discrete models to explain the location choices of households and firms, four research papers comprise the main work of this dissertation.In the first paper, the objective was to analyse the effect of the accessibility measure on the results of residential location choice model. While accessibility has always been important at theoretical level, at empirical level, some works questioned its importance, considering other location characteristics as more influential. This paper examines whether different accessibility measurement methods can lead to divergent results. The conclusion is that accessibility is an indispensable variable for residential location choice models and the conclusion remains the same whatever is the measure. Without accessibility, the model gives inconsistent results. Complex accessibility measures give better results, especially for predictions, but simple measures are also relevant for residential location choices modelling.In the second paper, the objective was to analyse the differences of accessibility preferences between new and relocating firms. Accessibility is one of the most important attributes of a location choice of an economic establishment. However, even if it seems intuitive, works analysing any differences between creations and relocations are scarce. Using data from eighteconomic sectors and comparing creations to relocations, the results demonstrate that the effect of accessibility differs between in the same economic sector.In the third paper, the objective was to evaluate the difference of the accessibility impact on the location choices of firms of the business services sector. Distinguishing between Front Office and Back Office business services in a location choice model, the results demonstrate that the effect of accessibility differs between economic subsectors.In the fourth paper, the objective was to analyse the temporal evolution of the preferences for accessibility for residential choices. More and more people choose to buy a residence at the suburbs taking advantage of the accessibility increase. At the same time, young households, the so called millennials, choose to rent in central areas. Distinguishing between renters andowners, the analysis of the elasticities for 1999, 2006 and 2013 confirm the initial intuition. Renters were always more sensitive to accessibility to employment. More importantly, renters show an increasing preference for accessibility during the analysis period, while the owners the opposite. We suggest that planners and model developers should integrate temporal dynamics into their models in order to anticipate better future tendencies

Les problèmes d’optimisation discrète sont pour beaucoup difficiles à résoudre, de par leur nature combinatoire. Citons par exemple les problèmes de programmation linéaire en nombres entiers. Une approche couramment employée pour les résoudre exactement est l’approche de Séparation et Évaluation Progressive. Une approche différente appelée « Resolution Search » a été proposée par Chvátal en 1997 pour résoudre exactement des problèmes d’optimisation à variables 0-1, mais elle reste mal connue et n’a été que peu appliquée depuis. Cette thèse tente de remédier à cela, avec un succès partiel. Une première contribution consiste en la généralisation de Resolution Search à tout problème d’optimisation discrète, tout en introduisant de nouveaux concepts et définitions. Ensuite, afin de confirmer l’intérêt de cette approche, nous avons essayé de l’appliquer en pratique pour résoudre efficacement des problèmes bien connus. Bien que notre recherche n’ait pas abouti sur ce point, elle nous a amené à de nouvelles méthodes pour résoudre exactement les problèmes d’affectation généralisée et de localisation simple. Après avoir présenté ces méthodes, la thèse conclut avec un bilan et des perspectives sur l’application pratique de Resolution Search.<br>The combinatorial nature of discrete optimization problems often makes them diffi- cult to solve. Consider for instance integer linear programming problems, which are commonly solved using a Branch-and-Bound approach. An alternative approach, Resolution Search, was proposed by Chvátal in 1997 for solving 0-1 optimization problems, but remains little known to this day and as such has seen few practical applications. This thesis attempts to remedy this state of affairs, with partial success. Its first contribution consists in the generalization of Resolution Search to any discrete optimization problem, while introducing new definitions and concepts. Next, we tried to validate this approach by attempting to solve well-known problems efficiently with it. Although our research did not succeed in this respect, it lead us to new methods for solving the generalized assignment and uncapacitated facility location problems. After presenting these methods, this thesis concludes with a summary of our attempts at practical application of Resolution Search, along with further perspectives on this matter.<br>Thèse réalisée en cotutelle avec l'Université d'Avignon.

This thesis examines the principal economic factors explaining firms' foreign direct investment (FDI) location decisions into 13 Central and Eastern European countries (CEECs) between 1997 and 2007 using discrete choice econometric methods. The first part employs Meta-analysis to systematically summarise, integrate and synthesise the results of empirical studies that analyse two main reasons why multinational enterprises (MNEs) locate their investment abroad: access to foreign markets and reducing productions costs. A large number of factors related to model specifications, dataset characteristics and methodologies in the primary studies explain the variation in the estimates of the market size and labour costs effects on FDI across the studies. Furthermore, the existing empirical literature on the market size effect on FDI is prone to publication bias more than the literature on the labour costs effect on FDI, as papers with statistically significant and larger market size effect on FDI are more inclined to be published in international journals. The second part employs four alternative discrete choice methodologies, including the Mixed logit (ML) model and the Latent Class (LC) model approaches to capture the main locational determinants of over a 1000 individual firm-level FDI location decisions in 13 CEECs between 1997 and 2007. The results show that the choice where abroad to invest does not only depend on the opportunities offered by foreign markets and industries but also on investing firms' individual characteristics. These results support the presence of heterogeneity in the investment location decisions, which is not only revealed by statistically significant interaction terms, but also by statistically significant standard deviations of the random parameters in the ML model and statistically significant class-specific explanatory variables in the LC model.

Este trabalho apresenta uma proposta de um software de simulação e diagnóstico de falhas aplicado a um sistema de automação. para realizar esta tarefa foi desenvolvido um estudo de caso que contem um problema de automação industrial. Deste estudo foi retirado um modelo, usado como base para criar do software de simulação que segue as especificações dos modelos, no qual é possível observar a evolução dos eventos através de sua linguagem e diagnosticar falhas, quando estas ocorrem em uma das máquinas da planta. O processo de diagnóstico de falhas tem como base as regras de diagnosticabilidade apresentadas na literatura. As máquinas, assim como suas restrições, são modeladas dentro do próprio software, onde são definidas as estruturas de cada automato assim como características como observabilidade, controlabilidade e a possibilidade de falhar. Os testes realizados no sistema apresentado mostraram que a linguagem de controle consegue, mesmo permitindo um nivel de liberdade ao sistema, identificar as falhas verificando somente para os eventos que ocorrem após a ocorrência da mesma.<br>This work we presents a proposal a software of simulation and fault diagnosis applied to an automation system. In that task was developed , a case study that contains a problem of industrial automation. The study was used as the source for creating the simulation that follows the specifications of software models, where you can observe the evolution of events through its language and diagnose faults when they occur in one of the machines of the plant. The process of fault diagnosis is based on the rules of diagnosticabilidades presented in the literature. The machines, as well as its restrictions are modeled within the software itself, where the structures of each automaton are defined the caracteristics as observability an the possibility of failure. The tests in the system showed that of the language used can allowing identify fails, checking only for events that occorem after the occurence the fails.

This dissertation is concerned with decision making in retail operations management. Specifically, we focus on pricing, variety, and inventory decisions, which are at the interface of the marketing and operations functions of a retail firm. We consider two problems that relate to two major types of retail goods. First, we study joint pricing, variety, and inventory decisions for a set of substitutable" items that serve the same need for the consumer (commonly referred to as a "retailer's product line"). Second, we present a novel model of a selling strategy for "complementary" items that we refer to as ``convenience tying," and focus on analyzing the effect of this selling strategy on pricing and profitability. We also study inventory decisions under convenience tying and exogenous pricing. For a product line of substitutable items, the retailer's objective is to jointly determine the set of variants to include in her product line ("assortment"), together with their prices and inventory levels, so as to maximize her expected profit. We model the consumer choice process using a multinomial logit choice model and consider a newsvendor type inventory setting. We derive the structure of the optimal assortment for a special case where the non-ascending order of items in mean consumer valuation and the non-descending order of items in unit cost agree. For this special case, we find that an optimal assortment has a limited number of items with the largest values of the mean consumer valuation (equivalently, the items with the smallest values of the unit cost). For the general case, we propose a dominance rule that significantly reduces the number of different subsets to be considered when searching for an optimal assortment. We also present bounds on the optimal prices that can be obtained by solving single variable equations. Finally, we combine several observations from our analytical and numerical study to develop an efficient heuristic procedure, which is shown to perform well on many numerical tests. With the objective of gaining further insights into the structure of the retailer's optimal decisions, we study a special case of the product line problem with "similar items" having equal unit costs and identical reservation price distributions. We also assume that all items in a product line are sold at the same price. We focus on two situations: (i) the assortment size is exogenously fixed, while the retailer jointly determines the pricing and inventory levels of items in her product line; and (ii) the pricing is exogenously set, while the retailer jointly determines the assortment size and inventory levels. We also briefly discuss the joint pricing/variety/inventory problem where the pricing, assortment size, and inventory levels are all decision variables. In the first setting, we characterize the structure of the retailer's optimal pricing and inventory decisions. We then study the effect of limited inventory on the optimal pricing by comparing our results (in the ``risky case" with limited inventory) with the ``riskless case," which assumes infinite inventory levels. In addition, we gain insights on how the optimal price changes with product line variety as well as demand and cost parameters, and show that the behavior of the optimal price in the risky case can be quite different from that in the riskless case. In the second setting, we characterize the retailer's optimal assortment size considering the trade-off between sales revenue and inventory costs. Our stylized model allows us to obtain strong structural and monotonicity results. In particular, we find that the expected profit at optimal inventory levels is unimodal in the assortment size, which implies that the optimal assortment size is finite. By comparison to the riskless case, we find that this finite variety level is due to inventory costs. Finally, for the joint pricing/variety/inventory problem, we find that even when the retailer has control over the price, finite inventories still restrict the variety level. We also propose several bounds that can be useful in solving the joint problem. We then study a convenience tying strategy for two complementary items that we denote by "primary" and "secondary." The retailer sells the primary item in an appropriate department of her store. In addition, to stimulate demand, the secondary item is offered in two locations: its appropriate department and the primary item's department where it is displayed in very close proximity to the primary item. We analyze the profitability of this selling practice by comparing it to the traditional independent components strategy, where the two items are sold independently (each in its own department). We focus on understanding the effect of convenience tying on pricing. We also briefly discuss inventory considerations. First, assuming infinite inventory levels, we show that convenience tying decreases the price of the primary item and adjusts the price of the secondary item up or down depending on its popularity in the primary item's department. We also derive several structural and monotonicity properties of the optimal prices, and provide sufficient conditions for the profitability of convenience tying. Then, under exogenous pricing, we find that convenience tying is profitable only if it generates enough demand to cover the increase in inventory costs due to decentralizing the sales of the secondary item.<br>Ph. D.

The most costly and labor-intensive activity for almost every warehouse is the order picking process and a key challenge for manufacturing companies is to store parts in an efficient way. Therefore, to minimize the order retrieval time when picking from a storage, the need of a sufficient storage categorization strategy becomes vital. One of the logistics centers at Scania in Södertälje stores parts that will be transported to the chassis assembly and the assembly of gearboxes and axles when needed in the production. In one of the storage areas at the logistics center, namely the PS storage, the forklift drivers picking from the storage have experienced congestion in the storage aisles and that it might be possible to reduce the order fulfillment time when picking the orders. This master thesis aims to investigate the possibility of optimizing the picking process in the PS storage, with respect to the order fulfillment time for the forklift drivers, with categorization of the goods. This has been analyzed with a heuristic optimization approach and with the use of a discrete event simulation model, where different categorization strategies have been applied on the storage and compared to the current state. By categorizing the goods in the PS storage, a reduction of the order fulfillment time can be done of around 4% - 5% compared to the current state with all tested categorization strategies. The strategy which has been shown to give the largest improvement is by categorizing the parts in the storage according to their final delivery address at the production line, which would reduce the order fulfillment time by 5.03% compared to the current state. With this categorization method, parts that are picked on the same route are located close to each other.

[EN] Since its birth in the fifties, the maritime container has revolutionised freight international transport providing support to a global production system, marked by the industry offshoring looking for competitive advantages and the configuration of increasingly complex and global supply chains. Within this context, the container has gained a great importance becoming a basic logistic element in supply chains where it plays the role of a transport, production and distribution unit. The success of container is evident if we analyse the evolution of container port traffic, which has been growing at a pace of over 10 % surpassing 600 million TEU of traffic since 2012. The container is, therefore, a key element in global supply chains and container logistics is a field of work and study of enormous interest due to its impact in the efficiency of these supply chains, due to the cost incurred for the operating account of shipping companies and operators (cost which is transferred to the final user and has an impact in the price of the goods being transported), and due to the social and environmental cost associated to the externalities of transport derived from the management of the container fleet. Container logistics has to do with the efficient management of the container fleet, minimising the transport, warehousing and maintenance costs, and maximising the use of the equipment. In container logistics it is possible to categorise, generally, two different categories or levels depending on the geographical scope and the transport modes involved: The international level and the local or regional level. This thesis addresses container logistics at a local or regional level, insofar as in relation to the management of stock, transport and internal movements, trying to react and identify solutions to some of the problems currently facing the port-logistics sector. The research result allows, firstly, knowing in an integral and structured manner the complexity of maritime container logistics. Secondly, specific real problems are identified and addressed for its modelling and analysis that allows for contributing to the improvement of the current logistics system. The following specific problems are addressed: -Modal choice problems for the configuration of internal logistics corridors or chains for maritime container transport. -Problems locating networks of nodal infrastructures facilitating the logistics needs of maritime containers. -Problems related to the movements and management of empty maritime containers. The interest and the academic contribution of this thesis lies as much in the definition and modelling of the specific problems with a significant theoretical discussion, as the empirical application to a real environment and real situations. This has been possible due to the direct contact of the author with the port-logistics sector and the participation in many consultancy and research projects in the cluster of the port of Valencia and also at European and international level. The thesis is outlined as a collection of six scientific articles. The articles have been presented in the thesis in such a way as to follow a logical sequence and not in relation with the chronological order of their publication.<br>[ES] Desde su aparición en los años 50, el contenedor marítimo ha revoluciona-do el transporte internacional de mercancías dando soporte a un sistema global de producción, marcado por la multilocalización de las industrias en busca de ventajas competitivas y la configuración de cadenas de suministro cada vez más complejas y globales. En este contexto, el contenedor ha adquirido un gran protagonismo convirtiéndose en un elemento logístico básico en las cadenas de suministro en las que actúa como unidad de transporte, producción y distribución. El éxito del contenedor queda puesto de manifiesto al analizar la evolución del tráfico portuario de contenedores, que ha estado creciendo a ritmos superiores al 10 %, superando los 600 millones TEU desde 2012. El contenedor es, por tanto, un elemento clave de las cadenas de suministro globales y la logística del contenedor es un área de estudio y trabajo de enorme interés por el impacto que tiene en la eficiencia de dichas cadenas, por el coste que supone a navieras y operadores en sus cuentas de explotación (coste que se traslada al usuario final y repercute en el precio de las mercancías transportadas) y por el coste social y ambiental asociado a las externalidades del transporte derivadas de esta gestión de la flota de contenedores. La logística del contenedor tiene que ver con la gestión eficiente del parque de contenedores, minimizando los costes de transporte, almacenamiento y mantenimiento, y maximizando la utilización del equipo. En la logística del contenedor se pueden identificar, por lo general, dos categorías o niveles diferenciados en función del ámbito geográfico y de los modos de transporte implicados: El nivel internacional y el nivel local o regional. Este trabajo aborda la logística del contenedor a nivel regional o local, es decir, en lo relativo a la gestión del stock, transporte y movimientos interiores, tratando de dar respuesta y plantear soluciones a algunos de los problemas con los que se encuentra el sector logístico-portuario en la actualidad. El resultado de la investigación permite, en primer lugar, conocer de una forma integral y estructurada la complejidad de la logística del contenedor marítimo. En segundo lugar, se identifican y abordan problemas específicos reales para su modelización y análisis, que permiten contribuir a la mejora del sistema logístico actual. En concreto se abordan los siguientes problemas: -Problemas de elección modal en la configuración de las cadenas o corredores logísticos interiores en el transporte de contenedores marítimos. -Problemas de localización o vertebración de una red de infraestructuras nodales para atender las necesidades logísticas de los contenedores marítimos. -Problemas asociados a los movimientos en vacío y gestión de contenedores marítimos. El interés y contribución académica de este trabajo reside tanto en la definición y modelización de los problemas específicos con una profunda discusión teórica, como en la aplicación empírica a situaciones y entornos reales, cosa que ha sido posible gracias al contacto directo del autor con el sector logístico-portuario y su participación en numerosos proyectos de consulto-ría e investigación tanto en el clúster del Puerto de Valencia como a nivel europeo e internacional. El trabajo se plantea como una colección de seis artículos científicos. El orden en que están situados los artículos en la tesis permite mantener una secuencia lógica construida a posteriori y no según el orden cronológico en el que fueron publicados.<br>[CAT] Des del seu naixement als anys 50, el contenidor marítim ha revolucionat el transport internacional de mercaderies donant suport a un sistema global de producció, marcat per la multilocalització de les indústries en busca d'avantatges competitives i la configuració de cadenes de subministrament cada vegada més complexes i globals. En aquest context, el contenidor ha adquirit un gran protagonisme convertintse en un element logístic bàsic en les cadenes de subministrament en les quals actua com a unitat de transport, producció i distribució. L'èxit del contenidor s'evidencia en analitzar l'evolució del tràfic portuari de contenidors, que ha estat creixent a ritmes superiors al 10 % superant els 600 milions TEU des de 2012. El contenidor és, per tant, un element clau de les cadenes subministrament globals i la logística del contenidor és un àrea d'estudi i treball d'enorme interès per l'impacte que té en l'eficiència d'aquestes cadenes, pel cost que suposa a navilieres i operadors en els seus comptes d'explotació (cost que es trasllada a l'usuari final i repercuteix en el preu de les mercaderies transportades) i pel cost social i ambiental associat a les externalitats del transport derivades d'aquesta gestió de la flota de contenidors. La logística del contenidor té a veure amb la gestió eficient del parc de contenidors, minimitzant els costos de transport, emmagatzematge i manteniment, i maximitzant la utilització de l'equip. En la logística del contenidor es poden identificar, en general, dues categories o nivells diferenciats en funció de l'àmbit geogràfic i de les modalitats de transport implicats: el nivell internacional i el nivell local o regional. Aquest treball aborda la logística del contenidor a nivell regional o local, és a dir, quant a la gestió de l'estoc, transport i moviments interiors, tractant de donar resposta i plantejar solucions a alguns dels problemes amb els quals es troba el sector logístic-portuari en l'actualitat. El resultat de la recerca permet, en primer lloc, conèixer d'una forma integral i estructurada la complexitat de la logística del contenidor marítim. En segon lloc, s'identifiquen i aborden problemes específics reals per a la seua modelització i anàlisi, que permeten contribuir a la millora del sistema logístic actual. En concret s'aborden els següents problemes: -Problemes d'elecció modal en la configuració de les cadenes o corredors logístics interiors en el transport de contenidors marítims. -Problemes de localització o vertebració d'una xarxa d'infraestructures nodals per a atendre les necessitats logístiques dels contenidors marítims. -Problemes associats als moviments en buit i gestió de contenidors marítims. L'interès i contribució acadèmica d'aquest treball resideix tant en la definició i modelització dels problemes específics amb una profunda discussió teòrica, com en l'aplicació empírica a situacions i entorns reals, cosa que ha sigut possible gràcies al contacte directe de l'autor amb el sector logístic-portuari i la seua participació en nombrosos projectes de consultoria i recerca tant en el clúster del Port de València com a nivell europeu i internacional. El treball es planteja com una col·lecció de sis articles científics. L'ordre en què estan situats els articles en la tesi permet mantenir una seqüència lògica construïda a posteriori i no segons l'ordre cronològic en el qual van ser publicats.<br>Furió Pruñonosa, S. (2016). Modelos y métodos avanzados para la logística del contenedor. Aplicación al Puerto de Valencia [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/63248<br>TESIS

Este trabalho apresenta o estudo e o desenvolvimento de um algoritmo híbrido para detecção, classificação e localização de faltas em sistemas com três terminais utilizando como principal ferramenta a transformada wavelet (TW) em suas versões discreta (TWD) e estacionária (TWE). O algoritmo é dito híbrido, pois alia duas metodologias para localizar a falta. A primeira baseada na análise de componentes de alta freqüência (ondas viajantes) e a segunda, baseada na extração dos componentes fundamentais para o cálculo da impedância aparente. A metodologia proposta foi concebida de maneira a trabalhar com dados sincronizados dos três terminais ou apenas dados locais para estimar a localização da falta. O localizador híbrido escolhe automaticamente qual a melhor técnica de localização ser utilizada para alcançar uma localização confiável e precisa. Deste modo, um método pode suprir as dificuldades do outro, ou, no mínimo, fornecer mais informações para que, junto ao conhecimento do operador, uma localização próxima da ótima possa ser alcançada. Com o objetivo de testar e validar a aplicabilidade do algoritmo de localização de faltas híbrido para linhas com três terminais, utilizou-se de dados de sinais faltosos obtidos através de simulações do software ATP (Altenative Transients Program), levando-se em conta a variação de diversos parâmetros que poderiam influenciar o desempenho do algoritmo proposto. Os resultados alcançados pelo algoritmo frente às situações avaliadas são bastante animadores, apontando a uma promissora aplicabilidade do mesmo.<br>This work presents a study and development of a hybrid algorithm for fault detection, classification and location in tree terminal lines based on wavelet transform (WT). It will be presented in two versions: discrete wavelet transform (DWT) and stationary wavelet transform (SWT). The algorithm is called hybrid because it uses two fault location methodologies: one based on fundamental components and other based on traveling waves. The proposed methodology works either with synchronized tree terminal data or only local data. The hybrid fault locator chooses automatically which location technique to be used in order to reach a reliable and accurate fault location. In this manner, this technique can avoid some difficulties present in other techniques, aiming to reach an optimized fault location. The proposed hybrid fault location was evaluated by simulated fault signals obtained by alternative transient program (ATP). In the tests, several parameters, which would influence the performance of the hybrid algorithm, were varied, such as: fault inception angle, fault resistance, fault type, etc. The results obtained by the proposed methodology are very encouraging and it points out to a very promising application.

Wide Area Measurements (WAMs) have been widely used in the energy management system (EMS) of power system for monitoring, operation and control. In recent years, the advent of synchronized Phasor Measurements Unit (PMU) has added another dimension to the field of wide-area measurement. However, the high cost of the PMU, which includes the manufacture and deployment fee, is a hurdle to the wide use of the PMU in power systems. Unlike traditional PMUs, the frequency monitoring network (FNET) developed by the Virginia Tech Power IT lab is an Internetâ based, GPSâ synchronized, wide-area frequency monitoring network deployed at the distribution level, providing a low-cost and easily deployable WAMs solution. In this dissertation, the research work can be categorized into two parts: FNET Design and Situation Awareness Algorithm Development.<br>Ph. D.

Let G = (V (G), E(G)) be a graph and G̅ be the complement of G. The complementary prism of G, denoted GG̅, is the graph formed from the disjoint union of G and G̅ by adding the edges of a perfect matching between the corresponding vertices of G and G̅. A set D ⊆ V (G) is a locating-dominating set of G if for every u ∈ V (G)D, its neighborhood N(u)⋂D is nonempty and distinct from N(v)⋂D for all v ∈ V (G)D where v ≠ u. The locating-domination number of G is the minimum cardinality of a locating-dominating set of G. In this thesis, we study the locating-domination number of complementary prisms. We determine the locating-domination number of GG̅ for specific graphs and characterize the complementary prisms with small locating-domination numbers. We also present bounds on the locating-domination numbers of complementary prisms.

A set S of vertices in a graph G = (V, E) is a locating-dominating set if S is a dominating set of G, and every pair of distinct vertices {u, v} in V - S is located with respect to S, that is, if the set of neighbors of u that are in S is not equal to the set of neighbors of v that are in S. We give a construction of trees that have unique minimum locating-dominating sets.

The ambition of this project is to contribute to the development of optimisation techniques for underground mining. This resulted in a mathematical model to optimise a type of underground transportation system called the ramp. The ramp is a tunnel from the underground mining areas which trucks use to transport material up to the surface. We consider the case where the ramp only fits one truck at a time and it therefore needs passing bays where trucks can meet. We were inspired by an article which optimised the positions of the passing bays and the schedule for the trucks, during a certain time period. We extended that work by proposing a new mathematical model that can handle a more general and complex mine. The result from optimally solving the model gives the positioning of the passing bays and a schedule which completes a number of trips down and up the ramp as quickly as possible. The model can be used both for long-term and short-term planning. The long-term planning regards the positions of the passing bays. The model can therefore be used before the passing bays are constructed to gain insights about where to place them. The short-term planning is about finding an optimal trip schedule given the placement of the passing bays. The model can therefore also be used to provide a haulage schedule for an upcoming time period.

Eine große Herausforderung für Verkehrsmodelle stellt die korrekte Abbildung der Entscheidungsmuster bei der Zielwahl dar. Diese bestimmt die räumlichen Strukturen der Nachfrage und steht in engem Zusammenhang mit zentralen Ergebnissen der Nachfragemodellierung. Rund ein Drittel der Alltagswege in Deutschland sind Einkaufs- und Erledigungwege. Zahlreiche Arbeiten zeigen die Bedeutung von habitualisierten Verhaltensmustern bei der Wahl eines Einkaufsortes. Die Motive der Geschäftswahl gelten als sehr vielfältig. Besondere Bedeutung wird zudem den Primäraktivitätenorten zugeschrieben. Gleichwohl erfolgt die Abbildung der Zielwahl in der Nachfragemodellierung zumeist sehr vereinfachend. Gewöhnlich wird von einem Versorgungseinkauf mit der Geschäftsgröße und der Anreisezeit ausgegangen. Diese Arbeit zeigt anhand empirischer Auswertungen Möglichkeiten einer verhaltensorientierten Abbildung der Einkaufszielwahl in mikroskopischen Personenverkehrsmodellen auf. Im Fokus stehen die Variabilität der Geschäftswahl, die ausschlaggebenden Motive sowie die räumlichen Bezugspunkte der Suche. Am Beispiel des Erwerbs von Nahrungs- und Genussmitteln, von Textilien sowie von Unterhaltungselektronik werden Unterschiede zwischen Einkaufswaren verschiedener Fristigkeit, aber auch zwischen verschiedenen Personengruppen herausgearbeitet. Simulationsrechnungen mit dem Nachfragemodell TAPAS zeigen, dass eine Differenzierung der Einkaufsart sowie die Nutzung eines motivgestützen Erreichbarkeitsmaßes die Modellierungsergebnisse stark verbessern. Die Arbeit stellt erweiterte Indikatoren für eine Berücksichtigung der räumlichen Bezugspunkte bei der Beurteilung der Modellierungsergebnisse bereit. Auch stehen mit den Analysen der Aktivitätenräume, der Umwegfaktoren, der Lage der Einkaufsorte sowie der kumulierten Reiseweiten Informationen zur Verfügung, die generell für die Definition adäquater Suchräume und Bezugspunkte für die Modellierung städtischer Untersuchungsgebiete genutzt werden können.<br>A major challenge in travel demand modelling is the correct representation of decision patterns underlying the choice of destinations. This choice determines the spatial structures of demand and is closely related to central modelling results. Around one third of everyday trips in Germany are for shopping and errands. Numerous studies show the importance of habitualised behavioral patterns when choosing a shopping location. The motives for choosing a shop are considered to be very diverse. Particular importance is attributed to primary activity locations. Nevertheless, the representation of the target choice in demand modelling is usually very simplified. Usually, a supply purchase is implicitly assumed, with the size of the shop and travel time from the previous location being the most important choice criteria. Using empirical analyses, this dissertation shows possibilities for a behavior-oriented depiction of shopping location choice in microscopic passenger transport models. These are discussed in terms of their usability for modeling. The analyses focus on the variability of destinations, the decisive motives and the spatial reference points of the location search. Using the example of the purchase of food and beverages, textiles and consumer electronics, differences between shopping goods of different periodicity and also different groups of people are presented. Simulation calculations with the demand model TAPAS show that a differentiation of the type of purchase and the use of a motive-based accessibility measure greatly improves the modelling results. The dissertation provides extended indicators for a consideration of spatial reference points in the evaluation of the modelling results. Furthermore, the analyses of activity areas, diversion factors, the location of shopping locations and cumulative travel distances provide information that can be generally used to define adequate search areas and reference points for the modelling of urban study areas.Einkaufsverhalten

L’objectif de cette thèse est de développer de nouvelles solutions pour détecter et localiser des sources électromagnétiques radar au niveau d'une unique station de réception en exploitant les signaux directs et indirects reçus. Dans le cadre de notre étude, nous avons dans un premier temps développé une modélisation du signal reçu au niveau d'un récepteur en tenant compte des caractéristiques des émetteurs et de la zone environnante. L'évaluation de cette modélisation a été effectuée en s'appuyant sur un cas particulier de détection et de localisation des réflecteurs. Ce dernier, traité dans la littérature, repose sur l’exploitation des trajets multiples. Ces derniers peuvent être également utilisés pour localiser des sources d’émission. Néanmoins, la plupart des méthodes existantes se basent sur des réflexions dites spéculaires. Les techniques employant les réflexions non spéculaires sur un réflecteur quelconque pour localiser des sources d'émission dans un environnement inconnu font l'objet de peu de publications dans la littérature ouverte. La méthode de localisation que nous proposons a l'avantage de n'employer qu'un récepteur fixe mesurant seulement deux types de grandeurs : les angles d'arrivée (AOA) et les différences de temps d'arrivée (TDOA). En pratique, un problème d'affectation doit être résolu avant de procéder à la localisation des émetteurs et des réflecteurs. Le problème consiste à affecter chaque paire de mesures TDOAAOA à un réflecteur donné, en supposant que chaque paire a déjà été affectée à un émetteur.La méthode que nous avons développée a été testée et évaluée, d'une part grâce à des données simulées et d'autre part en utilisant des mesures réelles<br>The purpose of this work is to develop new methods for the detection and the location of radar sources. The developed approach exploits the direct and indirect signals received at the receiving point. In our study, we first develop a model of these signals that takes into account the characteristics of the transmitters and the reflectors. We evaluate this model by simulating a particular case of reflectors detection and location, defined in the literature. Our goal is to use the multipaths to locate emission sources. Most existing methods are based on specular reflections. Methods based on non-specular reflections, to locate emission sources in an unknown environment, are rarely studied in the literature. In our study, we propose a new location method that uses a fixed receiver measuring the Angle of Arrival (AOA) and Time Difference of Arrival (TDOA). In practice, an assignment problem must be solved before locating the emitters and reflectors. The problem is to assign each pair of TDOA-AOA measurements to a given reflector, assuming that each pair has already been assigned to a transmitter. The method developed has been tested and evaluated by using simulated data and real measurements

L’objectif de la thèse est de proposer une modélisation des comportements résidentiels des ménages : le choix de changement de résidence (ou de déménagement) et le choix d’une nouvelle localisation. Ce type de modèles vise à prévoir la probabilité qu’un ménage change de résidence et son choix en matière de nouvelle localisation, en fonction d’un certain nombre de variables explicatives. Dans notre cas, la modélisation est fondée sur la théorie des choix discrets (approche de l’utilité aléatoire). La recherche s’appuie sur le cas lyonnais, le modèle étant construit sur l’aire urbaine de Lyon, sur des données de l’année 1999. En termes de résultats, du côté de la mobilité résidentielle, il faut retenir que les variables qui expliquent la variation du degré de mobilité (du taux de déménagement) des ménages sont l’âge de la personne de référence du ménage, le nombre d’enfants et le statut d’occupation du logement. En ce qui concerne la localisation des ménages, les préférences des ménages pour une zone ou autre sont liées aux caractéristiques de celles-ci et notamment à l’accessibilité aux différentes opportunités et services, ce qui confirme que parmi les facteurs qui influencent le comportement de localisation des ménages on retrouve les accessibilités, et donc, l’hypothèse de l’existence d’un lien entre transports et urbanisme. On a également trouvé que les caractéristiques des ménages comme l’âge de la personne de référence, le revenu ou le nombre de personnes ont une influence sur leurs choix de localisation. L’étude et les résultats des modèles suggèrent que des améliorations et nouvelles pistes de recherche sont possibles. Ainsi, du côté de la mobilité résidentielle, il pourrait y avoir d’autres variables qui motivent les ménages à changer de logement, comme des caractéristiques des logements, de l’environnement résidentiel ou d’autres caractéristiques des ménages non observées. Il serait aussi intéressant d’estimer le modèle de localisation a un niveau géographique encore plus fin (à l’îlot). D’autres alternatives de modélisation des décisions résidentielles des ménages seraient de modéliser une structure hiérarchisée des choix, par un modèle logit hiérarchique ou emboîté, ou bien de modéliser la trajectoire de vie, avec ses composantes familiale, résidentielle et professionnelle, qui sont en interdépendance (à condition de la disponibilité des données nécessaires)<br>The objective of the thesis is to propose a modeling of the residential behaviors of the households: the choice of change of residence (or removal), and the choice of the new location. This type of models aims at envisaging the probability that a household changes residence and its choice of new location, according to a certain number of explanatory variables. In our case, modeling is founded on the discrete choice theory (random utility approach). Research is based on the Lyons case, the model being built on the urban area of Lyon, on data of the year 1999. In terms of results, side of residential mobility, it should be retained that the variables which explain the variation of the degree of mobility (of the rate of removal) of the households are the age of head, the number of children and the statute of occupation of housing. With regard to the households location, the preferences of the households for a zone are related on the characteristics of those and particularly to accessibility on various opportunities and services, which confirms that among the factors which influence the location behavior of the households one finds accessibilities, and thus, the assumption of the existence of a relation between transport and land use. It was also found that the characteristics of the households like age of head, income or household size have an influence on their location choices. The study and the results of the models suggest that improvements and new directions of research are possible. Thus, on the side of residential mobility, there could be other variables which justify the housing change, like characteristics of the residence, residential environment or other characteristics of the households not observed. It would be also interesting to estimate the location model at a finer geographical level (îlot). Other alternatives of modeling of the residential decisions of the households would be to model a hierarchical structure of the choices, by a hierarchical or nested logit, or to model the life cycle, whit its components family, residential and professional, which are in interdependence (in condition of availability of necessary data)

Cette thèse, portant sur le choix de localisation résidentielle des ménages, s’inscrit dans le cadre théorique de la microéconomie urbaine et de l’utilité aléatoire. Si l’approche des choix discrets reste la plus appropriée dans ce domaine, la difficulté réside dans l’adaptation de ce type de modèles au contexte spatial (autocorrélation spatiale, grand nombre d’alternatives de choix) d’une part, et dans la manière de définir l’échelle de désagrégation d’autre part. Pour ce faire, nous avons procédé en deux temps. Nous avons estimé un logit multinomial avec un échantillon aléatoire d’alternatives pour comprendre le processus de choix de localisation résidentielle, avant de tester l’apport d’une structure hiérarchique pour traiter les problèmes d’autocorrélation spatiale. Cela a aussi permis l’investigation d’une nouvelle méthode de correction des biais liés à l’échantillonnage d’alternatives dans le cas du modèle logit emboîté. En termes de résultats, nous avons montré que la qualité de l’environnement social est le facteur le plus déterminant, sans remettre en cause le poids toujours important de l’accessibilité à l’emploi. Au plan méthodologique, nous avons été en mesure de tester l’apport de l’utilisation d’un modèle logit emboîté pour analyser les choix de localisation de l’aire urbaine de Lyon. Cependant, nous n’avons pas pu dépasser la difficulté de séparer l’autocorrélation spatiale et entre les nids. Le calage du modèle de choix de localisation en 1999 et en 2007 a aussi permis de donner des éléments de réponse sur la transférabilité temporelle des modèles de choix de localisation et de questionner, dans les travaux futurs, le pouvoir prédictif d’un modèle de choix de localisation<br>This thesis, focusing on the choice of residential location, is based on the theoretical framework of urban micro-economy and random utility. Though discrete choice modelling is the most appropriate in this field, the difficulty lies in choosing the appropriate model to the spatial context of residential location choice (spatial autocorrelation, large number of alternatives), on the one hand, and in the way of defining the spatial scale, on the other hand. For this purpose, we proceeded in two stages. We estimated a multinomial logit with random sampling of alternatives to understand the process of residential location choice before taking into account the spatial autocorrelation, and estimating a nested logit model. It also allowed to investigate the feasibility of applying a new method to correct biases of sampling alternatives in the case of nested logit model. In terms of results, we have shown that social environment are the most important determinants of residential location choice. Though job accessibility still weigh on household choice decision. In terms of methodology, we were able to test the feasibility of estimating a nested logit model with sampling of alternatives to analyze the choice of location of Lyon urban area. However, we could not overcome the difficulty of distinguishing spatial autocorrelation from nesting. The use of 1999 and 2007 databases to model residential location choice also helped to provide answers on the temporal transferability of location choice models and discuss in future work the predictive power of a location choice model

In this thesis, by being motivated from the challenges in perinatal networks, we address design, evaluation and flow control of a stochastic healthcare network where there exist multiple levels of hospitals and different types of patients. Patients are supposed urgent; thus they can be rejected and overflow to another facility in the same network if no service capacity is available at their arrival. Rejection of patients due to the lack of service capacity is the common phenomenon in overflow networks. We approach the problem from both strategic and operational perspectives. In strategic part, we address a location & capacity planning problem for adjusting the network to better meet demographic changes. In operational part, we study the optimal patient admission control policies to increase flexibility in allocation of resources and improve the control of patient flow in the network. Finally, in order to evaluate the performance of the network, we develop new approximation methodologies that estimate the rejection probabilities in each hospital for each arriving patient group, thus the overflow probabilities among hospitals. Furthermore, an agent-based discrete-event simulation model is constructed to adequately represent our main applicationarea: Nord Hauts-de-Seine Perinatal Network. The simulation model is used to evaluate the performance of the complex network and more importantly evaluate the strength of the optimal results of our analytical models. The developed methodologies in this thesis are combined in a decision support tool, foreseen under the project "COVER", which aims to assist health system managers to effectively plan strategic and operational decisions of a healthcare network and evaluate the performance of their decisions.

碩士<br>國立中央大學<br>土木工程學系<br>84<br>In urban areas of Taiwan, land price per square meter for retailing stores could be as high as 200 thousand NT dollars, about a half of annual personal income per capita in Taiwan area. In combination with consumption pattern characterized by mixed land uses, the high land values push operation of western fast-food chain-stores switch their major business to non-store retailing . In the research , our attempt is to formulate discrete location model to evaluate the aforementioned non-store retailer with the objective of maximizing profit. Site selection for Pizza delivery store is the case for empirical study. To assist a decision-maker to make decision, GIS is employed to manage data and display spatial result.To the proposed discrete location model, Lagrangian Relaxation with Subgradient Method and Genetic Algorithm(GA) are chosen to solve. The former can converge to optimal solution in any small cases; on the other hand, the latter can converge to optimal solution not in all selected small cases. Empirical penalty functions are tested to simulate the constraints in the GA formulation and assist the model to approach optimality. However, the Lagrangian Relaxation with Subgradient Method converges very slowly in case that total number of facilities increase. GA, on the contrary, converges satisfactorily.

碩士<br>國立臺灣大學<br>土木工程學研究所<br>107<br>In recent years, along with raising environmental consciousness, an innovative transportation mode—electric vehicles have gotten many attentions. Because the power source of electric vehicles is electric power, a renewable and environmentally friendly energy, worldwide countries have been devoted to the popularization of electric vehicles and Taiwan is no exception. However, there are two principal challenges for the penetration of electric vehicles: the limited endurance of the mode and its expensive batteries. The limited endurance lets the user has to refuel the energy during a certain using period and the problem of range anxiety comes out. Hence, an auxiliary equipment—the refueling facility is necessary for electric vehicles and it is essential to locate the charger appropriately. Actually, there already are many types of refueling methods and one of the innovative and promising ways is the swapping system. The swapping system reduces the entire refueling time from original several hours to a few minutes or even seconds. This user-friendly advantage lets the user conducts the refueling on the road become much more possible but on the other side, this benefit also increases the need for spare batteries. Therefore, not only the location but also the capacity of swapping stations has to be cautiously determined by the operator. Nevertheless, it is thorny to decide where and how big the swapping station should be directly, so the purpose of this research is to develop a model for deploying the refueling facilities of the swapping system. In addition, because the most popularized transportation mode in Taiwan is scooters, the research object of this study is electric scooters. In order to enhance the applicability of the model and depict the usage behavior conveniently, the methodology adopted in this study combines the genetic algorithm and the discrete-event simulation forming a two-stage planning. In addition, considering the usage habits of the swapping system, the notion of flow interception is adopted in the model. After the sensitivity analysis of experiments, it is found that different parameters have diverse impacts on different shapes of demand spatial distribution. Regular spatial distribution is much more sensitive to the budget and the irregular one is sensitive to the power consumption rate of batteries. Noteworthily, a factor significantly influencing both the shape of demand distribution is the driving endurance. With the case study in the reality, some setting instructions for such a location problem have been obtained. The operator who is going to plan a layout for swapping stations should adopt the entire traffic “flow” rather than the traffic “zone”. Besides, the operator should give a locating priority to the station where is near heavy traffic flows regardless of the shape of demand distributions. Further, considering the user’s maximum tolerable driving distance for swapping, the operator should radially deploy the station taking origins and destinations as the center. Many important factors are considered in the model such as the demand uncertainty, driving endurance, the tolerance of the user, usage behavior and the varied charging power levels by charging time. This is the first time that a model takes these significant factors into account at the same time. What’s more, after the experiments and the case study, the utility and validity of the model are exhibited and these results also show the importance of considering usage behavior. Thus, this model can be a useful tool to help the operator to decide a proper deployment of swapping stations for electric scooters.

碩士<br>國立臺灣科技大學<br>工業管理系<br>107<br>The location-routing problem (LRP) is an emerging area in logistics research which combines two well-known distribution planning tasks: facility location problem (FLP) and vehicle routing problem (VRP). The main goal of planning a distribution network is to obtain a minimum systemwide cost, which resembles companies’ economical objective. However, in order to achieve a more sustainable future, nowadays companies have to start to give attention to the sustainability issue, such as providing workload balance for their employees and producing less emission from their operational activities. The challenge arises because sustainability issue is potentially conflicting with companies’ economical objective. Therefore, an effort has to be made to find the optimal solution. Our literature review finds only limited works in LRP which have already addressed sustainability issue comprehensively. Thus, this study intends to present a multi-objective sustainable LRP to address this issue. The proposed model considers three objective functions: (1) to minimize the total cost associated with facility, vehicle, and distribution, (2) to balance the workload in distribution activities, and (3) to minimize CO2 emission from transportation activities. The main purposes of this model are to obtain the optimal location of distribution centers, a number of vehicles established, and delivery routes which satisfy all of these three objectives. In order to solve the model, this study implements a novel metaheuristic for multi-objective routing problem, namely the multi-objective sine-cosine algorithm (MOSCA). The algorithm is modified with a simple discretization technique to deal with discrete search space. Then, the performance of the proposed algorithm is evaluated with several test instances and applied to solve a real world case study in Daerah Istimewa Yogyakarta, Indonesia. The results are compared to three classical metaheuristics, namely non-dominated sorting genetic algorithm-II (NSGA-II), multi-objective particle swarm optimization (MOPSO), and Pareto archived evolution strategy (PAES). The experimental results indicate that, based on five comparison metrics, MOSCA performs better than the other algorithms.

<p>In the first chapter of this dissertation, I outline a hedonic equilibrium model that explicitly controls for moving costs and forward-looking behavior. Hedonic equilibrium models allow researchers to recover willingness to pay for spatially delineated amenities by using the notion that individuals "vote with their feet." However, the hedonic literature and, more recently, the estimable Tiebout sorting model literature, has largely ignored both the costs associated with migration (financial and psychological), as well as the forward-looking behavior that individuals exercise in making location decisions. Each of these omissions could lead to biased estimates of willingness to pay. Building upon dynamic migration models from the labor literature, I estimate a fully dynamic model of individual migration at the national level. By employing a two-step estimation routine, I avoid the computational burden associated with the full recursive solution and can then include a richly-specified, realistic state space. With this model, I am able to perform non-market valuation exercises and learn about the spatial determinants of labor market outcomes in a dynamic setting. Including dynamics has a significant positive impact on the estimates of willingness to pay for air quality. In addition, I find that location-specific amenity values can explain important trends in observed migration patterns in the United States.</p><p>The second chapter of this dissertation describes a model which estimates willingness to pay for air quality using property value hedonics techniques. Since Rosen's seminal 1974 paper, property value hedonics has become commonplace in the non-market valuation of environmental amenities, despite a number of well-known methodological problems. In particular, recovery of the marginal willingness to pay function suffers from important endogeneity biases that are difficult to correct with instrumental variables procedures [Epple (1987)]. Bajari and Benkard (2005) propose a "preference inversion" procedure for recovering heterogeneous measures of marginal willingness to pay that avoids these problems. However, using cross-sectional data, their approach imposes unrealistic constraints on the elasticity of marginal willingness to pay. Following Bajari and Benkard's suggestion, I show how data describing repeat purchase decisions by individual home buyers can be used to relax these constraints. Using data on ozone pollution in the Bay Area of California, I find that endogeneity bias and flexibility in the shape of the marginal willingness to pay function are both important.</p><p>Finally, in the third chapter of this dissertation, I combine the insights of the Bajari-Benkard inversion approach employed in second chapter with more standard estimation techniques (i.e., Rosen (1974)) to arrive at a new hedonic methodology that allows for flexible and heterogeneous preferences while avoiding the endogeneity problems that plague the traditional Rosen two-stage model. Implementing this estimator using the Bay Area ozone data, I again find evidence of considerable heterogeneity and of endogeneity bias. In particular, I find that a one unit deterioration in air quality (measured in days in which ozone levels exceed the state standards) raises marginal willingness to pay by $145.18 per year. The canonical two-stage Rosen model finds, counter-intuitively, that this same change would reduce marginal willingness to pay by $94.24.</p><br>Dissertation

The current development of consumer electronics, driven by the effort to manufacture smaller products with increased performance, has amplified the chance for inducing higher thermal stresses to these systems. In an effort to devise more effective cooling methods for these systems, many scholars have studied the convective cooling of discrete heating elements. This report discusses a methodology for fabricating and testing a suitable flat plate design with discrete heating elements for both natural and forced convection cooling experiments. There were two plate design attempts: (i) an aluminum plate and (ii) a R3315 hydrostatic-resistance plastic foam plate. For the purpose of conducting experiments for the discrete heating elements, the foam plate design was found to be an appropriate design. After designing a proper foam plate, several experiments were conducted for the natural convection case. The combination of parameters such as the geometric location and power output ratio between heaters that resulted in the maximum thermal conductance were studied.<br>text

La programmation linéaire en nombres entiers est une approche robuste qui permet de résoudre rapidement de grandes instances de problèmes d'optimisation discrète. Toutefois, les problèmes gagnent constamment en complexité et imposent parfois de fortes limites sur le temps de calcul. Il devient alors nécessaire de développer des méthodes spécialisées afin de résoudre approximativement ces problèmes, tout en calculant des bornes sur leurs valeurs optimales afin de prouver la qualité des solutions obtenues. Nous proposons d'explorer une approche de reformulation en nombres entiers guidée par la relaxation lagrangienne. Après l'identification d'une forte relaxation lagrangienne, un processus systématique permet d'obtenir une seconde formulation en nombres entiers. Cette reformulation, plus compacte que celle de Dantzig et Wolfe, comporte exactement les mêmes solutions entières que la formulation initiale, mais en améliore la borne linéaire: elle devient égale à la borne lagrangienne. L'approche de reformulation permet d'unifier et de généraliser des formulations et des méthodes de borne connues. De plus, elle offre une manière simple d'obtenir des reformulations de moins grandes tailles en contrepartie de bornes plus faibles. Ces reformulations demeurent de grandes tailles. C'est pourquoi nous décrivons aussi des méthodes spécialisées pour en résoudre les relaxations linéaires. Finalement, nous appliquons l'approche de reformulation à deux problèmes de localisation. Cela nous mène à de nouvelles formulations pour ces problèmes; certaines sont de très grandes tailles, mais nos méthodes de résolution spécialisées les rendent pratiques.<br>Integer linear programming is a robust and efficient approach to solve large-scale instances of combinatorial problems. However, problems constantly gain in complexity and sometimes impose strong constraints on computation times. We must then develop specialised methods to compute heuristic primal solutions to the problem and derive lower bounds on the optimal value, and thus prove the quality of our primal solutions. We propose to guide a reformulation approach for mixed integer programs with Lagrangian relaxations. After the identification of a strong relaxation, a mechanical process leads to a second integer formulation. This reformulation is equivalent to the initial one, but its linear relaxation is equivalent to the strong Lagrangian dual. We will show that the reformulation approach unifies and generalises prior formulations and lower bounding approaches, and that it exposes a simple mechanism to reduce the size of reformulations in return for weaker bounds. Nevertheless, our reformulations are large. We address this issue by solving their linear relaxations with specialised methods. Finally, we apply the reformulation approach to two location problems. This yields novel formulations for both problems; some are very large but, thanks to the aforementioned specialised methods, still practical.

Problems in the control and identification of structural dynamic systems can lead to multimodal optimization problems, which are difficult to solve using classical gradient based methods. In this work, optimization problems pertaining to the vibration control of smart structures and the exploration of isospectral systems are addressed. Isospectral vibrating systems have identical natural frequencies, and existence of the isospectral systems proves non-uniqueness in system identification. For the smart structure problem, the optimal location(s) of collocated actuator(s)/sensor(s) and the optimal feedback gain matrix are obtained by maximizing the energy dissipated by the feedback control system. For the isospectral system problem, both discrete and continuous systems are considered. An error function is designed to calculate the error between the spectra of two distinct structural dynamic systems. For the discrete system, the Jacobi matrix, derived from the given system, is modified and the problem is posed as an optimization problem where the objective is to minimize the non-negative error function. Isospectral spring-mass systems are obtained. For the continuous system, finite element modeling is used and an error function is designed to calculate the error between the spectra of the uniform beam and the non-uniform beam. Non-uniform cantilever beams which are isospectral to a given uniform cantilever beam are obtained by minimizing the non-negative error function. Numerical studies reveal several isospectral systems, and optimal gain matrices and sensor/actuator locations for the smart structure. New evolutionary algorithms, which do not need genetic operators such as crossover and mutation, are used for the optimization. These algorithms are: Artificial bee colony (ABC) algorithm, Glowworm swarm optimization (GSO) algorithm, Firefly algorithm (FA) and Electromagnetism inspired optimization (EIO) algorithm.

Problems in the control and identification of structural dynamic systems can lead to multimodal optimization problems, which are difficult to solve using classical gradient based methods. In this work, optimization problems pertaining to the vibration control of smart structures and the exploration of isospectral systems are addressed. Isospectral vibrating systems have identical natural frequencies, and existence of the isospectral systems proves non-uniqueness in system identification. For the smart structure problem, the optimal location(s) of collocated actuator(s)/sensor(s) and the optimal feedback gain matrix are obtained by maximizing the energy dissipated by the feedback control system. For the isospectral system problem, both discrete and continuous systems are considered. An error function is designed to calculate the error between the spectra of two distinct structural dynamic systems. For the discrete system, the Jacobi matrix, derived from the given system, is modified and the problem is posed as an optimization problem where the objective is to minimize the non-negative error function. Isospectral spring-mass systems are obtained. For the continuous system, finite element modeling is used and an error function is designed to calculate the error between the spectra of the uniform beam and the non-uniform beam. Non-uniform cantilever beams which are isospectral to a given uniform cantilever beam are obtained by minimizing the non-negative error function. Numerical studies reveal several isospectral systems, and optimal gain matrices and sensor/actuator locations for the smart structure. New evolutionary algorithms, which do not need genetic operators such as crossover and mutation, are used for the optimization. These algorithms are: Artificial bee colony (ABC) algorithm, Glowworm swarm optimization (GSO) algorithm, Firefly algorithm (FA) and Electromagnetism inspired optimization (EIO) algorithm.