Results 31 to 40 of about 1,992 (151)

Sub‐optimal Internet of Thing devices deployment using branch and bound method

IET Networks, EarlyView.
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

Collaborative platooning and routing for mixed fleets of electric automated vehicles and conventional trucks

International Transactions in Operational Research, EarlyView.
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, Rudy R. Negenborn, Frederik Schulte   +2 more
wiley   +1 more source

Discounted Pseudocosts in MILP

CoRR
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

Proceedings of the AAAI Conference on Artificial Intelligence
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, Jianing Li, Yingying Gao, Shixuan Liu, Zijie Geng, Haoyang Liu 0002, Chao Chen 0026, Changjun Fan   +7 more
openaire   +2 more sources

An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations

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, Daniele Ferone, Paola Festa, Ornella Pisacane   +3 more
wiley   +1 more source

Compact MILP Formulations for the p-Center Problem [PDF]

, 2018
Lecture Notes in Computer Science ...
Alès, Zacharie, Elloumi, Sourour
openaire   +4 more sources

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

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, Francesca Da Ros, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf   +7 more
wiley   +1 more source

Code Retrieval for MILP Instance Generation

CoRR
Mixed-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

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

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, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +1 more source