Results 91 to 100 of about 5,473,828 (218)
Straddle carrier routing optimization at container terminals utilizing telemetry‐based prediction
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
This paper considers the problem of scheduling a set of jobs on unrelated parallel machines subject to several constraints which are non-zero arbitrary release dates, limited additional resources, and non-anticipatory sequence-dependent setup times.
Ibrahim M. Al-harkan, Ammar A. Qamhan
doaj +1 more source
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
Scalable Parallel Verification of Quantized Neural Networks via MIQCP Optimization Encoding
Quantized Neural Networks are widely used in safety-critical systems due to their efficiency, yet they remain vulnerable to adversarial perturbations. Existing verification approaches based on the Big- $M$ Mixed-Integer Linear Programming (MILP) suffer ...
Shifu Yang, Wuyang Yang
doaj +1 more source
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira +1 more
wiley +1 more source
Scheduling optimization of optical lens polishing
Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley +1 more source
FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver [PDF]
We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an opportunistic computing environment provided by the Condor resource management system.
Linderoth, Jeff +2 more
core
This paper investigates a distributed optimization approach for solving mixed integer linear programming (MILP) problems with a coupling constraint over unbalanced directed networks.
Gakuto Ogawa +2 more
doaj +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
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
Energy Flexibilization and Demand Response for a Novel Decentralized Power‐to‐Methanol Process
This study presents the results of an optimization framework for the scheduling of a Power‐to‐methanol process coupled with an electrolyser, renewable energy sources and a battery. The optimal dynamic operating schedule is computed with different configurations and boundary conditions, showing the advantages of flexible operation.
Max Kollmer +5 more
wiley +1 more source

