Dissertations / Theses on the topic 'Optimal Transportation'
To see the other types of publications on this topic, follow the link: Optimal Transportation.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Optimal Transportation.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Giddings, Robin Douglas. "Mesh movement via optimal transportation." Thesis, University of Reading, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.515757.
Full text
2
Cavalletti, Fabio. "Optimal transportation in geodesic spaces." Doctoral thesis, SISSA, 2011. http://hdl.handle.net/20.500.11767/4213.
Full text
3
Zhang, Xiaoning. "Optimal road pricing in transportation networks /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?CIVL%202003%20ZHANG.
Full textAbstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.Includes bibliographical references (leaves 230-240). Also available in electronic version. Access restricted to campus users.
4
Figalli, Alessio. "Optimal transportation and action-minimizing measures." Doctoral thesis, Lyon, École normale supérieure (sciences), 2007. http://www.theses.fr/2007ENSL0422.
Full text
5
Figalli, Alessio. "Optimal transportation and action-minimizing measures." Doctoral thesis, Scuola Normale Superiore, 2007. http://hdl.handle.net/11384/85683.
Full text
6
Bonnotte, Nicolas. "Unidimensional and Evolution Methods for Optimal Transportation." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00946781.
Full textAbstract:
In dimension one, optimal transportation is rather straightforward. The easiness with which a solution can be obtained in that setting has recently been used to tackle more general situations, each time thanks to the same method. First, disintegrate your problem to go back to the unidimensional case, and apply the available 1D methods to get a first result; then, improve it gradually using some evolution process.This dissertation explores that direction more thoroughly. Looking back at two problems only partially solved this way, I show how this viewpoint in fact allows to go even further.The first of these two problems concerns the computation of Yann Brenier's optimal map. Guillaume Carlier, Alfred Galichon, and Filippo Santambrogio found a new way to obtain it, thanks to an differential equation for which an initial condition is given by the Knothe--Rosenblatt rearrangement. (The latter is precisely defined by a series of unidimensional transformations.) However, they only dealt with discrete target measures; I~generalize their approach to a continuous setting. By differentiation, the Monge--Ampère equation readily gives a PDE satisfied by the Kantorovich potential; but to get a proper initial condition, it is necessary to use the Nash--Moser version of the implicit function theorem.The basics of optimal transport are recalled in the first chapter, and the Nash--Moser theory is exposed in chapter 2. My results are presented in chapter 3, and numerical experiments in chapter 4.The last chapter deals with the IDT algorithm, devised by François Pitié, Anil C. Kokaram, and Rozenn Dahyot. It builds a transport map that seems close enough to the optimal map for most applications. A complete mathematical understanding of the procedure is, however, still lacking. An interpretation as a gradient flow in the space of probability measures is proposed, with the sliced Wasserstein distance as the functional. I also prove the equivalence between the sliced and usual Wasserstein distances.
7
Nenna, Luca. "Numerical Methods for Multi-Marginal Optimal Transportation." Thesis, Paris Sciences et Lettres (ComUE), 2016. http://www.theses.fr/2016PSLED017/document.
Full textAbstract:
Dans cette thèse, notre but est de donner un cadre numérique général pour approcher les solutions des problèmes du transport optimal (TO). L’idée générale est d’introduire une régularisation entropique du problème initial. Le problème régularisé correspond à minimiser une entropie relative par rapport à une mesure de référence donnée. En effet, cela équivaut à trouver la projection d’un couplage par rapport à la divergence de Kullback-Leibler. Cela nous permet d’utiliser l’algorithme de Bregman/Dykstra et de résoudre plusieurs problèmes variationnels liés au TO. Nous nous intéressons particulièrement à la résolution des problèmes du transport optimal multi-marges (TOMM) qui apparaissent dans le cadre de la dynamique des fluides (équations d’Euler incompressible à la Brenier) et de la physique quantique (la théorie de fonctionnelle de la densité ). Dans ces cas, nous montrons que la régularisation entropique joue un rôle plus important que de la simple stabilisation numérique. De plus, nous donnons des résultats concernant l’existence des transports optimaux (par exemple des transports fractals) pour le problème TOMMIn this thesis we aim at giving a general numerical framework to approximate solutions to optimal transport (OT) problems. The general idea is to introduce an entropic regularization of the initialproblems. The regularized problem corresponds to the minimization of a relative entropy with respect a given reference measure. Indeed, this is equivalent to find the projection of the joint coupling with respect the Kullback-Leibler divergence. This allows us to make use the Bregman/Dykstra’s algorithm and solve several variational problems related to OT. We are especially interested in solving multi-marginal optimal transport problems (MMOT) arising in Physics such as in Fluid Dynamics (e.g. incompressible Euler equations à la Brenier) and in Quantum Physics (e.g. Density Functional Theory). In these cases we show that the entropic regularization plays a more important role than a simple numerical stabilization. Moreover, we also give some important results concerning existence and characterization of optimal transport maps (e.g. fractal maps) for MMOT
8
Jeong, Young-Sik. "Optimal military transportation in a Korean wartime theater." Thesis, Monterey California. Naval Postgraduate School, 2006. http://hdl.handle.net/10945/2439.
Full textAbstract:
Due to their high dependency on highway transportation, Republic of Korea's (ROK's) military and industry suffer from congestion, shortfall of means (convoys in the military case), high cost and increase in environmental damage. Our research develops an optimization model to guide TOK's military planning using multi-modal transportation. We apply our Military Logistics Transportation Model (MLTM) to a realistic scenario. MLTM provides guidance on the optimal frequency of transportation services and the optimal routes for the freight. By comparing the solution of MLTM with current practice for Wartime Transportation Planning (represented by a heuristic method), our MLTM can reduce the transportation cost up to 29%. This is enabled by the activitation of multi-modal transportation and service sharing by multiple demands. We also analyze scenarios in which either sea-port of debarkation (SPOD) where the supply originates has been shut down by enemy attacks. We find that losing Busan SPOD is more damaging than losing Kwangyang SPOD.
9
Lai, Ming Fai. "Optimal assignment of ferry fleet for waterborne transportation /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?CIVL%202002%20LAI.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.Includes bibliographical references (leaves 60-61). Also available in electronic version. Access restricted to campus users.
10
Bardelloni, Mauro. "The decomposition of optimal transportation problems with convex cost." Doctoral thesis, SISSA, 2014. http://hdl.handle.net/20.500.11767/3902.
Full text
11
Caravenna, Laura. "The Disintegration Theorem and Applications to Optimal Mass Transportation." Doctoral thesis, SISSA, 2009. http://hdl.handle.net/20.500.11767/4622.
Full text
12
Wiking, Josefin. "Alternative cost-optimal pathways for the transport sector of Cyprus." Thesis, KTH, Energisystemanalys, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-179032.
Full textAbstract:
This thesis investigates the possible future pathways for the road transportation sector of Cyprus, in a time horizon from the year 2013 to 2040. The road transportation sector of Cyprus is the most energy consuming sector in the country, completely dependent on the use of diesel and gasoline. In order to comply with the renewable energy target for the transportation sector set by the European Union, Cyprus needs to transform its road transportation sector. The software MESSAGE (Model for Energy Supply Strategy Alternatives and their General Environmental Impact) is used to model the road transport sector, consisting of passenger and freight transportation. The results of the modelling provides insights into the most cost-effective pathways for Cyprus in the future. In addition to the reference scenario, four different scenarios are examined. These scenarios are focusing on different relevant aspects for Cyprus which are renewable energy, natural gas, public transport and hydrogen. The results of the study indicate that the total numbers of petroleum fueled vehicles will increase in the future, and the freight transport will be particularly difficult to transform. For the passenger transport, there will be a fuel switch from gasoline to diesel, since diesel is less expensive than gasoline. There are possibilities for increasing the numbers of alternative low-carbon emitting vehicle technologies in Cyprus. For the passenger transport, the most cost-effective low-carbon vehicle technologies are hybrid diesel electric cars, plug-in hybrid diesel electric cars and hybrid electric diesel buses. For the freight transport, the most cost-effective low-carbon vehicle technologies are natural gas heavy trycks and electric light trucks. Lastly, the results of the study indicate that it will not be possible for Cyprus to reach the renewable energy target for the transportation sector. The country has to investigate in taxation schemes for increasing the numbers of alternative vehicles as well as increasing the blends of biofuels into gasoline and diesel.
13
Wan, Kam Hung. "Optimal integrated transit network design /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?CIVL%202002%20WAN.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.Includes bibliographical references (leaves 92-95). Also available in electronic version. Access restricted to campus users.
14
Georgiadis, Vasilis. "Optimal capital structure of deep sea foreign freight transportation companies." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/90803.
Full textAbstract:
Thesis: S.M. in Engineering and Management, Massachusetts Institute of Technology, Engineering Systems Division, System Design and Management Program, 2014.Cataloged from PDF version of thesis.
Includes bibliographical references (page 46).
This thesis aims to understand the optimal leverage range for shipping companies (maritime foreign freight transportation companies - SIC 4412), through data analysis. This study confirms that in a traditional industry like shipping, the Market value-leverage curve is very similar to the theoretical curve, as proposed by traditional capital structure theories. In comparison to other industries, the trend shows that there is allowance for more debt in shipping, since the optimal capital structure is reached in relatively higher values. Between shipping companies, the study shows that the most definitive factor in determining the optimal leverage is the company type (type of ships owned), and somewhat the year range the company operated. Contrary to other industries, company size does not seem to play a major role in shipping. Data analysis using pure plays (groups of very similar companies) reels trend lines with higher accuracy, indicating the optimal leverage range of certain types of shipping companies. The most consistent result is that for tanker shipping companies, where the optimal leverage range is 65-75%.
by Vasilis Georgiadis.
S.M. in Engineering and Management
15
Edwards, Derek L. "Designing optimal demand-responsive transportation feeder systems and comparing performance in heterogeneous environments." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52230.
Full textAbstract:
The goal of this research is to develop a method of objectively comparing and optimizing the performance of demand-responsive transportation systems in heterogeneous environments. Demand-responsive transportation refers to modes of transportation that do not follow fixed routes or schedules, including taxis, paratransit, deviated-route services, ride sharing as well as other modes. Heterogeneous environments are transportation environments in which streets do not follow regular patterns, passenger behavior is difficult to model, and transit schedules and layouts are non-uniform. An example of a typical heterogeneous environment is a modern suburb with non-linear streets, low pedestrian activity, and infrequent or sparse transit service. The motivation for this research is to determine if demand-responsive transportation can be used to improve customer satisfaction and reduce operating costs in suburban and low-density urban areas where fixed-route transportation may be inefficient.
This research extends existing comparison and optimization techniques that are designed to work in homogeneous environments. Homogeneous environments refer to transportation systems where the streets follow regular and repeating patterns, passengers are evenly distributed throughout the system, and the transit system is easily modeled. The performance of systems with these characteristics can be approximated with closed-form analytical expressions representing passenger travel times, vehicle distances traveled, and other performance indicators. However, in the low-density urban areas studied in this research, the street patterns and transit schedules are irregular and passenger behavior is difficult to model. In these areas, analytical solutions cannot be found. Instead, this research develops a simulation-based approach to compare and optimize performance in these heterogeneous environments. Using widely-available route-planning tools, open-source transit schedules, and detailed passenger data, it is possible to simulate the behavior of transit vehicles and passengers to such an exacting degree that analytical solutions are not needed.
A major technical contribution of this research is the development of a demand-responsive transportation simulator to analyze performance of demand-responsive systems in heterogeneous environments. The simulator combines several open-source tools for route planning with a custom-built demand-responsive vehicle and passenger-itinerary optimizer to simulate individual vehicles and passengers within a large system. With knowledge of the street network, the transit schedule, passenger locations, and trip request times, the simulator will output exact passenger transit times, passenger travel distances, vehicle travel distance, and other performance indicators for a particular transportation setup in a given area.
The simulator is used to develop a method of comparing various demand-responsive and fixed-route systems. By predefining a set of performance indicators, such as passenger travel time and operating cost, the simulator can be used to ascertain the performance of a wide array of transportation systems. Comparing the weighted cost of each type of system permits a transportation engineer or planner to determine what type of system will provide the best results in a given area.
The simulator is extended to assist in optimization of the demand-responsive transportation system layout. A key problem that needs to be solved when implementing a demand-responsive system is to determine the size, shape, and location of the demand-responsive coverage areas, i.e., the areas in which passengers are eligible for demand-responsive transportation. Using a particle swarm optimization algorithm and the simulation-based comparison technique, the optimal size and shape for a demand-responsive coverage area can be determined.
The efficacy of the comparison and optimization techniques is demonstrated within the city of Atlanta, GA. It is shown that for certain areas of the city of Atlanta, demand-responsive transportation is more efficient than the currently implemented fixed-route system. Depending on the objective of the transportation planner, passenger satisfaction as well as operating costs can be improved by implementing a demand-responsive system in certain low-density areas.
The techniques introduced in this research, and the simulation tool developed to implement those techniques, provide a repeatable, accurate, and objective method with which to optimize and compare demand-responsive transportation systems in heterogeneous environments.
16
Antos, Justin David. "Paying for public transportation : the optimal, the actual, and the possible." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40101.
Full textAbstract:
Thesis (M.C.P.)--Massachusetts Institute of Technology, Dept. of Urban Studies and Planning, 2007.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
:June 2007."
Includes bibliographical references (p. 110-121).
Passenger transportation poses challenges to American cities in the form of air pollution, traffic congestion, auto collisions, and barriers to mobility. Public transit has the potential to be part of a solution to these urban problems, yet transit agencies across the country clamor for more resources. Transit finance in the U.S. is heterogeneous, and rarely approached with a comprehensive view of transit's social benefits. This thesis suggests a framework for a more rational magnitude and incidence of public transit funding based on a more comprehensive view of transit's social benefits. I take up the case of the Chicago metropolitan region and quantify the transit system's major emissions, safety, congestion, and mobility benefits. Next, I survey and highlight current practices in transit finance from other cities in North America and Western Europe. Finally, I assess the size, structure, and distribution of burden of Chicago's current transit funding status quo against theoretical and practical principles of transit funding and offer a range of financing alternatives to solve the current fiscal crisis in Chicago.
(cont.) I find evidence that the social benefits of public transportation in Chicago outweigh its costs, suggesting that preserving transit services there is justifiable. Transit's benefits accrue to a variety of jurisdictions in diverse and measurable ways which the current funding structure does not approximate. I find evidence that of the multiple beneficiaries of transit in the region, the subsidy structure in Chicago disproportionately benefits auto drivers who receive significantly more congestion benefits than they pay for. Last, I propose several policy options to increase public subsidy to transit in Chicago, and suggest that one particularly theoretically appealing alternative may be to establish tolls on existing roadways.
by Justin David Antos.
M.C.P.
17
Çelikbilek, Can. "Determining the Optimal Transportation Method in Due-Date Driven Manufacturing Environments." Ohio University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1312312985.
Full text
18
Dong, Wenjie. "Self-organizing and optimal control for nonlinear systems." Diss., [Riverside, Calif.] : University of California, Riverside, 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3359894.
Full textAbstract:
Thesis (Ph. D.)--University of California, Riverside, 2009.Includes abstract. Title from first page of PDF file (viewed January 27, 2010). Includes bibliographical references (p. 82-87). Issued in print and online. Available via ProQuest Digital Dissertations.
19
Tan, Xiaolu. "Stochastic control methods for optimal transportation and probabilistic numerical schemes for PDEs." Palaiseau, Ecole polytechnique, 2011. https://theses.hal.science/docs/00/66/10/86/PDF/These_TanXiaolu.pdf.
Full textAbstract:
Cette thèse porte sur les méthodes numériques pour les équations aux dérivées partielles (EDP) non-linéaires dégénérées, ainsi que pour des problèmes de contrôle d'EDP non-linéaires résultants d'un nouveau problème de transport optimal. Toutes ces questions sont motivées par des applications en mathématiques financières. La thèse est divisée en quatre parties. Dans une première partie, nous nous intéressons à la condition nécessaire et suffisante de la monotonie du thêta-schéma de différences finies pour l'équation de diffusion en dimension un. Nous donnons la formule explicite dans le cas de l'équation de la chaleur, qui est plus faible que la condition classique de Courant-Friedrichs-Lewy (CFL). Dans une seconde partie, nous considérons une EDP parabolique non-linéaire dégénérée et proposons un schéma de type ''splitting'' pour la résoudre. Ce schéma réunit un schéma probabiliste et un schéma semi-lagrangien. Au final, il peut être considéré comme un schéma Monte-Carlo. Nous donnons un résultat de convergence et également un taux de convergence du schéma. Dans une troisième partie, nous étudions un problème de transport optimal, où la masse est transportée par un processus d'état type ''drift-diffusion'' controllé. Le coût associé est dépendant des trajectoires de processus d'état, de son drift et de son coefficient de diffusion. Le problème de transport consiste à minimiser le coût parmi toutes les dynamiques vérifiant les contraintes initiales et terminales sur les distributions marginales. Nous prouvons une formule de dualité pour ce problème de transport, étendant ainsi la dualité de Kantorovich à notre contexte. La formulation duale maximise une fonction valeur sur l'espace des fonctions continues bornées, et la fonction valeur correspondante à chaque fonction continue bornée est la solution d'un problème de contrôle stochastique optimal. Dans le cas markovien, nous prouvons un principe de programmation dynamique pour ces problèmes de contrôle optimal, proposons un algorithme de gradient projeté pour la résolution numérique du problème dual, et en démontrons la convergence. Enfin dans une quatrième partie, nous continuons à développer l'approche duale pour le problème de transport optimal avec une application à la recherche de bornes de prix sans arbitrage des options sur variance étant donnés les prix des options européennes. Après une première approximation analytique, nous proposons un algorithme de gradient projeté pour approcher la borne et la stratégie statique correspondante en options vanillesThis thesis deals with the numerical methods for a fully nonlinear degenerate parabolic partial differential equations (PDEs), and for a controlled nonlinear PDEs problem which results from a mass transportation problem. The manuscript is divided into four parts. In a first part of the thesis, we are interested in the necessary and sufficient condition of the monotonicity of finite difference thêta-scheme for a one-dimensional diffusion equations. An explicit formula is given in case of the heat equation, which is weaker than the classical Courant-Friedrichs-Lewy (CFL) condition. In a second part, we consider a fully nonlinear degenerate parabolic PDE and propose a splitting scheme for its numerical resolution. The splitting scheme combines a probabilistic scheme and the semi-Lagrangian scheme, and in total, it can be viewed as a Monte-Carlo scheme for PDEs. We provide a convergence result as well as a rate of convergence. In the third part of the thesis, we study an optimal mass transportation problem. The mass is transported by the controlled drift-diffusion dynamics, and the associated cost depends on the trajectories, the drift as well as the diffusion coefficient of the dynamics. We prove a strong duality result for the transportation problem, thus extending the Kantorovich duality to our context. The dual formulation maximizes a value function on the space of all bounded continuous functions, and every value function corresponding to a bounded continuous function is the solution to a stochastic control problem. In the Markovian cases, we prove the dynamic programming principle of the optimal control problems, and we propose a gradient-projection algorithm for the numerical resolution of the dual problem, and provide a convergence result. Finally, in a fourth part, we continue to develop the dual approach of mass transportation problem with its applications in the computation of the model-independent no-arbitrage price bound of the variance option in a vanilla-liquid market. After a first analytic approximation, we propose a gradient-projection algorithm to approximate the bound as well as the corresponding static strategy in vanilla options
20
Wang, Hao. "The Hot Optimal Transportation Meshfree (HOTM) Method for Extreme Multi-physics Problems." Case Western Reserve University School of Graduate Studies / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case1607533458323004.
Full text
21
Abou-Senna, Hatem. "Microscopic Assessment of Transportation Emissions on Limited Access Highways." Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5090.
Full textAbstract:
On-road vehicles are a major source of transportation carbon dioxide (CO2) greenhouse gas emissions in all the developed countries, and in many of the developing countries in the world. Similarly, several criteria air pollutants are associated with transportation, e.g., carbon monoxide (CO), nitrogen oxides (NOx), and particulate matter (PM). The need to accurately quantify transportation-related emissions from vehicles is essential. Transportation agencies and researchers in the past have estimated emissions using one average speed and volume on a long stretch of roadway. With MOVES, there is an opportunity for higher precision and accuracy. Integrating a microscopic traffic simulation model (such as VISSIM) with MOVES allows one to obtain precise and accurate emissions estimates. The new United States Environmental Protection Agency (USEPA) mobile source emissions model, MOVES2010a (MOVES) can estimate vehicle emissions on a second-by-second basis creating the opportunity to develop new software “VIMIS 1.0” (VISSIM/MOVES Integration Software) to facilitate the integration process. This research presents a microscopic examination of five key transportation parameters (traffic volume, speed, truck percentage, road grade and temperature) on a 10-mile stretch of Interstate 4 (I-4) test bed prototype; an urban limited access highway corridor in Orlando, Florida. The analysis was conducted utilizing VIMIS 1.0 and using an advanced custom design technique; D-Optimality and I-Optimality criteria, to identify active factors and to ensure precision in estimating the regression coefficients as well as the response variable. The analysis of the experiment identified the optimal settings of the key factors and resulted in the development of Micro-TEM (Microscopic Transportation Emissions Meta-Model). The main purpose of Micro-TEM is to serve as a substitute model for predicting transportation emissions on limited access highways to an acceptable degree of accuracy in lieu of running simulations using a traffic model and integrating the results in an emissions model. Furthermore, significant emission rate reductions were observed from the experiment on the modeled corridor especially for speeds between 55 and 60 mph while maintaining up to 80% and 90% of the freeway's capacity. However, vehicle activity characterization in terms of speed was shown to have a significant impact on the emission estimation approach. Four different approaches were further examined to capture the environmental impacts of vehicular operations on the modeled test bed prototype. First, (at the most basic level), emissions were estimated for the entire 10-mile section “by hand” using one average traffic volume and average speed. Then, three advanced levels of detail were studied using VISSIM/MOVES to analyze smaller links: average speeds and volumes (AVG), second-by-second link driving schedules (LDS), and second-by-second operating mode distributions (OPMODE). This research analyzed how the various approaches affect predicted emissions of CO, NOx, PM and CO2. The results demonstrated that obtaining accurate and comprehensive operating mode distributions on a second-by-second basis improves emission estimates. Specifically, emission rates were found to be highly sensitive to stop-and-go traffic and the associated driving cycles of acceleration, deceleration, frequent braking/coasting and idling. Using the AVG or LDS approach may overestimate or underestimate emissions, respectively, compared to an operating mode distribution approach. Additionally, model applications and mitigation scenarios were examined on the modeled corridor to evaluate the environmental impacts in terms of vehicular emissions and at the same time validate the developed model “Micro-TEM”. Mitigation scenarios included the future implementation of managed lanes (ML) along with the general use lanes (GUL) on the I-4 corridor, the currently implemented variable speed limits (VSL) scenario as well as a hypothetical restricted truck lane (RTL) scenario. Results of the mitigation scenarios showed an overall speed improvement on the corridor which resulted in overall reduction in emissions and emission rates when compared to the existing condition (EX) scenario and specifically on link by link basis for the RTL scenario. The proposed emission rate estimation process also can be extended to gridded emissions for ozone modeling, or to localized air quality dispersion modeling, where temporal and spatial resolution of emissions is essential to predict the concentration of pollutants near roadways.ID: 031988296; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (Ph.D.)--University of Central Florida, 2012.; Includes bibliographical references.
Ph.D.
Doctorate
Civil, Environmental and Construction Engineering
Engineering and Computer Science
Civil Engineering
22
Uraz, Emre. "Offshore Wind Turbine Transportation & Installation Analyses Planning Optimal Marine Operations for Offshore Wind Projects." Thesis, Högskolan på Gotland, Institutionen för kultur, energi och miljö, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-217007.
Full textAbstract:
Transportation and installation of offshore wind turbines (Tower, Nacelle and Rotor) is a complete process conducted over several phases, usually in sequence. There are several factors that can turn this process into a challenge. These factors can either be due to offshore site conditions or the technical limitations of the installation vessels. Each project has its own characteristic parameters and requires a unique optimum solution. This paper identifies the dynamics of the installation process and analyzes the effects of each phase on the progression of events.The challenges in wind turbine installations due to offshore environment were investigated, the effects of each were explained and their significances were stressed. Special installation vessels were examined and their technical specifications were analyzed in terms of working conditions, dimensions, service performances, and crane capacities as well as projecting future design trends. Several offshore wind farm projects were analyzed; their installation methods were specified, and compared to each other to determine advantages and disadvantages of different pre-assembly concepts. The durations of the sub-phases of the process were defined in terms of different variables such as site conditions and individual vessel performance. These definitions were used for making time estimations, and conducting further analyses regarding the effects of different site specific parameters on the overall project duration.In conclusion, this study considered the main operation parameters in an offshore wind turbine installation context: the benefits and drawbacks of different pre-assembly methods were researched and evaluated resulting in new knowledge and a productive contribution for optimizing “the offshore turbine transportation and installation process”, based on actual time usage.
23
Santhanam, Ramesh T. "An inventory model with two truckload transportation and quantity discounts." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001349.
Full text
24
Guo, Gaoyue. "Continuous-time Martingale Optimal Transport and Optimal Skorokhod Embedding." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX038/document.
Full textAbstract:
Cette thèse présente trois principaux sujets de recherche, les deux premiers étant indépendants et le dernier indiquant la relation des deux premières problématiques dans un cas concret.Dans la première partie nous nous intéressons au problème de transport optimal martingale dans l’espace de Skorokhod, dont le premier but est d’étudier systématiquement la tension des plans de transport martingale. On s’intéresse tout d’abord à la semicontinuité supérieure du problème primal par rapport aux distributions marginales. En utilisant la S-topologie introduite par Jakubowski, on dérive la semicontinuité supérieure et on montre la première dualité. Nous donnons en outre deux problèmes duaux concernant la surcouverture robuste d’une option exotique, et nous établissons les dualités correspondantes, en adaptant le principe de la programmation dynamique et l’argument de discrétisation initie par Dolinsky et Soner.La deuxième partie de cette thèse traite le problème du plongement de Skorokhod optimal. On formule tout d’abord ce problème d’optimisation en termes de mesures de probabilité sur un espace élargi et ses problèmes duaux. En utilisant l’approche classique de la dualité; convexe et la théorie d’arrêt optimal, nous obtenons les résultats de dualité. Nous rapportons aussi ces résultats au transport optimal martingale dans l’espace des fonctions continues, d’où les dualités correspondantes sont dérivées pour une classe particulière de fonctions de paiement. Ensuite, on fournit une preuve alternative du principe de monotonie établi par Beiglbock, Cox et Huesmann, qui permet de caractériser les optimiseurs par leur support géométrique. Nous montrons à la fin un résultat de stabilité qui contient deux parties: la stabilité du problème d’optimisation par rapport aux marginales cibles et le lien avec un autre problème du plongement optimal.La dernière partie concerne l’application de contrôle stochastique au transport optimal martingale avec la fonction de paiement dépendant du temps local, et au plongement de Skorokhod. Pour le cas d’une marginale, nous retrouvons les optimiseurs pour les problèmes primaux et duaux via les solutions de Vallois, et montrons en conséquence l’optimalité des solutions de Vallois, ce qui regroupe le transport optimal martingale et le plongement de Skorokhod optimal. Quand au cas de deux marginales, on obtient une généralisation de la solution de Vallois. Enfin, un cas spécial de plusieurs marginales est étudié, où les temps d’arrêt donnés par Vallois sont bien ordonnésThis PhD dissertation presents three research topics, the first two being independent and the last one relating the first two issues in a concrete case.In the first part we focus on the martingale optimal transport problem on the Skorokhod space, which aims at studying systematically the tightness of martingale transport plans. Using the S-topology introduced by Jakubowski, we obtain the desired tightness which yields the upper semicontinuity of the primal problem with respect to the marginal distributions, and further the first duality. Then, we provide also two dual formulations that are related to the robust superhedging in financial mathematics, and we establish the corresponding dualities by adapting the dynamic programming principle and the discretization argument initiated by Dolinsky and Soner.The second part of this dissertation addresses the optimal Skorokhod embedding problem under finitely-many marginal constraints. We formulate first this optimization problem by means of probability measures on an enlarged space as well as its dual problems. Using the classical convex duality approach together with the optimal stopping theory, we obtain the duality results. We also relate these results to the martingale optimal transport on the space of continuous functions, where the corresponding dualities are derived for a special class of reward functions. Next, We provide an alternative proof of the monotonicity principle established in Beiglbock, Cox and Huesmann, which characterizes the optimizers by their geometric support. Finally, we show a stability result that is twofold: the stability of the optimization problem with respect to target marginals and the relation with another optimal embedding problem.The last part concerns the application of stochastic control to the martingale optimal transport with a payoff depending on the local time, and the Skorokhod embedding problem. For the one-marginal case, we recover the optimizers for both primal and dual problems through Vallois' solutions, and show further the optimality of Vallois' solutions, which relates the martingale optimal transport and the optimal Skorokhod embedding. As for the two-marginal case, we obtain a generalization of Vallois' solution. Finally, a special multi-marginal case is studied, where the stopping times given by Vallois are well ordered
25
Lu, Xin Yang. "Geometric and regularity properties of solutions of evolution problems associated to some distance related functionals." Doctoral thesis, Scuola Normale Superiore, 2013. http://hdl.handle.net/11384/85726.
Full text
26
von, Nessi Gregory Thomas, and greg vonnessi@maths anu edu au. "Regularity Results for Potential Functions of the Optimal Transportation Problem on Spheres and Related Hessian Equations." The Australian National University. Mathematical Sciences Institute, 2008. http://thesis.anu.edu.au./public/adt-ANU20081215.120059.
Full textAbstract:
In this thesis, results will be presented that pertain to the global regularity of solutions to boundary value problems having the general form \begin{align} F\left[D^2u-A(\,\cdot\,,u,Du)\right] &= B(\,\cdot\,,u,Du),\quad\text{in}\ \Omega^-,\notag\\ T_u(\Omega^-) &= \Omega^+, \end{align} where $A$, $B$, $T_u$ are all prescribed; and $\Omega^-$ along with $\Omega^+$ are bounded in $\mathbb{R}^n$, smooth and satisfying notions of c-convexity and c^*-convexity relative to one another (see [MTW05] for definitions). In particular, the case where $F$ is a quotient of symmetric functions of the eigenvalues of its argument matrix will be investigated. Ultimately, analogies to the global regularity result presented in [TW06] for the Optimal Transportation Problem to this new fully-nonlinear elliptic boundary value problem will be presented and proven. It will also be shown that the A3w condition (first presented in [MTW05]) is also necessary for global regularity in the case of (1). The core part of this research lies in proving various a priori estimates so that a method of continuity argument can be applied to get the existence of globally smooth solutions. The a priori estimates vary from those presented in [TW06], due to the structure of F, introducing some complications that are not present in the Optimal Transportation case.¶
In the final chapter of this thesis, the A3 condition will be reformulated and analysed on round spheres. The example cost-functions subsequently analysed have already been studied in the Euclidean case within [MTW05] and [TW06]. In this research, a stereographic projection is utilised to reformulate the A3 condition on round spheres for a general class of cost-functions, which are general functions of the geodesic distance as defined relative to the underlying round sphere. With this general expression, the A3 condition can be readily verified for a large class of cost-functions that depend on the metrics of round spheres, which is tantamount (combined with some geometric assumptions on the source and target domains) to the classical regularity for solutions of the Optimal Transportation Problem on round spheres.
27
De, Philippis Guido. "Regularity of optimal transport maps and applications." Doctoral thesis, Scuola Normale Superiore, 2012. http://hdl.handle.net/11384/85688.
Full text
28
Oliveira, Aline Duarte de. "O teorema da dualidade de Kantorovich para o transporte de ótimo." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2011. http://hdl.handle.net/10183/32470.
Full textAbstract:
Abordaremos a teoria do transporte otimo demonstrando o teorema da dualidade de Kantorovich para uma classe ampla de funções custo. Tal resultado desempenha um papel de suma importância na teoria do transporte otimo. Uma ferramenta importante utilizada e o teorema da dualidade de Fenchel-Rockafellar, aqui enunciado e demonstrado em bastante generalidade. Demonstramos tamb em o teorema da dualidade de Kantorovich-Rubinstein, que trata do caso particular da função custo distância.We analyze the optimal transport theory proving the Kantorovich duality theorem for a wide class of cost functions. Such result plays an extremely important role in the optimal transport theory. An important tool used here is the Fenchel-Rockafellar duality theorem, which we state and prove in a general case. We also prove the Kantorovich-Rubinstein duality theorem, which deals with the particular case of cost function given by the distance.
29
Liu, Liang. "Probabilistic Assessment and Optimal Life-Cycle Management Considering Climate Change and Cost-Benefit Analysis: Applications to Bridge Networks and Ships." Thesis, Lehigh University, 2021. http://pqdtopen.proquest.com/#viewpdf?dispub=28156457.
Full textAbstract:
The continuous operation of civil and marine structures is essential for maintaining the flow of people and goods. However, structures are exposed to extreme or progressive events during their service time. The uncertainties associated with the occurrence and the magnitude of extreme events (e.g. flooding and scour) may change, leading to unprecedented loading conditions, while the progressive events (e.g. corrosion and fatigue) may jeopardize the structural capacity to resist loads. In order to maintain or improve the structural capacity, repair and maintenance actions need to be applied to structures. However, the determination of these actions may be challenging for decision makers due to (a) limited financial resources to be allocated for a group of structures, (b) uncertainties associated with current structure conditions and future loading conditions, and (c) various decision-making factors (e.g. reliability threshold, decision time, and risk attitude). In order to address these issues, the focus of the research in this dissertation is to enhance the development of management strategies with the application in (a) management of bridge networks under hydraulic events and climate changes, (b) service life extension of ships considering financial feasibility and decision-making factors, and (c) determination of reliability threshold in the decision-making process. The management of bridge networks involves the quantification of regional hazards imposed on the network, performance assessment of structures, and consequence evaluation of potential bridge failure. Regional hazards such as floods may be affected by the changes in the intensity of precipitation due to anticipated climate changes. These hazards may cause extensive damage to bridges, and failure may cause significant costs to bridge managers and result in inconvenience on the daily traffic commute. This research focuses on enhancing the assessment and management of bridges networks vulnerable to regional hydraulic events and climate changes. The integration of transportation network analysis, which reflects the redistribution of traffic flow in the event of bridge failure, is shown to be essential when determining the risk level of bridges. Furthermore, this work includes proposed methodologies for determining optimal management strategies that account for the connection between global climate predictions and regional hydrologic conditions. The crux of determining management strategies, especially for extending ship service lives, is to ensure an adequate safety margin within and beyond the design life. In addition to the loading effect and structural capacity, the safety margin of ships is related to the deterioration acting on the structure. During ship operation, in-service condition surveys are conducted on ship details to assess structural conditions and to inform maintenance actions. This research focuses on the integration of condition surveys of ship details, as well as the timing of conducting surveys, to improve the service life extension for ship structures. While decision makers strive to maintain the safe operation of ships, they should also identify the management strategy that can deliver the best return given the limited budget. This research, from the perspective of cost-effectiveness and profitability, proposes optimization frameworks to clarify the financially feasible life expectancy of different management strategies as well as identify the optimal duration of extended service life for different categories of commercial ships. The last focus of this research emanates from the reliability threshold when determining management strategies. In addition to facilitating decision-making on the management of civil and marine structures, the reliability threshold in terms of target reliability index has been extensively used in design guidelines to ensure adequate safety margin for structures. The level of safety is typically related to the failure mode and severity of failure consequences (e.g. number of potential fatalities). Driven by the emerging application of unmanned ships where there are fewer or no crew members on board, this research specifically focuses on the integration of different acceptance criteria for human safety into the determination of the target reliability index.
30
Kryvobok, Valeria, Валерія Кривобок, Микита Глущенко, Nikita Hlushchenko, and Huang Chenfan. "Method for calculating the optimal number of loading and uploading points of the airport cargo warehouse." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/51160.
Full textAbstract:
1. Transport terminals: purpose, attributes, functions. URL: https://dsl-ua.com/en/2019/06/24/ru-transportnyie-terminalyi-naznachenie-atributyi-funktsii/
2. Calculation of parameters of service systems for passenger and freight transportation. URL:http://repo.ssau.ru/bitstream/Metodicheskie-materialy/Raschet-parametrov-sistem-obsluzhivaniya-passazhirskih-i-gruzovyh-perevozok-Elektronnyi-resurs-ucheb-posobie.pdf
3. Transportation of perishing goods. URL:https://files.stroyinf.ru/Data2/1/4293826/4293826395.htm#i483584The cargo complex of the airport is a warehouse of temporary storage of cargo arriving and departing by planes serviced at the airport. The airport operator or handling company services the cargo complex. The cargo terminal carries out ground handling of cargo transported by foreign and domestic airlines, as well as provides freight forwarding, customs brokerage and warehousing services. The airport cargo complex helps you to solve the issues of transportation, warehousing and customs clearance of goods, as well as provides professional advice on all related issues. Cargo warehouses of a modern airport are complex engineering structures, most of which are mechanized and automated. They are equipped with special vehicles and means of mechanization, weighing, transportation and storage of goods and mail, including: stationary and self-propelled lifting equipment and mechanisms; weight measuring equipment; means of transportation of goods and mail; means of loading and unloading cargo and mail to / from the aircraft; means of loading and unloading containers (pallets) to / from the aircraft; engineering and technical means of aviation security; means of detecting radioactive and explosive substances; means of communication, information, radio broadcasting.
Вантажний комплекс аеропорту - це склад тимчасового зберігання вантажів, що прибувають і вилітають літаками, що обслуговуються в аеропорту. Оператор аеропорту або обробна компанія обслуговує вантажний комплекс. Вантажний термінал здійснює наземне обслуговування вантажів, що перевозяться закордонними та вітчизняними авіакомпаніями, а також забезпечує експедирування вантажів, митний брокер і складські послуги. Вантажний комплекс аеропорту допомагає вирішити питання транспортування, складування та митного оформлення вантажів, а також надає професійні консультації з усіх супутніх питань. Вантажні склади сучасного аеропорту - це складні інженерні споруди, більшість з яких механізовані та автоматизовані. Вони оснащені спеціальними транспортними засобами та засобами механізації, зважування, транспортування та зберігання вантажів та пошти, в тому числі: стаціонарними та самохідними підйомними обладнаннями та механізмами; обладнання для вимірювання ваги; засоби перевезення вантажів та пошти; засоби завантаження та вивантаження вантажу та пошти до / з повітряного судна; засоби завантаження та розвантаження контейнерів (піддонів) до / з літака; інженерно-технічні засоби авіаційної безпеки; засоби виявлення радіоактивних та вибухонебезпечних речовин; засоби зв'язку, інформації, радіомовлення.
31
Palmgren, Myrna. "Optimal Truck Scheduling : Mathematical Modeling and Solution by the Column Generation Principle." Doctoral thesis, Linköping : Linköpings universitet, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3590.
Full text
32
Feyeux, Nelson. "Transport optimal pour l'assimilation de données images." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM076/document.
Full textAbstract:
Pour prédire l'évolution d'un système physique, nous avons besoin d'initialiser le modèle mathématique le représentant, donc d'estimer la valeur de l'état du système au temps initial. Cet état n'est généralement pas directement mesurable car souvent trop complexe. En revanche, nous disposons d'informations du système, prises à des temps différents, incomplètes, mais aussi entachées d'erreurs, telles des observations, de précédentes estimations, etc. Combiner ces différentes informations partielles et imparfaites pour estimer la valeur de l'état fait appel à des méthodes d'assimilation de données dont l'idée est de trouver un état initial proche de toutes les informations. Ces méthodes sont très utilisées en météorologie. Nous nous intéressons dans cette thèse à l'assimilation d'images, images qui sont de plus en plus utilisées en tant qu'observations. La spécificité de ces images est leur cohérence spatiale, l'oeil humain peut en effet percevoir des structures dans les images que les méthodes classiques d'assimilation ne considèrent généralement pas. Elles ne tiennent compte que des valeurs de chaque pixel, ce qui résulte dans certains cas à des problèmes d'amplitude dans l'état initial estimé. Pour résoudre ce problème, nous proposons de changer d'espace de représentation des données : nous plaçons les données dans un espace de Wasserstein où la position des différentes structures compte. Cet espace, équipé d'une distance de Wasserstein, est issue de la théorie du transport optimal et trouve beaucoup d'applications en imagerie notamment.Dans ce travail nous proposons une méthode d'assimilation variationnelle de données basée sur cette distance de Wasserstein. Nous la présentons ici, ainsi que les algorithmes numériques liés et des expériences montrant ses spécificités. Nous verrons dans les résultats comment elle permet de corriger ce qu'on appelle erreurs de positionForecasting of a physical system is computed by the help of a mathematical model. This model needs to be initialized by the state of the system at initial time. But this state is not directly measurable and data assimilation techniques are generally used to estimate it. They combine all sources of information such as observations (that may be sparse in time and space and potentially include errors), previous forecasts, the model equations and error statistics. The main idea of data assimilation techniques is to find an initial state accounting for the different sources of informations. Such techniques are widely used in meteorology, where data and particularly images are more and more numerous due to the increasing number of satellites and other sources of measurements. This, coupled with developments of meteorological models, have led to an ever-increasing quality of the forecast.Spatial consistency is one specificity of images. For example, human eyes are able to notice structures in an image. However, classical methods of data assimilation do not handle such structures because they take only into account the values of each pixel separately. In some cases it leads to a bad initial condition. To tackle this problem, we proposed to change the representation of an image: images are considered here as elements of the Wasserstein space endowed with the Wasserstein distance coming from the optimal transport theory. In this space, what matters is the positions of the different structures.This thesis presents a data assimilation technique based on this Wasserstein distance. This technique and its numerical procedure are first described, then experiments are carried out and results shown. In particularly, it appears that this technique was able to give an analysis of corrected position
33
Singh, Archit. "Electric Road Systems : A feasibility study investigating a possible future of road transportation." Thesis, KTH, Energiteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-194242.
Full textAbstract:
The transportation sector is a vital part of today’s society and accounts for 20 % of our global total energy consumption. It is also one of the most greenhouse gas emission intensive sectors as almost 95 % of its energy originates from petroleum-based fuels. Due to the possible harmful nature of greenhouse gases, there is a need for a transition to more sustainable transportation alternatives. A possible alternative to the conventional petroleum-based road transportation is implementation of Electric Road Systems (ERS) in combination with electric vehicles (EVs). ERS are systems that enable dynamic power transfer to the EV's from the roads they are driving on. Consequently, by utilizing ERS in combination with EVs, both the cost and weight of the EV-batteries can be kept to a minimum and the requirement for stops for recharging can also be eliminated. This system further enables heavy vehicles to utilize battery solutions. There are currently in principal three proven ERS technologies, namely, conductive power transfer through overhead lines, conductive power transfer from rails in the road and inductive power transfer through the road. The aim of this report is to evaluate and compare the potential of a full-scale implementation of these ERS technologies on a global and local (Sweden) level from predominantly, an economic and environmental perspective. Furthermore, the thesis also aims to explore how an expansion of ERS might look like until the year 2050 in Sweden using different scenarios. To answer these questions two main models (global and Swedish perspective) with accompanying submodels were produced in Excel. The findings show that not all countries are viable for ERS from an economic standpoint, however, a large number of countries in the world do have good prospects for ERS implementation. Findings further indicated that small and/or developed countries are best suited for ERS implementation. From an economic and environmental perspective the conductive road was found to be the most attractive ERS technology followed by overhead conductive and inductive road ERS technologies. The expansion model developed demonstrates that a fast expansion and implementation of an ERS-based transportation sector is the best approach from an economical perspective where the conductive road technology results in largest cost savings until 2050.Transportsektorn är en viktig del av dagens samhälle och står för 20% av den totala globala energiförbrukningen. Det är också en av de sektorer med mest växthusgasutsläpp, där nästan 95% av energin härstammar från petroleumbaserade bränslen. På grund av växthusgasers potentiellt skadliga karaktär finns det ett behov för en övergång till mer hållbara transportmedel. En möjlig alternativ till den konventionella petroleumbaserade vägtransporten är implementering av elektriska vägsystem (ERS) i kombination med elfordon. Elektriska vägsystem är system som möjliggör dynamisk kraftöverföring till fordon från vägarna de kör på. Sålunda kan man genom att använda ERS i kombination med elbilar, minimera både kostnaden och vikten av batterierna samt även minska eller eliminera antalet stopp för omladdningar. Dessutom möjliggör detta system att även tunga fordon kan använda sig av batterilösningar. Det finns för närvarande i princip tre beprövade ERS-tekniker, nämligen konduktiv kraftöverföring genom luftledningar, konduktiv kraftöverföring från räls i vägen och induktiv kraftöverföring genom vägen. Syftet med denna rapport är att utvärdera och jämföra potentialen för en fullskalig implementering av dessa ERS-teknik på en global och lokal (Sverige) nivå från, framförallt, ett ekonomiskt- och ekologiskt perspektiv. Rapporten syftar också till att undersöka, med hjälp av olika scenarier, hur en utbyggnad av ERS i Sverige skulle kunna se ut fram till år 2050. För att besvara dessa frågor producerades två huvudmodeller (global och lokal perspektiv) med kompletterande undermodeller i Excel. De erhållna resultaten visar att ERS inte är lönsamt ur ett ekonomisk perspektiv i precis alla de undersökta länder, dock har ett stort antal länder i världen visat sig ha goda förutsättningar för ERS. Vidare visar resultaten att små och/eller utvecklade länder är bäst lämpade för ERS. Ur ett ekonomiskt- och ekologiskt perspektiv har konduktiv kraftöverföring från räls i väg tekniken visat sig vara den mest attraktiva, följt av konduktiv kraftöverföring genom luftledningar och induktiv kraftöverföring genom väg teknikerna. Expansionsmodellen som utvecklats visar att en snabb expansion och implementation av en ERS-baserad vägtransportsektor är det bästa alternativet, där tekniken för konduktiv kraftöverföring från räls i väg ger de största kostnadsbesparingar fram till 2050.
34
Valenti, Giammarco. "Cooperative ADAS and driving, bio-inspired and optimal solutions." Doctoral thesis, Università degli studi di Trento, 2022. http://hdl.handle.net/11572/336890.
Full textAbstract:
Mobility is a topic of great interest in research and engineering since critical aspects such as safety, traffic efficiency, and environmental sustainability still represent wide open challenges for researchers and engineers. In this thesis, at first, we address the cooperative driving safety problem both from a centralized and decentralized perspective. Then we address the problem of optimal energy management of hybrid vehicles to improve environmental sustainability, and finally, we develop an intersection management systems for Connected Autonomous Vehicle to maximize the traffic efficiency at an intersection. To address the first two topics, we define a common framework. Both the cooperative safety and the energy management for Hybrid Electric Vehicle requires to model the driver behavior. In the first case, we are interested in evaluating the safety of the driver’s intentions, while in the second case, we are interested in predicting the future velocity profile to optimize energy management in a fixed time horizon. The framework is the Co-Driver, which is, in short, a bio-inspired agent able both to model and to imitate a human driver. It is based on a layered control structure based on the generation of atomic human-like longitudinal maneuvers that compete with each other like affordances. To address driving safety, the Co-Driver behaves like a safe driver, and its behavior is compared to the actual driver to understand if
he/she is acting safely and providing warnings if not. In the energy management problem, the Co-Driver aims at imitating the driver to predict the future velocity. The Co-Driver generates a set of possible maneuvers and selects one of them, imitating the action selection process of the driver. At first, we address the problem of safety by developing and investigating a framework for Advanced Driving
Assistance Systems (ADAS) built on the Co-Driver. We developed and investigated this framework in an innovative context of new intelligent road infrastructure, where vehicles and roads communicate. The
infrastructure that allows the roads to interact with vehicles and the environment is the topic of a research project called SAFESTRIP. This project is about deploying innovative sensors and communication devices on the road that communicate with all vehicles. Including vehicles that are equipped with Vehicle-To-Everything (V2X) technology and vehicles that are not, using an interface (HMI) on smart-phones.
Co-Driver-based ADAS systems exploit connections between vehicles and (smart) roads provided by SAFESTRIP to cover several safety-critical use cases: pedestrian protection, wrong-way vehicles on-ramps, work-zones on roads and intersections. The ADAS provide personalized warning messages that account for the adaptive driver behavior to maximize the acceptance of the system. The ability of the framework to predict human drivers’ intention is exploited in a second application to improve environmental sustainability. We employ it to feed with the estimated speed profile a novel online Model
Predictive Control (MPC) approach for Hybrid Electric Vehicles, introducing a state-of-the-art electrochemical model of the battery. Such control aims at preserving battery life and fuel consumption through equivalent costs. We validated the approach with actual driving data used to simulate vehicles and the power-train dynamics. At last, we address the traffic efficiency problem in the context of autonomous vehicles crossing an intersection. We propose an intersection management system for Connected Autonomous Vehicles based on a bi-level optimization framework. The motion planning of the vehicle is provided by a simplified optimal control problem, while we formulate the intersection management problem (in terms of order and timing) as a Mixed Integer Non-Linear Programming. The latter approximates a linear problem with a powerful piecewise linearization technique. Therefore, thanks to this technique, we can bound the error and employ commercial solvers to solve the problem (fast enough). Finally, this framework is validated in simulation and compared with the "Fist-Arrived First-Served" approach to show the impact of the proposed algorithm.
35
Bam, Prayag. "Development and Implementation of Network Level Trade-off Analysis tool in Transportation Asset Management." University of Toledo / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1512227253641838.
Full text
36
Gao, Lijun. "Information Points and Optimal Discharging Speed: Effects on the Saturation Flow at Signalized Intersections." University of Toledo / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1430482821.
Full text
37
Sgarioto, Daniel Emmanuel, and s9908712@student rmit edu au. "Non-linear Dynamic Modelling and Optimal Control of Aerial Tethers for Remote Delivery and Capture of Payloads." RMIT University. Aerospace, Mechanical and Manufacturing Engineering, 2006. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20070209.144754.
Full textAbstract:
Many potentially useful applications that broadly fall under the umbrella of payload transportation operations have been proposed for aerial towed-cable (ATC) systems, namely the precise capture and delivery of payloads. There remain outstanding issues concerning the dynamics and control of ATC systems that are inhibiting the near-term demonstration of these applications. The development of simplified representations of ATC systems that retain the important dynamics, yet are simple enough for use in control system development is limited. Likewise, little research exists into the development of controllers for ATC systems, especially the development of towing strategies and cable-based control techniques for rendezvous and payload transportation. Thus, this thesis presents novel research into the development of control strategies and simulation facilities that redress these two major anomalies, thereby overcoming a number of hitherto unresolved issues. The primary objective of this thesis is to develop innovative non-linear optimal control systems to manoeuvre a cable towed beneath an aircraft to transport payloads both to and from surface locations. To appropriately satisfy this objective, accurate and efficient modelling capabilities are proposed, yielding the equations of motion for numerous models of the ATC system. A series of techniques for improving the representativeness of simple dynamical models were developed. The benefits of using these procedures were shown to be significant and possible without undue complexity or computational expense. Use of such techniques result in accurate simulations and allow representative control systems to be designed. A series of single and multi-phase non-linear optimal control problems for ATC systems are then formally proposed, which were converted into non-linear programming problems using direct transcription for expedient solution. The possibility of achieving accurate, numerous instantaneous rendezvous of the cable tip with desired surface locations on the ground, in two and three-dimensions, is successfully demonstrated. This was achieved through the use of deployment and retrieval control of the cable and/or aircraft manoeuvring. The capability of the system to safely and accurately transport payloads to and from the surface via control of the cable and/or aircraft manoeuvring is also established. A series of parametric studies were conducted to establish the impact that various parameters have on the ability of the system to perform various rendezvous and payload transportation operations. This allowed important insights into to the nature of the system to be examined. In order for the system to perform rendezvous and payload transportation operations in the presence of wind gusts, a number of simple closed loop optimal feedback controllers were developed. These feedback controllers are based on the linear quadratic regulator control methodology. A preliminary indication of the robustness of ATC systems to wind gusts is provided for through a succession of parametric investigations. The performance of the closed-loop system demonstrates that precise and robust control of the ATC system can be achieved for a wide variety of operating conditions. The research presented in this thesis will provide a solid foundation for further advancing the development of aerial tether payload transportation technology.
38
Mandad, Manish. "Approximation robuste de surfaces avec garanties." Thesis, Université Côte d'Azur (ComUE), 2016. http://www.theses.fr/2016AZUR4156/document.
Full textAbstract:
Cette thèse comprend deux parties indépendantes.Dans la première partie nous contribuons une nouvelle méthode qui, étant donnée un volume de tolérance, génère un maillage triangulaire surfacique garanti d’être dans le volume de tolérance, sans auto-intersection et topologiquement correct. Un algorithme flexible est conçu pour capturer la topologie et découvrir l’anisotropie dans le volume de tolérance dans le but de générer un maillage de faible complexité.Dans la seconde partie nous contribuons une nouvelle approche pour calculer une fonction de correspondance entre deux surfaces. Tandis que la plupart des approches précédentes procède par composition de correspondance avec un domaine simple planaire, nous calculons une fonction de correspondance en optimisant directement une fonction de sorte à minimiser la variance d’un plan de transport entre les surfacesThis thesis is divided into two independent parts.In the first part, we introduce a method that, given an input tolerance volume, generates a surface triangle mesh guaranteed to be within the tolerance, intersection free and topologically correct. A pliant meshing algorithm is used to capture the topology and discover the anisotropy in the input tolerance volume in order to generate a concise output. We first refine a 3D Delaunay triangulation over the tolerance volume while maintaining a piecewise-linear function on this triangulation, until an isosurface of this function matches the topology sought after. We then embed the isosurface into the 3D triangulation via mutual tessellation, and simplify it while preserving the topology. Our approach extends toDépôt de thèseDonnées complémentairessurfaces with boundaries and to non-manifold surfaces. We demonstrate the versatility and efficacy of our approach on a variety of data sets and tolerance volumes.In the second part we introduce a new approach for creating a homeomorphic map between two discrete surfaces. While most previous approaches compose maps over intermediate domains which result in suboptimal inter-surface mapping, we directly optimize a map by computing a variance-minimizing mass transport plan between two surfaces. This non-linear problem, which amounts to minimizing the Dirichlet energy of both the map and its inverse, is solved using two alternating convex optimization problems in a coarse-to-fine fashion. Computational efficiency is further improved through the use of Sinkhorn iterations (modified to handle minimal regularization and unbalanced transport plans) and diffusion distances. The resulting inter-surface mapping algorithm applies to arbitrary shapes robustly and efficiently, with little to no user interaction
39
Preux, Anthony. "Transport optimal et équations des gaz sans pression avec contrainte de densité maximale." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS435/document.
Full textAbstract:
Dans cette thèse, nous nous intéressons aux équations des gaz sans pression avec contrainte de congestion qui soulèvent encore de nombreuses questions. La stratégie que nous proposons repose sur des précédents travaux sur le mouvement de foule dans le cadre de l'espace de Wasserstein, et sur un modèle granulaire avec des collisions inélastiques.Elle consiste en l'étude d'un schéma discrétisé en temps dont les suites doivent approcher les solutions de ces équations.Le schéma se présente de la manière suivante : à chaque pas de temps, le champ des vitesses est projeté sur un ensemble lui permettant d'éviter les croisements entre particules, la densité est ensuite déplacée selon le nouveau champ des vitesses, puis est projetée sur l'ensemble des densités admissibles (inférieures à une valeur seuil donnée).Enfin, le champ des vitesses est mis à jour en tenant compte du parcours effectué par les particules. En dimension 1, les solutions calculées par le schéma coïncident avec les solutions connues pour ce système. En dimension 2, les solutions calculées respectent les propriétés connues des solutions des équations de gaz sans pression avec contrainte de congestion. De plus, on retrouve des similarités entres ces solutions et celles du modèle granulaire microscopique dans des cas où elles sont comparables. Par la suite, la discrétisation en espace pose des problèmes et a nécessité l'élaboration d'un nouveau schéma de discrétisation du coût Wasserstein quadratique. Cette méthode que nous avons baptisée méthode du balayage transverse consiste à calculer le coût en utilisant les flux de masses provenant d'une certaine cellule et traversant les hyperplans définis par les interfaces entre les cellulesIn this thesis, we consider the pressureless Euler equations with a congestion constraint.This system still raises many open questions and aside from its one-dimensional version,very little is known. The strategy that we propose relies on previous works of crowd motion models withcongestion in the framework of the Wasserstein space, and on a microscopic granularmodel with inelastic collisions. It consists of the study of a time-splitting scheme. The first step is about the projection of the current velocity field on a set, avoiding the factthat trajectories do not cross during the time step. Then the scheme moves the density with the new velocity field. This intermediate density may violate the congestion constraint. The third step projects it on the set of admissible densities. Finally, the velocity field is updated taking into account the positions of physical particles during the scheme. In the one-dimensional case, solutions computed by the algorithm matchwith the ones that we know for these equations. In the two-dimensional case, computed solutions respect some properties that can be expected to be verified by the solutions to these equations. In addition, we notice some similarities between solutions computed by the scheme and the ones of the granular model with inelastic collisions. Later, this scheme is discretized with respect to the space variable in the purpose of numerical computations of solutions. The resulting algorithm uses a new method to discretize the Wasserstein cost. This method, called Transverse Sweeping Method consists in expressing the cost using the mass flow from any cell and crossing hyperplanes defined by interfaces between cells
40
Lepoultier, Guilhem. "Transport numérique de quantités géométriques." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112202/document.
Full textAbstract:
Une part importante de l’activité en calcul scientifique et analyse numérique est consacrée aux problèmes de transport d’une quantité par un champ donné (ou lui-même calculé numériquement). Les questions de conservations étant essentielles dans ce domaine, on formule en général le problème de façon eulérienne sous la forme d’un bilan au niveau de chaque cellule élémentaire du maillage, et l’on gère l’évolution en suivant les valeurs moyennes dans ces cellules au cours du temps. Une autre approche consiste à suivre les caractéristiques du champ et à transporter les valeurs ponctuelles le long de ces caractéristiques. Cette approche est délicate à mettre en oeuvre, n’assure pas en général une parfaite conservation de la matière transportée, mais peut permettre dans certaines situations de transporter des quantités non régulières avec une grande précision, et sur des temps très longs (sans conditions restrictives sur le pas de temps comme dans le cas des méthodes eulériennes). Les travaux de thèse présentés ici partent de l’idée suivante : dans le cadre des méthodes utilisant un suivi de caractéristiques, transporter une quantité supplémentaire géométrique apportant plus d’informations sur le problème (on peut penser à un tenseur des contraintes dans le contexte de la mécanique des fluides, une métrique sous-jacente lors de l’adaptation de maillage, etc. ). Un premier pan du travail est la formulation théorique d’une méthode de transport de telles quantités. Elle repose sur le principe suivant : utiliser la différentielle du champ de transport pour calculer la différentielle du flot, nous donnant une information sur la déformation locale du domaine nous permettant de modifier nos quantités géométriques. Cette une approche a été explorée dans dans le contexte des méthodes particulaires plus particulièrement dans le domaine de la physique des plasmas. Ces premiers travaux amènent à travailler sur des densités paramétrées par un couple point/tenseur, comme les gaussiennes par exemple, qui sont un contexte d’applications assez naturelles de la méthode. En effet, on peut par la formulation établie transporter le point et le tenseur. La question qui se pose alors et qui constitue le second axe de notre travail est celle du choix d’une distance sur des espaces de densités, permettant par exemple d’étudier l’erreur commise entre la densité transportée et son approximation en fonction de la « concentration » au voisinage du point. On verra que les distances Lp montrent des limites par rapport au phénomène que nous souhaitons étudier. Cette étude repose principalement sur deux outils, les distances de Wasserstein, tirées de la théorie du transport optimal, et la distance de Fisher, au carrefour des statistiques et de la géométrie différentielleIn applied mathematics, question of moving quantities by vector is an important question : fluid mechanics, kinetic theory… Using particle methods, we're going to move an additional quantity giving more information on the problem. First part of the work is the theorical formulation for this kind of transport. It's going to use the differential in space of the vector field to compute the differential of the flow. An immediate and natural application is density who are parametrized by and point and a tensor, like gaussians. We're going to move such densities by moving point and tensor. Natural question is now the accuracy of such approximation. It's second part of our work , which discuss of distance to estimate such type of densities
41
Bouras, Ikram. "Fixed charge network design problem with user-optimal flows." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS136.
Full textAbstract:
Cette thèse s'adresse à la classe des problèmes de conception de réseaux bi-niveaux. Nous nous sommes intéressés à l'étude des applications des différents domaines et au développement d'algorithmes exacts pour la résolution des problème de réseaux bi-niveau correspondants. En particulier, nous avons étudié le problème de conception de réseau bi-niveau dans lequel le ``leader" sélectionne une partie du réseau à activer, puis, dans le deuxième niveau, la solution doit être optimale pour un problème de flot dans le sous-réseau sélectionné. Dans cette thèse, trois applications de ce problème sont étudiées : le transport de matières dangereuses, les réseaux de télécommunication et les réseaux sociaux. Le problème de deuxième niveau dans la première et la dernière application est un problème de plus court chemin alors qu'un flot de coûts minimum est requis dans la deuxième application.Le premier problème étudié est le problème de conception de réseau avec coût fixe avec contraintes de plus court chemin. Le problème est modélisé comme un programme bi-niveaux qui peut être appliqué dans le transport des matières dangereuses. Pour ce problème, nous proposons deux nouvelles formulations de programmation en nombres entiers (PLNE) inspirées par des inégalités de chemin et de cycle. Nous incorporons ces formulations dans des algorithmes de branch-and-cut et de plans coupants. Des tests numériques sont effectués sur des instances réelles et sur un ensembles d'instances aléatoires qui sont générées avec différents critères pour examiner la difficulté de ces instances. Les résultats montrent que les algorithmes de plan coupants proposés peuvent résoudre jusqu’à 19% d’instances de plus que les formulations compactes.Le deuxième problème étudié concerne la gestion de la consommation d'énergie dans les réseaux de télécommunication en utilisant un protocole de routage multi-chemins pour minimiser la capacité des liens utilisée. Nous proposons un modèle d'optimisation bi-niveaux dans lequel le premier niveau représente la fonction de gestion de l'énergie et le deuxième est un protocole de routage multi-chemins. Ensuite, le problème est reformulé par des formulations PLNE en remplaçant le problème du deuxième niveau par ses conditions d'optimalité. Ces formulations sont utilisées pour résoudre le problème avec les algorithmes classiques de plans coupants et de branch-and-cut. Les expérimentations sont effectuées sur des instances réelles afin de comparer les algorithmes proposés et d'évaluer l'efficacité de notre modèle par rapport aux modèles existants à un seul chemin et de multi-objectifs.Enfin, nous étudions le problème de la maximisation d’influence dans les réseaux sociaux signés. A notre connaissance, c'est la première fois que ce problème est considéré comme un problème de programmation à deux niveaux. Nous reformulons le problème en modèles PLNE à un niveau en utilisant trois différentes conditions d'optimalité du problème de plus court chemin apparaissant dans le deuxième niveau. Ces formulations sont renforcées en ajoutant un ensemble d'inégalités valides. Des tests numériques sont effectués sur des instances aléatoires pour comparer les différentes formulations proposées. Enfin, des solutions optimales en temps polynomial sont proposées pour des cas particuliers des graphesThis thesis addresses a class of bi-level network design problems. We are interested in investigating applications from different domains and in developing exact algorithms to solve the corresponding bi-level network problem. In particular, we study a bi-level network design problem where the leader selects a part of the network to be activated, then, in the second level, the solution must be optimal for a network flow problem in the selected sub-network. In this thesis, three applications of this problem are studied: hazmats transportation, telecommunication, and social networks analysis. The second level problem in the first and the last applications is a shortest path problem while a minimum cost flow is required in the second application.The first studied problem is the fixed charge network design problem with shortest path constraints, which is modeled as a bi-level program and can be applied in hazardous transportation. For this problem, we propose two new binary integer programming (BILP) formulations inspired by path and cycle inequalities. We incorporate these formulations in a branch-and-cut algorithm and another cutting-plane based method. Numerical experiments are performed on real instances, and random data sets generated with different criteria to examine the difficulty of the instances. The results show that the proposed cutting plane algorithms can solve up to 19% more instances than the compact formulations.The second studied problem is the energy-aware traffic engineering while using multi-path routing to minimize link capacity utilization in ISP backbone networks. We propose a bi-level optimization model where the upper level represents the energy management function, and the lower one refers to the deployed multi-path routing protocol. Then, we reformulate it as a one-level MILP replacing the second level problem by different sets of flow optimality conditions. We further use these formulations to solve the problem with classical cutting plane and branch-and-cut algorithms. The computational experiments are performed on real instances to compare the proposed algorithms and to evaluate the efficiency of our model against existing single-path and multi-objective models.Finally, we study the problem of maximization influence in signed social networks. To the best of our knowledge, it is the first time that this problem is modeled as a bi-level programming problem. We reformulate the problem as one-level MILP models using three different optimality conditions of the shortest path problem appearing in the second level. These formulations are strengthened by adding a set of valid inequalities. Computational experiments are performed using random instances to compare the different proposed formulations. Finally, explicit solutions and bounds are proposed for particular cases of instances
42
Caillaud, Corentin. "Asymptotical estimates for some algorithms for data and image processing : a study of the Sinkhorn algorithm and a numerical analysis of total variation minimization." Thesis, Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAX023.
Full textAbstract:
Cette thèse traite de problèmes discrets d'optimisation convexe et s'intéresse à des estimations de leurs taux de convergence. Elle s'organise en deux parties indépendantes.Dans la première partie, nous étudions le taux de convergence de l'algorithme de Sinkhorn et de certaines de ses variantes. Cet algorithme apparaît dans le cadre du Transport Optimal (TO) par l'intermédiaire d'une régularisation entropique. Ses itérations, comme celles de ses variantes, s'écrivent sous la forme de produits composante par composante de matrices et de vecteurs positifs. Pour les étudier, nous proposons une nouvelle approche basée sur des inégalités de convexité simples et menant au taux de convergence linéaire observé en pratique. Nous étendons ce résultat à un certain type de variantes de l'algorithme que nous appelons algorithmes de Sinkhorn équilibrés de dimension 1. Nous présentons ensuite des techniques numériques traitant le cas de la convergence vers zéro du paramètre de régularisation des problèmes de TO. Enfin, nous menons l'analyse complète du taux de convergence en dimension 2.Dans la deuxième partie, nous donnons des estimations d'erreur pour deux discrétisations de la variation totale (TV) dans le modèle de Rudin, Osher et Fatemi (ROF). Ce problème de débruitage d'image, qui revient à calculer l'opérateur proximal de la variation totale, bénéficie de propriétés d'isotropie assurant la conservation de discontinuités nettes dans les images débruitées, et ce dans toutes les directions. En discrétisant le problème sur un maillage carré de taille h et en utilisant une variation totale discrète standard dite TV isotrope, cette propriété est perdue. Nous démontrons que dans une direction particulière l'erreur sur l'énergie est d'ordre h^{2/3}, ce qui est relativement élevé face aux attentes pour de meilleures discrétisations. Notre preuve repose sur l'analyse d'un problème équivalent en dimension 1 et de la TV perturbée qui y intervient. La deuxième variation totale discrète que nous considérons copie la définition de la variation totale continue en remplaçant les champs duaux habituels par des champs discrets dits de Raviart-Thomas. Nous retrouvons ainsi le caractère isotrope du modèle ROF discret. Pour conclure, nous prouvons, pour cette variation totale et sous certaines hypothèses, une estimation d'erreur en O(h)This thesis deals with discrete optimization problems and investigates estimates of their convergence rates. It is divided into two independent parts.The first part addresses the convergence rate of the Sinkhorn algorithm and of some of its variants. This algorithm appears in the context of Optimal Transportation (OT) through entropic regularization. Its iterations, and the ones of the Sinkhorn-like variants, are written as componentwise products of nonnegative vectors and matrices. We propose a new approach to analyze them, based on simple convex inequalities and leading to the linear convergence rate that is observed in practice. We extend this result to a particular type of variants of the algorithm that we call 1D balanced Sinkhorn-like algorithms. In addition, we present some numerical techniques dealing with the convergence towards zero of the regularizing parameter of the OT problems. Lastly, we conduct the complete analysis of the convergence rate in dimension 2. In the second part, we establish error estimates for two discretizations of the total variation (TV) in the Rudin-Osher-Fatemi (ROF) model. This image denoising problem, that is solved by computing the proximal operator of the total variation, enjoys isotropy properties ensuring the preservation of sharp discontinuities in the denoised images in every direction. When the problem is discretized into a square mesh of size h and one uses a standard discrete total variation -- the so-called isotropic TV -- this property is lost. We show that in a particular direction the error in the energy is of order h^{2/3} which is relatively large with respect to what one can expect with better discretizations. Our proof relies on the analysis of an equivalent 1D denoising problem and of the perturbed TV it involves. The second discrete total variation we consider mimics the definition of the continuous total variation replacing the usual dual fields by discrete Raviart-Thomas fields. Doing so, we recover an isotropic behavior of the discrete ROF model. Finally, we prove a O(h) error estimate for this variant under standard hypotheses
43
Sergent, Aaronn. "Optimal Sizing and Control of Battery Energy Storage Systems for Hybrid-Electric, Distributed-Propulsion Regional Aircraft." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1595519141013663.
Full text
44
Souza, Estefano Alves de. "O problema de Monge-Kantorovich para duas medidas de probabilidade sobre um conjunto finito." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-04052009-162654/.
Full textAbstract:
Apresentamos o problema do transporte ótimo de Monge-Kantorovich com duas medidas de probabilidade conhecidas e que possuem suporte em um conjunto de cardinalidade finita. O objetivo é determinar condições que permitam construir um acoplamento destas medidas que minimiza o valor esperado de uma função de custo conhecida e que assume valor nulo apenas nos elementos da diagonal. Apresentamos também um resultado relacionado com a solução do problema de Monge-Kantorovich em espaços produto finitos quando conhecemos soluções para o problema nos espaços marginais.We present the Monge-Kantorovich optimal problem with two known probability measures on a finite set. The objective is to obtain conditions that allow us to build a coupling of these measures that minimizes the expected value of a cost function that is known and is zero only on the diagonal elements. We also present a result that is related with the solution of the Monge-Kantorovich problem in finite product spaces in the case that solutions to the problem in the marginal spaces are known.
45
Динда, К. П. "Оцінка логістичного сервісу у проектах перевезення вантажу." Thesis, Сумський державний університет, 2016. http://essuir.sumdu.edu.ua/handle/123456789/47978.
Full text
46
Fan, Zongyue. "A Lagrangian Meshfree Simulation Framework for Additive Manufacturing of Metals." Case Western Reserve University School of Graduate Studies / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case1619737226226133.
Full text
47
Shibutani, Satomi. "Transportation of separate waste fractions in an underground waste transportation system." Thesis, KTH, Industriell ekologi, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58630.
Full textAbstract:
Today waste management has entered a new stage. Since wastes still contain natural materials and energy that can be extracted, it should be treated in effective ways, for example, for energy recovery or material recycling. Many countries and the municipalities have therefore made waste treatment strategies in accordance with for example, EU directives or governmental regulations. In such circumstances, Envac is one of waste management companies in Sweden, which collects different kinds of waste fractions through an underground pipe system by means of air pressure. In Hammarby sjöstad in Stockholm, currently organic waste, combustible waste, and newspapers are collected by the Envac’s system, however a cross contamination between organic fraction and newspapers has been observed. We therefore performed on-site waste transporting experiments in order to solve this cross contamination and suggest an optimum transporting condition which means that waste bags can be transported with high rate and acceptable condition to the terminal. From the previous study, bag quality and transporting speed were supposed to be the factors that affect the waste purity. Then on-site experiments were designed and carried out based on these factors. In the end, we proposed the optimum condition depending on the bag quality and clarified the causes of the cross contamination.
48
Santambrogio, Filippo. "Variational problems in transport theory with mass concentration." Doctoral thesis, Scuola Normale Superiore, 2006. http://hdl.handle.net/11384/85701.
Full text
49
Pass, Brendan. "Structural Results on Optimal Transportation Plans." Thesis, 2011. http://hdl.handle.net/1807/31893.
Full textAbstract:
In this thesis we prove several results on the structure of solutions to optimal transportation problems.
The second chapter represents joint work with Robert McCann and Micah Warren; the main result is that, under a non-degeneracy condition on the cost function, the optimal is concentrated on a $n$-dimensional Lipschitz submanifold of the product space. As a consequence, we provide a simple, new proof that the optimal map satisfies a Jacobian equation almost everywhere. In the third chapter, we prove an analogous result for the multi-marginal optimal transportation problem; in this context, the dimension of the support of the solution depends on the signatures of a $2^{m-1}$ vertex convex polytope of semi-Riemannian metrics on the product space, induce by the cost function. In the fourth chapter, we identify sufficient conditions under which the solution to the multi-marginal problem is concentrated on the graph of a function over one of the marginals. In the fifth chapter, we investigate the regularity of the optimal map when the dimensions of the two spaces fail to coincide. We prove that a regularity theory can be developed only for very special cost functions, in which case a quotient construction can be used to reduce the problem to an optimal transport problem between spaces of equal dimension. The final chapter applies the results of chapter 5 to the principal-agent problem in mathematical economics when the space of types and the space of available goods differ. When the dimension of the space of types exceeds the dimension of the space of goods, we show if the problem can be formulated as a maximization over a convex set, a quotient procedure can reduce the problem to one where the two dimensions coincide. Analogous conditions are investigated when the dimension of the space of goods exceeds that of the space of types.
50
Li, Bo. "The Optimal Transportation Method in Solid Mechanics." Thesis, 2009. https://thesis.library.caltech.edu/5193/1/Thesis_Bo_Li.pdf.
Full textAbstract:
This dissertation is concerned with the development of a robust and efficient meshless method, the Optimal Transportation Method (OTM), for general solid flows involving extremely large deformation, fast, transient loading and hydrodynamic phenomena. This method is a Lagrangian particle method through an integration of optimal transportation theory with meshless interpolation and material point integrations. The theoretical framework developed in this thesis generalized the Benamou-Brenier differential formulation of optimal transportation problems and leads to a multi-field variational characterization of solid flows, including elasticity, inelasticity, equation of state, and general geometries and boundary conditions. To this end, the accuracy, robustness and versatility of OTM is assessed and demonstrated with convergence and stability test, Taylor anvil test and a series of full three-dimensional simulations of high/hyper-velocity impact examples with the aid of a novel meshless dynamic contact algorithm presented in this thesis.