Results 21 to 30 of about 3,530,123 (298)

Time-Varying Heterotypic-Vehicle Cold Chain Logistics Distribution Path Optimization Model

open access: yes智慧农业, 2021
In view of the problems of constant speed and single carbon emission calculation method in the distribution model of fresh agricultural products in the transportation link of agricultural supply chain, combined with the time-varying characteristics of ...
LIU Siyuan   +4 more
doaj   +1 more source

Holographic path-integral optimization [PDF]

open access: yesJournal of High Energy Physics, 2021
Abstract In this work we elaborate on holographic description of the path-integral optimization in conformal field theories (CFT) using Hartle-Hawking wave functions in Anti-de Sitter spacetimes. We argue that the maximization of the Hartle-Hawking wave function is equivalent to the path-integral optimization procedure in CFT.
Jan Boruch   +3 more
openaire   +5 more sources

On the Path to Optimal Alchemistry

open access: yesThe Protein Journal, 2023
AbstractAlchemical free energy calculations have become a standard and widely used tool, in particular for calculating and comparing binding affinities of drugs. Although methods to compute such free energies have improved significantly over the last decades, the choice of path between the end states of interest is usually still the same as two decades
Lundborg, Magnus   +2 more
openaire   +2 more sources

Scanning path optimization of fiber detection device by using TSP

open access: yesXi'an Gongcheng Daxue xuebao, 2022
Optimizing the scanning path of the fiber detection device helps to further reduce the detection time and improve the detection efficiency. Considering that each fiber must be detected and detected only once, which has the basic characteristics of the ...
SUN Han, ZHOU Quan, YANG Zhijun
doaj   +1 more source

Path Optimization Sheaves

open access: yesCoRR, 2020
Motivated by efforts to incorporate sheaves into networking, we seek to reinterpret pathfinding algorithms in terms of cellular sheaves, using Dijkstra's algorithm as an example. We construct sheaves on a graph with distinguished source and sink vertices, in which paths are represented by sections.
Michael Moy   +5 more
openaire   +2 more sources

Optimal path to epigenetic switching [PDF]

open access: yesPhysical Review E, 2005
5 pages. 2 figures, uses revtex 4.
Roma, D. M.   +4 more
openaire   +4 more sources

Sample-path optimization in simulation [PDF]

open access: yesProceedings of Winter Simulation Conference, 2005
This paper summarizes information about a method, called sample-path optimization, for optimizing performance functions in certain stochastic systems that can be modeled by simulation. We explain the method, give conditions under which it converges, and display some sample calculations that indicate how it performs.
Guerkan, G., Oezge, A.Y., Robinson, S.M.
openaire   +2 more sources

Thermodynamic Metrics and Optimal Paths [PDF]

open access: yesPhysical Review Letters, 2012
A fundamental problem in modern thermodynamics is how a molecular-scale machine performs useful work, while operating away from thermal equilibrium without excessive dissipation. To this end, we derive a friction tensor that induces a Riemannian manifold on the space of thermodynamic states.
Sivak, David A., Crooks, Gavin E.
openaire   +5 more sources

Optimal Colorings with Rainbow Paths [PDF]

open access: yesGraphs and Combinatorics, 2017
Let $G$ be a connected graph of chromatic number $k$. For a $k$-coloring $f$ of $G$, a full $f$-rainbow path is a path of order $k$ in $G$ whose vertices are all colored differently by $f$. We show that $G$ has a $k$-coloring $f$ such that every vertex of $G$ lies on a full $f$-rainbow path, which provides a positive answer to a question posed by Lin ...
Oliver Bendele, Dieter Rautenbach
openaire   +2 more sources

Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks [PDF]

open access: yes, 2010
Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc ...
Yang, S   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy