Academic literature on the topic 'Optimization paths'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Optimization paths.'
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.
Journal articles on the topic "Optimization paths"
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.
Full textKAMIMURA, 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.
Full textBoissier, 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.
Full textDenkena, 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.
Full textYan, 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.
Full textShi 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.
Full textLiñá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.
Full textSheppard, 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.
Full textWigströ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.
Full textTarasyev, 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.
Full textDissertations / Theses on the topic "Optimization paths"
Lorek, David Randolph. "Approximating shortest paths in large networks /." Electronic version (PDF), 2005. http://dl.uncw.edu/etd/2005/lorekd/davidlorek.pdf.
Full textStout, Kevin Dale. "Design optimization of thermal paths in spacecraft systems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82492.
Full textThis 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.
Wang, I.-Lin. "Shortest paths and multicommodity network flows." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23304.
Full textChou, 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.
Full textGarcia, Renan. "Resource constrained shortest paths and extensions." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28268.
Full textCommittee 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.
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.
Full textNilsson, 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.
Full textTurner, 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.
Full textHeni, 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.
Full textIn 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.
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.
Full textPlanerare 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
Books on the topic "Optimization paths"
Extremal paths in graphs: Foundations, search strategies, and related topics. Berlin: Akademie Verlag, 1997.
Find full textRoss, Ron S. Planning minimum-energy paths in an off-road environment with anisotropic traversal costs and motion constraints. Monterey, Calif: Naval Postgraduate School, 1989.
Find full textRobinett, 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.
Find full textservice), SpringerLink (Online, ed. Path Player Games: Analysis and Applications. Boston, MA: Springer-Verlag US, 2009.
Find full textEl-Taha, Muhammad. Sample-Path Analysis of Queueing Systems. Boston, MA: Springer US, 1999.
Find full textZhongguo 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.
Find full textZhongguo 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.
Find full textZhongguo 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.
Find full textZiegelmann, Dr Mark. Constrained Shortest Paths and Related Problems: Constrained Network Optimization. VDM Verlag Dr. Müller, 2010.
Find full textHuckenbeck, Ulrich. Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics (Mathematical Topics). VCH Publishers, 1998.
Find full textBook chapters on the topic "Optimization paths"
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.
Full textEl 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.
Full textJiang, 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.
Full textMaheshwari, 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.
Full textCohen, 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.
Full textLysenko, 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.
Full textMankowski, 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.
Full textDutta, 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.
Full textBiswas, 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.
Full textHartvigsen, 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.
Full textConference papers on the topic "Optimization paths"
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.
Full textHu, 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.
Full textMigunova, 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.
Full textHu, 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.
Full textSwartzentruber, 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.
Full textChabbi, 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.
Full textEveking, 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.
Full textOskar, 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.
Full textWerber, 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.
Full textTarasyev, 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.
Full textReports on the topic "Optimization paths"
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.
Full textWall, 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.
Full textSato, 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.
Full textLi, 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.
Full textCrabbe, 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.
Full textLee, 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.
Full textMartinello, 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.
Full textChoudhary, 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.
Full textAn 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.
Full text