Results 51 to 60 of about 3,912 (195)
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
ABSTRACT The Electric Traveling Salesman Problem (ETSP) is a variant of the well‐known TSP in which an electric vehicle must visit a set of customers minimizing the total cost of its route. The vehicle is assumed to be equipped with a battery of limited capacity that may need to be recharged along the route.
Alberto Ceselli +2 more
wiley +1 more source
The main stages of printed circuit board (PCB) manufacturing are the design, fabrication, assembly, and testing. This paper focuses on the scheduling of the pressing process, which is a part of the fabrication process of a multi-layer PCB and is a new ...
Teeradech Laisupannawong +2 more
doaj +1 more source
Energy Optimization Models for the Locomotive Assignment Problem
ABSTRACT Reducing energy consumption is a key objective in transportation. Using detailed infrastructure data, this study introduces the Green Locomotive Assignment Problem (GLAP) to minimize energy consumption in railway operations by efficiently assigning locomotives to pre‐scheduled trains.
Gislind Baumgartner +3 more
wiley +1 more source
В статье рассматривается классическая задача коммивояжёра (TSP) и её вариация для маршрутизации на графах с поворотными штрафами, когда стоимость маршрута зависит не только от выбранных рёбер, но и от последовательности двух смежных переходов (троек ...
Голод Г.М.
doaj +1 more source
Unit commitment with frequency‐arresting adequacy constraint: Modelling and pricing aspects
Frequency‐arresting (FA) adequacy has received an increasing attention in operation of power systems with intermittent, electronically connected wind and sfolar generation.
Ehsan Davari Nejad +2 more
doaj +1 more source
As the share of renewable energy in the energy mix continues to increase, the penetration of distributed renewable generation in distribution networks is also rising steadily. Loop‐closing operation provides an effective means to enhance renewable energy accommodation across different grid partitions.
Ningyu Zhang +6 more
wiley +1 more source
Discounted Pseudocosts in MILP
In this article, we introduce the concept of discounted pseudocosts, inspired by discounted total reward in reinforcement learning, and explore their application in mixed-integer linear programming (MILP). Traditional pseudocosts estimate changes in the objective function due to variable bound changes during the branch-and-bound process. By integrating
openaire +2 more sources
CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction
Mixed-Integer Linear Programming (MILP) is a cornerstone of combinatorial optimization, yet solving large-scale instances remains a significant computational challenge. Recently, Graph Neural Networks (GNNs) have shown promise in accelerating MILP solvers by predicting high-quality solutions.
Tianle Pu +7 more
openaire +2 more sources
Sub‐optimal Internet of Thing devices deployment using branch and bound method
The main contributions of this paper are (1) IoT network deployment problem formation as MILP problem to optimise the transmission among network nodes, and (2) New BB method with a machine learning function to reduce the computational complexity. Abstract The Internet of Thing (IoT) network deployments are widely investigated in 4G and 5G systems and ...
Haesik Kim
wiley +1 more source
Compact MILP Formulations for the p-Center Problem [PDF]
Lecture Notes in Computer Science ...
Alès, Zacharie, Elloumi, Sourour
openaire +4 more sources

