Dissertations / Theses on the topic '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.
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 textCavalletti, Fabio. "Optimal transportation in geodesic spaces." Doctoral thesis, SISSA, 2011. http://hdl.handle.net/20.500.11767/4213.
Full textZhang, 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 textIncludes bibliographical references (leaves 230-240). Also available in electronic version. Access restricted to campus users.
Figalli, Alessio. "Optimal transportation and action-minimizing measures." Doctoral thesis, Lyon, École normale supérieure (sciences), 2007. http://www.theses.fr/2007ENSL0422.
Full textFigalli, Alessio. "Optimal transportation and action-minimizing measures." Doctoral thesis, Scuola Normale Superiore, 2007. http://hdl.handle.net/11384/85683.
Full textBonnotte, Nicolas. "Unidimensional and Evolution Methods for Optimal Transportation." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00946781.
Full textNenna, Luca. "Numerical Methods for Multi-Marginal Optimal Transportation." Thesis, Paris Sciences et Lettres (ComUE), 2016. http://www.theses.fr/2016PSLED017/document.
Full textIn 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
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 textLai, 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 textIncludes bibliographical references (leaves 60-61). Also available in electronic version. Access restricted to campus users.
Bardelloni, Mauro. "The decomposition of optimal transportation problems with convex cost." Doctoral thesis, SISSA, 2014. http://hdl.handle.net/20.500.11767/3902.
Full textCaravenna, Laura. "The Disintegration Theorem and Applications to Optimal Mass Transportation." Doctoral thesis, SISSA, 2009. http://hdl.handle.net/20.500.11767/4622.
Full textWiking, 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 textWan, 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 textIncludes bibliographical references (leaves 92-95). Also available in electronic version. Access restricted to campus users.
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 textCataloged 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
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 textAntos, 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 textThis 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.
Ç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 textDong, 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 textIncludes 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.
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 textThis 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
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 textAbou-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 textID: 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
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 textSanthanam, 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 textGuo, Gaoyue. "Continuous-time Martingale Optimal Transport and Optimal Skorokhod Embedding." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX038/document.
Full textThis 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
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 textvon, 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 textDe, Philippis Guido. "Regularity of optimal transport maps and applications." Doctoral thesis, Scuola Normale Superiore, 2012. http://hdl.handle.net/11384/85688.
Full textOliveira, 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 textWe 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.
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 textKryvobok, 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 textThe 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.
Вантажний комплекс аеропорту - це склад тимчасового зберігання вантажів, що прибувають і вилітають літаками, що обслуговуються в аеропорту. Оператор аеропорту або обробна компанія обслуговує вантажний комплекс. Вантажний термінал здійснює наземне обслуговування вантажів, що перевозяться закордонними та вітчизняними авіакомпаніями, а також забезпечує експедирування вантажів, митний брокер і складські послуги. Вантажний комплекс аеропорту допомагає вирішити питання транспортування, складування та митного оформлення вантажів, а також надає професійні консультації з усіх супутніх питань. Вантажні склади сучасного аеропорту - це складні інженерні споруди, більшість з яких механізовані та автоматизовані. Вони оснащені спеціальними транспортними засобами та засобами механізації, зважування, транспортування та зберігання вантажів та пошти, в тому числі: стаціонарними та самохідними підйомними обладнаннями та механізмами; обладнання для вимірювання ваги; засоби перевезення вантажів та пошти; засоби завантаження та вивантаження вантажу та пошти до / з повітряного судна; засоби завантаження та розвантаження контейнерів (піддонів) до / з літака; інженерно-технічні засоби авіаційної безпеки; засоби виявлення радіоактивних та вибухонебезпечних речовин; засоби зв'язку, інформації, радіомовлення.
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 textFeyeux, Nelson. "Transport optimal pour l'assimilation de données images." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM076/document.
Full textForecasting 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
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 textTransportsektorn ä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.
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 textBam, 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 textGao, 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 textSgarioto, 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 textMandad, Manish. "Approximation robuste de surfaces avec garanties." Thesis, Université Côte d'Azur (ComUE), 2016. http://www.theses.fr/2016AZUR4156/document.
Full textThis 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
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 textIn 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
Lepoultier, Guilhem. "Transport numérique de quantités géométriques." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112202/document.
Full textIn 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
Bouras, Ikram. "Fixed charge network design problem with user-optimal flows." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS136.
Full textThis 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
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 textThis 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
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 textSouza, 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 textWe 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.
Динда, К. П. "Оцінка логістичного сервісу у проектах перевезення вантажу." Thesis, Сумський державний університет, 2016. http://essuir.sumdu.edu.ua/handle/123456789/47978.
Full textFan, 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 textShibutani, 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 textSantambrogio, Filippo. "Variational problems in transport theory with mass concentration." Doctoral thesis, Scuola Normale Superiore, 2006. http://hdl.handle.net/11384/85701.
Full textPass, Brendan. "Structural Results on Optimal Transportation Plans." Thesis, 2011. http://hdl.handle.net/1807/31893.
Full textLi, Bo. "The Optimal Transportation Method in Solid Mechanics." Thesis, 2009. https://thesis.library.caltech.edu/5193/1/Thesis_Bo_Li.pdf.
Full text