Results 61 to 70 of about 3,912 (195)
IET Smart Energy Systems, EarlyView.A PER‐MATD3‐based bidding model for generators in day‐ahead joint energy and reserve markets is proposed. An aggressiveness coefficient quantifies risk preference, KAN improves interpretability and simulation results demonstrate enhanced coordinated decision‐making and training stability.
Xinge Xu +5 more
wiley +1 more source
تعیین عمق و زمان بهینه گذار از روش استخراج روباز به زیرزمینی در معدن مس سونگون [PDF]
نشریه مهندسی معدنذخایر معدنی نزدیک به سطح با گسترش عمقی و شیب زیاد، قابلیت استخراج با روش روباز، زیرزمینی و یا ترکیبی از این دو روش را دارد. گذار از معدن روباز به زیرزمینی یکی از مسایل چالش برانگیز مهندسی معدن است. معادنی که قابلیت گذار را دارند، در نهایت به یک نقطه گذار
ناصر بدخشان +2 more
doaj +1 more source
Code Retrieval for MILP Instance Generation
CoRRMixed-Integer Linear Programming (MILP) is widely used in fields such as scheduling, logistics, and planning. Enhancing the performance of MILP solvers, particularly learning-based solvers, requires substantial amounts of high-quality data. However, existing methods for MILP instance generation typically necessitate training a separate model for each ...
Tianxing Yang, Huigen Ye, Hua Xu 0003
openaire +2 more sources
Comprehensive and representative conservation planning for biodiversity of ice‐free Antarctica
Conservation Biology, EarlyView.Abstract Antarctica is designated as a natural reserve devoted to peace and science, with Antarctic Specially Protected Areas (ASPAs) serving as the primary instrument for area‐based biodiversity protection. However, the existing ASPA network lacks the comprehensiveness and representativeness required under Annex V, Article 3(2), of the Madrid Protocol.
Wen Wen +3 more
wiley +1 more source
International Transactions in Operational Research, EarlyView.Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri +3 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
To MILP or not to MILP? On AI techniques for the design and optimization of real-time systems
Real-Time SystemsAbstract Artificial intelligence (AI) is becoming increasingly relevant in many contexts. In embedded real-time systems, most of the previous research has focused on real-time guarantees for AI workloads (RT-for-AI). Instead, this position paper discusses the potential benefits and application cases of the complementary direction of using AI ...
openaire +2 more sources
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
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
An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
Mathematics, 2018 Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications.
Tamer F. Abdelmaguid
doaj +1 more source