Готові списки джерел за темами / Optimization paths

Добірка наукової літератури з теми "Optimization paths"

Автор: Grafiati
Опубліковано: 30 травня 2022
Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Optimization paths".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Optimization paths"

1

Assefa Gebremichail, Aklilu, Cory Beard, and Rahul A. Paropkari. "Multi-Hop Relay Selection Based on Fade Durations." Electronics 9, no. 1 (January 2, 2020): 92. http://dx.doi.org/10.3390/electronics9010092.

Повний текст джерела
Анотація:
In cooperative relaying, the selection of relays could be based on different parameters. The most well-known and frequently used metric is the signal-to-noise ratio (SNR). In this method of relay selection, the rapid fluctuation of the signal (i.e., fading) is not taken into account in the selection criteria. Such rapid signal change may cause significant loss of information, degrade signal quality for voice or video connections, or could make the channel coding fail. An alternative method of relay selection in a cooperative relay network is by considering fading. Such methods include average fade duration (AFD) and fade duration outage probability (FDOP), which are based on time correlation statistics. Both the AFD and the FDOP are computed in reference to a threshold value for signal quality. This work derives new formulas for two hop and three hop relay paths, with three hop paths given a penalty cost. Then optimization algorithms for each type of relay selection method are derived, including total path and link-by-link optimization. Simulation results provide optimal AFD and FDOP paths for various random network topologies. These paths are then compared to paths that would be found if SNR metrics were used instead. It is shown that SNR optimization results in much different performance. For cases of four sources and four relays, SNR based optimization frequently chose different relay paths, as low as only 63% of the same relay paths as FDOP or AFD optimizations. Because fade duration methods more accurately control the fading nature and true quality of the signals, the results here provide significant improvements in relay performance and allow two and three hop relay paths to be implemented effectively.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

KAMIMURA, Masato, Yoshiyuki HATTA, Shuta ITO, Yoshinori KOGA, Toshiaki SAKURAI, and Kunihiro TAKAHASHI. "Structural Optimization and Load Paths." Transactions of the Japan Society of Mechanical Engineers Series A 74, no. 737 (2008): 6–12. http://dx.doi.org/10.1299/kikaia.74.6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Boissier, M., G. Allaire, and C. Tournier. "Additive manufacturing scanning paths optimization using shape optimization tools." Structural and Multidisciplinary Optimization 61, no. 6 (June 2020): 2437–66. http://dx.doi.org/10.1007/s00158-020-02614-3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Denkena, Berend, Volker Böß, and Patryk Manuel Hoppe. "Optimization of Non-Cutting Tool Paths." Advanced Materials Research 223 (April 2011): 911–17. http://dx.doi.org/10.4028/www.scientific.net/amr.223.911.

Повний текст джерела
Анотація:
The focus of CAM systems is on effectively creating cutting tool paths. However, collision risk is very high on multi axes machines when performing non-cutting traverse moves. If available, CAM systems offer limited setting options for non-cutting tool moves. In this paper an approach is presented that allows to automatically generating non-cutting tool paths. Process planners will not only be released from developing and simulating time-consuming multi axes traverse moves. The automatically calculated traverse moves will also machine-specifically optimized with respect to various optimization criteria.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Yan, Fu Yu, Fan Wu, Fei Peng, and Zhi Jie Zhu. "A Survey on Randomized Sampling-Based Path Optimization Methods." Advanced Materials Research 853 (December 2013): 652–60. http://dx.doi.org/10.4028/www.scientific.net/amr.853.652.

Повний текст джерела
Анотація:
Randomized sampling-based motion planners could efficiently generate collision-free motion paths. However, these paths have some quality problems (with respect to quality measures, such as path length, clearance and smoothness), especially in high dimensional configuration spaces. Thus, researchers studied some path optimization methods to improve path quality and to make paths suitable for practical applications. This paper reviews some of the most influential path optimization methods and gives an overall perspective on the most widely used ideas in the field.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Shi Chunyan, 施春燕, 袁家虎 Yuan Jiahu, 伍凡 Wu Fan, and 万勇建 Wan Yongjian. "Analysis of Polishing Errors by Tool Paths and Optimization of Tool Paths." Acta Optica Sinica 31, no. 8 (2011): 0822003. http://dx.doi.org/10.3788/aos201131.0822003.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Liñán, Roberto José, Iñaki Gaspar, Maria Bordagaray, José Luis Moura, and Angel Ibeas. "Optimization of Cycle Paths with Mathematical Programming." Transportation Research Procedia 3 (2014): 848–55. http://dx.doi.org/10.1016/j.trpro.2014.10.062.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Sheppard, Daniel, Rye Terrell, and Graeme Henkelman. "Optimization methods for finding minimum energy paths." Journal of Chemical Physics 128, no. 13 (April 7, 2008): 134106. http://dx.doi.org/10.1063/1.2841941.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Wigström, Oskar, Nina Sundström, and Bengt Lennartson. "Optimization of Hybrid Systems with Known Paths*." IFAC Proceedings Volumes 45, no. 9 (2012): 39–45. http://dx.doi.org/10.3182/20120606-3-nl-3011.00098.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Tarasyev, Alexandr A., Gavriil A. Agarkov, Camilo A. Ospina Acosta, and Viktor A. Koksharov. "Fuzzy Logic and Optimization of Educational Paths." IFAC-PapersOnLine 51, no. 2 (2018): 511–16. http://dx.doi.org/10.1016/j.ifacol.2018.03.086.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Optimization paths"

1

Lorek, David Randolph. "Approximating shortest paths in large networks /." Electronic version (PDF), 2005. http://dl.uncw.edu/etd/2005/lorekd/davidlorek.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Stout, Kevin Dale. "Design optimization of thermal paths in spacecraft systems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82492.

Повний текст джерела
Анотація:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2013.
This electronic version was submitted and approved by the author's academic department as part of an electronic thesis pilot project. The certified thesis is available in the Institute Archives and Special Collections.
"June 2013." Cataloged from department-submitted PDF version of thesis
Includes bibliographical references (p. 100-101).
This thesis introduces a thermal design approach to increase thermal control system performance and decrease reliance on system resources, e.g., mass. Thermal design optimization has lagged other subsystems because the thermal subsystem is not thought to significantly drive performance or resource consumption. However, there are factors present in many spacecraft systems that invalidate this assumption. Traditional thermal design methods include point designs where experts make key component selection and sizing decisions. Thermal design optimization literature primarily focuses on optimization of the components in isolation from other parts of the thermal control system, restricting the design space considered. The collective thermal design optimization process formulates the thermal path design process as an optimization problem where the design variables are updated for each candidate design. Parametric model(s) within the optimizer predict the performance and properties of candidate designs. The thermal path parameterization captures the component interactions with each other, the system, and the space environment, and is critical to preserving the full design space. The optimal design is a thermal path with higher performance and decreased resource consumption compared to traditional thermal design methods. The REgolith X-ray Imaging Spectrometer (REXIS) payload instrument serves as a case study to demonstrate the collective thermal design optimization process. First, a preliminary thermal control system model of a point design is used to determine the critical thermal path within REXIS: the thermal strap and radiator assembly. The collective thermal design optimization process is implemented on the thermal strap and radiator thermal path. Mass minimization is the objective and the REXIS detector operational temperature is a constraint to the optimization. This approach offers a 37% reduction in mass of the thermal strap and radiator assembly over a component-level optimization method.
by Kevin Dale Stout.
S.M.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Wang, I.-Lin. "Shortest paths and multicommodity network flows." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23304.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Chou, Chang-Chien. "Minimum traversal path of n circles path planning of circles, computing and constructing paths of circles, geometrical optimization." Saarbrücken VDM Verlag Dr. Müller, 2007. http://d-nb.info/991344146/04.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Garcia, Renan. "Resource constrained shortest paths and extensions." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28268.

Повний текст джерела
Анотація:
Thesis (M. S.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.
Committee Co-Chair: George L. Nemhauser; Committee Co-Chair: Shabbir Ahmed; Committee Member: Martin W. P. Savelsbergh; Committee Member: R. Gary Parker; Committee Member: Zonghao Gu.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Muhandiramge, Ranga. "Maritime manoeuvring optimization : path planning in minefield threat environments." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2009.0015.

Повний текст джерела
Анотація:
The aim of the research project that is the subject of this thesis is to apply mathematical techniques, especially those in the area of operations research, to the problem of maritime minefield transit. We develop several minefield models applicable to different aspects of the minefield problem. These include optimal mine clearance, shortest time traversal and time constrained traversal. We hope the suite of models and tools developed will help make mine field clearance and traversal both safer and more efficient and that exposition of the models will bring a clearer understanding of the mine problem from a mathematical perspective. In developing the solutions to mine field models, extensive use is made of network path planning algorithms, particularly the Weight Constrained Shortest Path Problem (WCSPP) for which the current state-of-the-art algorithm is extended. This is done by closer integration of Lagrangean relaxation and preprocessing to reduce the size of the network. This is then integrated with gap-closing algorithms based on enumeration to provide optimal or near optimal solutions to the path planning problem. We provide extensive computational evidence on the performance of our algorithm and compare it to other algorithms found in the literature. This tool then became fundamental in solving various separate minefield models. Our models can be broadly separated into obstacle models in which mine affected regions are treated as obstacles to be avoided and continuous threat in which each point of space has an associated risk. In the later case, we wish to find a path that minimizes the integral of the risk along the path while constraining the length of the path. We call this the Continuous Euclidean Length Constrained Minimum Cost Path Problem (C-LCMCPP), for which we present a novel network approach to solving this continuous problem. This approach results in being able to calculate a global lower bound on a non-convex optimization problem.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Nilsson, Mikael. "On the Complexity of Finding Spanner Paths." Linköpings universitet, Artificiell intelligens och integrerad datorsystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-93332.

Повний текст джерела
Анотація:
We study the complexity of finding so called spanner paths between arbitrary nodes in Euclidean graphs. We study both general Euclidean graphs and a special type of graphs called Integer Graphs. The problem is proven NP-complete for general Euclidean graphs with non-constant stretches (e.g. (2n)^(3/2) where n denotes the number of nodes in the graph). An algorithm solving the problem in O(2^(0.822n)) is presented. Integer graphs are simpler and for these special cases a better algorithm is presented. By using a partial order of so called Images the algorithm solves the spanner path problem using O(2^(c(\log n)^2)) time, where c is a constant depending only on the stretch.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Turner, Lara Ruth [Verfasser]. "Universal Combinatorial Optimization: Matroid Bases and Shortest Paths / Lara Ruth Turner." München : Verlag Dr. Hut, 2013. http://d-nb.info/1033041297/34.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Heni, Hamza. "Optimization of time-dependent routing problems considering dynamic paths and fuel consumption." Doctoral thesis, Université Laval, 2018. http://hdl.handle.net/20.500.11794/32805.

Повний текст джерела
Анотація:
Ces dernières années, le transport de marchandises est devenu un défi logistique à multiples facettes. L’immense volume de fret a considérablement augmenté le flux de marchandises dans tous les modes de transport. Malgré le rôle vital du transport de marchandises dans le développement économique, il a également des répercussions négatives sur l’environnement et la santé humaine. Dans les zones locales et régionales, une partie importante des livraisons de marchandises est transportée par camions, qui émettent une grande quantité de polluants. Le Transport routier de marchandises est un contributeur majeur aux émissions de gaz à effet de serre (GES) et à la consommation de carburant. Au Canada, les principaux réseaux routiers continuent de faire face à des problèmes de congestion. Pour réduire significativement l’impact des émissions de GES reliées au transport de marchandises sur l’environnement, de nouvelles stratégies de planification directement liées aux opérations de routage sont nécessaires aux niveaux opérationnel, environnemental et temporel. Dans les grandes zones urbaines, les camions doivent voyager à la vitesse imposée par la circulation. Les embouteillages ont des conséquences défavorables sur la vitesse, le temps de déplacement et les émissions de GES, notamment à certaines périodes de la journée. Cette variabilité de la vitesse dans le temps a un impact significatif sur le routage et la planification du transport. Dans une perspective plus large, notre recherche aborde les Problèmes de distribution temporels (Time-Dependent Distribution Problems – TDDP) en considérant des chemins dynamiques dans le temps et les émissions de GES. Considérant que la vitesse d’un véhicule varie en fonction de la congestion dans le temps, l’objectif est de minimiser la fonction de coût de transport total intégrant les coûts des conducteurs et des émissions de GES tout en respectant les contraintes de capacité et les restrictions de temps de service. En outre, les informations géographiques et de trafic peuvent être utilisées pour construire des multigraphes modélisant la flexibilité des chemins sur les grands réseaux routiers, en tant qu’extension du réseau classique des clients. Le réseau physique sous-jacent entre chaque paire de clients pour chaque expédition est explicitement considéré pour trouver des chemins de connexion. Les décisions de sélection de chemins complètent celles de routage, affectant le coût global, les émissions de GES, et le temps de parcours entre les nœuds. Alors que l’espace de recherche augmente, la résolution des Problèmes de distribution temporels prenant en compte les chemins dynamiques et les vitesses variables dans le temps offre une nouvelle possibilité d’améliorer l’efficacité des plans de transport... Mots clés : Routage dépendant du temps; chemins les plus rapides dépendant du temps; congestion; réseau routier; heuristique; émissions de gaz à effet de serre; modèles d’émission; apprentissage supervisé
In recent years, freight transportation has evolved into a multi-faceted logistics challenge. The immense volume of freight has considerably increased the flow of commodities in all transport modes. Despite the vital role of freight transportation in the economic development, it also negatively impacts both the environment and human health. At the local and regional areas, a significant portion of goods delivery is transported by trucks, which emit a large amount of pollutants. Road freight transportation is a major contributor to greenhouse gas (GHG) emissions and to fuel consumption. To reduce the significant impact of freight transportation emissions on environment, new alternative planning and coordination strategies directly related to routing and scheduling operations are required at the operational, environmental and temporal dimensions. In large urban areas, trucks must travel at the speed imposed by traffic, and congestion events have major adverse consequences on speed level, travel time and GHG emissions particularly at certain periods of day. This variability in speed over time has a significant impact on routing and scheduling. From a broader perspective, our research addresses Time-Dependent Distribution Problems (TDDPs) considering dynamic paths and GHG emissions. Considering that vehicle speeds vary according to time-dependent congestion, the goal is to minimize the total travel cost function incorporating driver and GHG emissions costs while respecting capacity constraints and service time restrictions. Further, geographical and traffic information can be used to construct a multigraph modeling path flexibility on large road networks, as an extension to the classical customers network. The underlying physical sub-network between each pair of customers for each shipment is explicitly considered to find connecting road paths. Path selection decisions complement routing ones, impacting the overall cost, GHG emissions, the travel time between nodes, and thus the set of a feasible time-dependent least cost paths. While the search space increases, solving TDDPs considering dynamic paths and time-varying speeds may provide a new scope for enhancing the effectiveness of route plans. One way to reduce emissions is to consider congestion and being able to route traffic around it. Accounting for and avoiding congested paths is possible as the required traffic data is available and, at the same time, has a great potential for both energy and cost savings. Hence, we perform a large empirical analysis of historical traffic and shipping data. Therefore, we introduce the Time-dependent Quickest Path Problem with Emission Minimization, in which the objective function comprises GHG emissions, driver and congestion costs. Travel costs are impacted by traffic due to changing congestion levels depending on the time of the day, vehicle types and carried load. We also develop time-dependent lower and upper bounds, which are both accurate and fast to compute. Computational experiments are performed on real-life instances that incorporate the variation of traffic throughout the day. We then study the quality of obtained paths considering time-varying speeds over the one based only on fixed speeds... Keywords : Time-dependent routing; time-dependent quickest paths; traffic congestion; road network; heuristic; greenhouse gas emissions; emission models; supervised learning.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Murekatete, Rachel Mundeli. "An Analysis of Consequences of Land Evaluation and Path Optimization." Licentiate thesis, KTH, Geoinformatik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235687.

Повний текст джерела
Анотація:
Planners who are involved in locational decision making often use raster-based geographic information systems (GIS) to quantify the value of land in terms of suitability or cost for a certain use. From a computational point of view, this process can be seen as a transformation of one or more sets of values associated with a grid of cells into another set of such values through a function reflecting one or more criteria. While it is generally anticipated that different transformations lead to different ‘best’ locations, little has been known on how such differences arise (or do not arise). Examples of such spatial decision problems can be easily found in the literature and many of them concern the selection of a set of cells (to which the land use under consideration is allocated) from a raster surface of suitability or cost depending on context. To facilitate GIS’s algorithmic approach, it is often assumed that the quality of the set of cells can be evaluated as a whole by the sum of their cell values. The validity of this assumption must be questioned, however, if those values are measured on a scale that does not permit arithmetic operations. Ordinal scale of measurement in Stevens’s typology is one such example. A question naturally arises: is there a more mathematically sound and consistent approach to evaluating the quality of a path when the quality of each cell of the given grid is measured on an ordinal scale? The thesis attempts to answer the questions highlighted above in the context of path planning through a series of computational experiments using a number of random landscape grids with a variety of spatial and non-spatial structures. In the first set of experiments, we generated least-cost paths on a number of cost grids transformed from the landscape grids using a variety of transformation parameters and analyzed the locations and (weighted) lengths of those paths. Results show that the same pair of terminal cells may well be connected by different least-cost paths on different cost grids though derived from the same landscape grid and that the variation among those paths is affected by how given values are distributed in the landscape grid as well as by how derived values are distributed in the cost grids. Most significantly, the variation tends to be smaller when the landscape grid contains more distinct patches of cells potentially attracting or distracting cost-saving passage or when the cost grid contains a smaller number of low-cost cells. The second set of experiments aims to compare two optimization models, minisum and minimax (or maximin) path models, which aggregate the values of the cells associated with a path using the sum function and the maximum (or minimum) function, respectively. Results suggest that the minisum path model is effective if the path search can be translated into the conventional least-cost path problem, which aims to find a path with the minimum cost-weighted length between two terminuses on a ratio-scaled raster cost surface, but the minimax (or maximin) path model is mathematically sounder if the cost values are measured on an ordinal scale and practically useful if the problem is concerned not with the minimization of cost but with the maximization of some desirable condition such as suitability.
Planerare som arbetar bland annat med att fatta beslut som hänsyftar till vissa lokaler använder ofta rasterbaserade geografiska informationssystem (GIS) för att sätta ett värde på marken med avseende på lämplighet eller kostnad för en viss användning. Ur en beräkningssynpunkt kan denna process ses som en transformation av en eller flera uppsättningar värden associerade med ett rutnät av celler till en annan uppsättning sådana värden genom en funktion som återspeglar ett eller flera kriterier. Medan det generellt förväntas att olika omvandlingar leder till olika "bästa" platser, har lite varit känt om hur sådana skillnader uppstår (eller inte uppstår). Exempel på sådana rumsliga beslutsproblem kan lätt hittas i litteraturen och många av dem handlar om valet av en uppsättning celler (som markanvändningen övervägs tilldelas) från en rasteryta av lämplighet eller kostnad beroende på kontext. För att underlätta GISs algoritmiska tillvägagångssätt antas det ofta att kvaliteten på uppsättningen av celler kan utvärderas som helhet genom summan av deras cellvärden. Giltigheten av detta antagande måste emellertid ifrågasättas om dessa värden mäts på en skala som inte tillåter aritmetiska transformationer. Användning av ordinal skala enligt Stevens typologi är ett exempel av detta. En fråga uppstår naturligt: Finns det ett mer matematiskt sunt och konsekvent tillvägagångssätt för att utvärdera kvaliteten på en rutt när kvaliteten på varje cell i det givna rutnätet mäts med ordinalskala? Avhandlingen försöker svara på ovanstående frågor i samband med ruttplanering genom en serie beräkningsexperiment med hjälp av ett antal slumpmässigt genererade landskapsnät med en rad olika rumsliga och icke-rumsliga strukturer. I den första uppsättningen experiment genererade vi minsta-kostnad rutter på ett antal kostnadsnät som transformerats från landskapsnätverket med hjälp av en mängd olika transformationsparametrar, och analyserade lägen och de (viktade) längderna för dessa rutter. Resultaten visar att samma par ändpunkter mycket väl kan vara sammanbundna med olika minsta-kostnad banor på olika kostnadsraster härledda från samma landskapsraster, och att variationen mellan dessa banor påverkas av hur givna värden fördelas i landskapsrastret såväl som av hur härledda värden fördelas i kostnadsrastret. Mest signifikant är att variationen tenderar att vara mindre när landskapsrastret innehåller mer distinkta grupper av celler som potentiellt lockar eller distraherar kostnadsbesparande passage, eller när kostnadsrastret innehåller ett mindre antal låg-kostnad celler. Den andra uppsättningen experiment syftar till att jämföra två optimeringsmodeller, minisum och minimax (eller maximin) sökmodeller, vilka sammanställer värdena för cellerna som är associerade med en sökväg med summanfunktionen respektive maximum (eller minimum) funktionen. Resultaten tyder på att minisumbanemodellen är effektiv om sökningen av sökvägen kan översättas till det konventionella minsta kostnadsproblemet, vilket syftar till att hitta en väg med den minsta kostnadsvägda längden mellan två terminaler på en ratio-skalad rasterkostyta, men minimax (eller maximin) banmodellen är matematiskt sundare om kostnadsvärdena mäts i ordinär skala och praktiskt användbar om problemet inte bara avser minimering av kostnad men samtidigt maximering av någon önskvärd egenskap såsom lämplighet.

QC 20181002

Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Optimization paths"

1

Extremal paths in graphs: Foundations, search strategies, and related topics. Berlin: Akademie Verlag, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Ross, Ron S. Planning minimum-energy paths in an off-road environment with anisotropic traversal costs and motion constraints. Monterey, Calif: Naval Postgraduate School, 1989.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Robinett, Rush D. A unified approach to vehicle design, control, and flight path optimization. College Station, Tex: Center for Strategic Technology, the Texas Engineering Experiment Station of the Texas A&M University System, 1987.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

service), SpringerLink (Online, ed. Path Player Games: Analysis and Applications. Boston, MA: Springer-Verlag US, 2009.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

El-Taha, Muhammad. Sample-Path Analysis of Queueing Systems. Boston, MA: Springer US, 1999.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Zhongguo nong cun tu di zhi du gai ge lu jing you hua: The optimization path of reformation in rural land of China. Beijing Shi: She hui ke xue wen xian chu ban she, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Zhongguo nong cun tu di zhi du gai ge lu jing you hua: The optimization path of reformation in rural land of China. Beijing Shi: She hui ke xue wen xian chu ban she, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Zhongguo nong cun tu di zhi du gai ge lu jing you hua: The optimization path of reformation in rural land of China. Beijing Shi: She hui ke xue wen xian chu ban she, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Ziegelmann, Dr Mark. Constrained Shortest Paths and Related Problems: Constrained Network Optimization. VDM Verlag Dr. Müller, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Huckenbeck, Ulrich. Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics (Mathematical Topics). VCH Publishers, 1998.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Optimization paths"

1

Neumann, Frank, and Carsten Witt. "Shortest Paths." In Bioinspired Computation in Combinatorial Optimization, 111–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16544-3_8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

El Shawi, Radwa, and Joachim Gudmundsson. "Quickest Paths in Anisotropic Media." In Combinatorial Optimization and Applications, 247–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22616-8_20.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Jiang, Minghui. "Trees, Paths, Stars, Caterpillars and Spiders." In Combinatorial Optimization and Applications, 551–65. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26626-8_40.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Maheshwari, Anil, Arash Nouri, and Jörg-Rüdiger Sack. "Rectilinear Shortest Paths Among Transient Obstacles." In Combinatorial Optimization and Applications, 19–34. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04651-4_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Cohen, Johanne, Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, and Hong Phong Pham. "Tropical Paths in Vertex-Colored Graphs." In Combinatorial Optimization and Applications, 291–305. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71147-8_20.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Lysenko, Olga, Mykola Kuznetsov, Andriy Chebanov, and Svitlana Adamova. "Hybrid Power System Stochastic Optimization." In Modern Development Paths of Agricultural Production, 385–94. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14918-5_40.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Mankowski, Michal, and Mikhail Moshkov. "Optimal Paths in Directed Graphs." In Dynamic Programming Multi-Objective Combinatorial Optimization, 75–86. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-63920-4_7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Dutta, Binayak, and Sasanka Roy. "Approximate Shortest Paths in Polygons with Violations." In Combinatorial Optimization and Applications, 168–80. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36412-0_14.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Biswas, Sudip, Stephane Durocher, Debajyoti Mondal, and Rahnuma Islam Nishat. "Hamiltonian Paths and Cycles in Planar Graphs." In Combinatorial Optimization and Applications, 83–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31770-5_8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Hartvigsen, David. "Generalized max flows and augmenting paths." In Integer Programming and Combinatorial Optimization, 185–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59408-6_51.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Optimization paths"

1

Tang, Jia-Xiang, Shih-Hsu Huang, and Jui-Hung Hung. "ECO Timing Optimization with Data Paths and Clock Paths Considered." In 2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS). IEEE, 2021. http://dx.doi.org/10.1109/ispacs51563.2021.9650994.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Hu, Xiao-Bing, Jun Zhou, Hang Li, Ming-Kong Zhang, and Jian-Qin Liao. "Finding the k Shortest Paths for Co-Evolutionary Path Optimization." In 2018 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2018. http://dx.doi.org/10.1109/ssci.2018.8628928.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Migunova, L. G., A. L. Kuregyan, and E. S. Vorontsova. "Optimization of multi-educational learning paths." In 2016 11th International Forum on Strategic Technology (IFOST). IEEE, 2016. http://dx.doi.org/10.1109/ifost.2016.7884301.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Hu, Jiang, Ying Zhou, Yaoguang Wei, Steve Quay, Lakshmi Reddy, Gustavo Tellez, and Gi-Joon Nam. "Interconnect Optimization Considering Multiple Critical Paths." In ISPD '18: International Symposium on Physical Design. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3177540.3178237.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Swartzentruber, Levi, Jung Leng Foo, and Eliot Winer. "Three-Dimensional Multi-Objective UAV Path Planner Using Meta-Paths for Decision Making and Visualization." In 12th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2008. http://dx.doi.org/10.2514/6.2008-5830.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Chabbi, Milind, Xu Liu, and John Mellor-Crummey. "Call Paths for Pin Tools." In CGO '14: 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2544137.2544164.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Eveking, Hans, Stefan Höreth, and Johann Wolfgang Goethe. "Optimization and resynthesis of complex data-paths." In the 30th international. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/157485.165075.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Oskar, Wigström,. "Optimization of Hybrid Systems with Known Paths." In Analysis and Design of Hybrid Systems, edited by Heemels, Maurice, chair Giua, Alessandro and Heemels, Maurice. IFAC, Elsevier, 2012. http://dx.doi.org/10.3182/20120606-3-nl-3011.00007.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Werber, Jeurgen, Dieter Rautenbach, and Christian Szegedy. "Timing optimization by restructuring long combinatorial paths." In 2007 IEEE/ACM International Conference on Computer-Aided Design. IEEE, 2007. http://dx.doi.org/10.1109/iccad.2007.4397320.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Tarasyev, Alexandr A., Gavriil Agarkov, and Aleksandr Medvedev. "Optimization of educational paths for higher education." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2017 (ICCMSE-2017). Author(s), 2017. http://dx.doi.org/10.1063/1.5012334.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Optimization paths"

1

Wang, Chih-Hao. A Multi-Objective Optimization Model to Minimize the Gap in Accessibility to Multi-Use Paths While Maximizing the Economic Efficiency of Active Transportation Investments for Fresno, California. Mineta Transportation Institute, June 2020. http://dx.doi.org/10.31979/mti.2020.1913.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Wall, Blake, and Michael Lind. Cooperative 3D Path Optimization (C3PO) Simulation. Fort Belvoir, VA: Defense Technical Information Center, November 2015. http://dx.doi.org/10.21236/ada627595.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sato, H., and J. O. Royset. Path Optimization for the Resource-Constrained Searcher. Fort Belvoir, VA: Defense Technical Information Center, January 2008. http://dx.doi.org/10.21236/ada486479.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Li, Zhenjiang, and J. J. Garcia-Luna-Aceves. A Distributed Approach for Multi-Constrained Path Selection and Routing Optimization. Fort Belvoir, VA: Defense Technical Information Center, January 2006. http://dx.doi.org/10.21236/ada467530.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Crabbe, E., I. Minei, J. Medved, R. Varga, X. Zhang, and D. Dhody. Optimizations of Label Switched Path State Synchronization Procedures for a Stateful PCE. RFC Editor, September 2017. http://dx.doi.org/10.17487/rfc8232.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Lee, Y., D. King, and E. Oki. Path Computation Element Communication Protocol (PCEP) Requirements and Protocol Extensions in Support of Global Concurrent Optimization. RFC Editor, July 2009. http://dx.doi.org/10.17487/rfc5557.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Martinello, Martina. The Path to High Q-Factors in Superconducting Accelerating Cavities: Flux Expulsion and Surface Resistance Optimization. Office of Scientific and Technical Information (OSTI), December 2016. http://dx.doi.org/10.2172/1352032.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Choudhary, Ruplal, Victor Rodov, Punit Kohli, Elena Poverenov, John Haddock, and Moshe Shemesh. Antimicrobial functionalized nanoparticles for enhancing food safety and quality. United States Department of Agriculture, January 2013. http://dx.doi.org/10.32747/2013.7598156.bard.

Повний текст джерела
Анотація:
Original objectives The general goal of the project was to utilize the bactericidal potential of curcumin- functionalizednanostructures (CFN) for reinforcement of food safety by developing active antimicrobial food-contact surfaces. In order to reach the goal, the following secondary tasks were pursued: (a) further enhancement of the CFN activity based on understanding their mode of action; (b) preparing efficient antimicrobial surfaces, investigating and optimizing their performance; (c) testing the efficacy of the antimicrobial surfaces in real food trials. Background to the topic The project dealt with reducing microbial food spoilage and safety hazards. Cross-contamination through food-contact surfaces is one of the major safety concerns, aggravated by bacterial biofilm formation. The project implemented nanotech methods to develop novel antimicrobial food-contact materials based on natural compounds. Food-grade phenylpropanoidcurcumin was chosen as the most promising active principle for this research. Major conclusions, solutions, achievements In agreement with the original plan, the following research tasks were performed. Optimization of particles structure and composition. Three types of curcumin-functionalizednanostructures were developed and tested: liposome-type polydiacetylenenanovesicles, surface- stabilized nanoparticles and methyl-β-cyclodextrin inclusion complexes (MBCD). The three types had similar minimal inhibitory concentration but different mode of action. Nanovesicles and inclusion complexes were bactericidal while the nanoparticlesbacteriostatic. The difference might be due to different paths of curcumin penetration into bacterial cell. Enhancing the antimicrobial efficacy of CFN by photosensitization. Light exposure strengthened the bactericidal efficacy of curcumin-MBCD inclusion complexes approximately three-fold and enhanced the bacterial death on curcumin-coated plastic surfaces. Investigating the mode of action of CFN. Toxicoproteomic study revealed oxidative stress in curcumin-treated cells of E. coli. In the dark, this effect was alleviated by cellular adaptive responses. Under light, the enhanced ROS burst overrode the cellular adaptive mechanisms, disrupted the iron metabolism and synthesis of Fe-S clusters, eventually leading to cell death. Developing industrially-feasible methods of binding CFN to food-contact surfaces. CFN binding methods were developed for various substrates: covalent binding (binding nanovesicles to glass, plastic and metal), sonochemical impregnation (binding nanoparticles to plastics) and electrostatic layer-by-layer coating (binding inclusion complexes to glass and plastics). Investigating the performance of CFN-coated surfaces. Flexible and rigid plastic materials and glass coated with CFN demonstrated bactericidal activity towards Gram-negative (E. coli) and Gram-positive (Bac. cereus) bacteria. In addition, CFN-impregnated plastic material inhibited bacterial attachment and biofilm development. Testing the efficacy of CFN in food preservation trials. Efficient cold pasteurization of tender coconut water inoculated with E. coli and Listeriamonocytogeneswas performed by circulation through a column filled with CFN-coated glass beads. Combination of curcumin coating with blue light prevented bacterial cross contamination of fresh-cut melons through plastic surfaces contaminated with E. coli or Bac. licheniformis. Furthermore, coating of strawberries with CFN reduced fruit spoilage during simulated transportation extending the shelf life by 2-3 days. Implications, both scientific and agricultural BARD Report - Project4680 Page 2 of 17 Antimicrobial food-contact nanomaterials based on natural active principles will preserve food quality and ensure safety. Understanding mode of antimicrobial action of curcumin will allow enhancing its dark efficacy, e.g. by targeting the microbial cellular adaptation mechanisms.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

An Input Linearized Powertrain Model for the Optimal Control of Hybrid Electric Vehicles. SAE International, March 2022. http://dx.doi.org/10.4271/2022-01-0741.

Повний текст джерела
Анотація:
Models of hybrid powertrains are used to establish the best combination of conventional engine power and electric motor power for the current driving situation. The model is characteristic for having two control inputs and one output constraint: the total torque should be equal to the torque requested by the driver. To eliminate the constraint, several alternative formulations are used, considering engine power or motor power or even the ratio between them as a single control input. From this input and the constraint, both power levels can be deduced. There are different popular choices for this one control input. This paper presents a novel model based on an input linearizing transformation. It is demonstrably superior to alternative model forms, in that the core dynamics of the model (battery state of energy) are linear, and the non-linearities of the model are pushed into the inputs and outputs in a Wiener/Hammerstein form. The output non-linearities can be approximated using a quadratic model, which creates a problem in the linear-quadratic framework. This facilitates the direct application of linear control approaches such as LQR control, predictive control, or Model Predictive Control (MPC). The paper demonstrates the approach using the ELectrified Vehicle library for sImulation and Optimization (ELVIO). It is an open-source MATLAB/Simulink library designed for the quick and easy simulation and optimization of different powertrain and drivetrain architectures. It follows a modelling methodology that combines backward-facing and forward-facing signal path, which means that no driver model is required. The results show that the approximated solution provides a performance that is very close to the solution of the original problem except for extreme parts of the operating range (in which case the solution tends to be driven by constraints anyway).
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Optimization paths" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії