Results 111 to 120 of about 50,463 (272)
Editorial: Modeling and optimization of renewable energy systems by using novel approaches
Frontiers in Energy Research, 2022 Mohammad Alhuyi Nazari +3 more
doaj +1 more source
Mesh Processing Non‐Meshes via Neural Displacement Fields
Computer Graphics Forum, EarlyView.Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
Multiobjective Evolutionary Topology Optimization Algorithm Using Quadtree Encoding
IEEE AccessA multiobjective high-degree-of-freedom design optimization algorithm that enables topological changes in design is proposed for multiobjective aerodynamic design optimization. In this method, a design is encoded using a regional quadtree, which is often
Naruhiko Nimura, Akira Oyama
doaj +1 more source
Integrated location–inventory planning for slow‐moving demands with waiting time limitations
International Transactions in Operational Research, EarlyView.Abstract This paper studies a stochastic facility location problem integrated with inventory and transportation decisions (SFLPIT) for supply chains with slow‐moving stock‐keeping units (SKUs). Local stores often avoid maintaining such SKUs, resulting in customer demand being fulfilled directly by a central distribution center (DC), where the ...
Jie Chu +4 more
wiley +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
Performance assessment of multiobjective optimizers: an analysis and review
IEEE Transactions on Evolutionary Computation, 2003 E. Zitzler +4 more
semanticscholar +1 more source
International Transactions in Operational Research, Volume 34, Issue 1, Page 460-500, January 2027.Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia +2 more
wiley +1 more source
Straddle carrier routing optimization at container terminals utilizing telemetry‐based prediction
International Transactions in Operational Research, Volume 34, Issue 1, Page 429-459, January 2027.Abstract Efficient vehicle routing and scheduling for horizontal transport means on container terminals can reduce lead times and travel distances, resulting in fuel savings and productivity gains. We apply machine learning to emulate operational processes, bridging the gap between theoretical optimization models and real‐world practices at container ...
Julian Neugebauer +3 more
wiley +1 more source
International Transactions in Operational Research, Volume 33, Issue 6, Page 4039-4071, November 2026.Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz +3 more
wiley +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source