Results 91 to 100 of about 37,139 (224)
A unified formulation for home healthcare routing and scheduling problems
International Transactions in Operational Research, EarlyView.Abstract Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently.
Sara Ceschia +7 more
wiley +1 more source
A MILP for multi-machine injection moulding sequencing in the scope of C2NET Project
International Journal of Production Management and Engineering, 2018 The goal of C2NET European H2020 Funded Project is the creation of cloud-enabled tools for supporting the SMEs supply network optimization of manufacturing and logistic assets based on collaborative demand, production and delivery plans.
Beatriz Andrés +4 more
doaj +1 more source
Robustness Verification for Classifier Ensembles
, 2020 We give a formal verification procedure that decides whether a classifier ensemble is robust against arbitrary randomized attacks. Such attacks consist of a set of deterministic attacks and a distribution over this set.
Gross, Dennis +3 more
core
International Transactions in Operational Research, EarlyView.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
Energies, 2019 In this paper, the mixed integer linear programming (MILP) for solving unit commitment (UC) problems in a hybrid power system containing thermal, hydro, and wind power have been studied.
Bo Fu +4 more
doaj +1 more source
Scheduling optimization of optical lens polishing
International Transactions in Operational Research, EarlyView.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
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
EnergiesThis paper proposes a hybrid optimization framework that synergizes mixed-integer linear programming (MILP) and reinforcement learning (RL) to minimize operational costs and carbon emissions in multi-zonal data centers integrated with renewable ...
Abubakar Rafique +7 more
doaj +1 more source
A Comparison of Exact Method - Metaheuristic Method in Determination for Vehicle Routing Problem
MATEC Web of Conferences, 2018 This paper will address Vehicle Routing Problem with Time Windows (VRPTW) for single product. VRPTW is developed from its basic model called by Vehicle Routing Problem (VRP).
Nuha Hilyatun +2 more
doaj +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, EarlyView.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