Results 91 to 100 of about 26,837 (219)
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
A Scheduling Model for Optimizing Joint UAV-Truck Operations in Last-Mile Logistics Distribution
This paper investigates the joint scheduling problem of unmanned aerial vehicles (UAVs) and trucks for community logistics, where UAVs act as service providers for last-mile delivery and trucks serve as mobile storage platforms for drone deployment.
Xiaocheng Liu +4 more
doaj +1 more source
In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints.
Camisa, Andrea +2 more
core +1 more source
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
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel +2 more
wiley +1 more source
Hydrogen to Power: Exploring Current Developments and Future Challenges
As the interest in low‐carbon energy systems grows, hydrogen continues to attract attention as a flexible energy carrier for power applications. Developments in hydrogen production, storage, transport, and utilization are explored. In addition, the deployment challenges of hydrogen energy vector related to economics, infrastructure, safety, and ...
Md. Shafiullah +6 more
wiley +1 more source
Source-grid-load-storage coordinated operation control is an operation mode and technology that can maximize the utilization of energy resources, and can economically, efficiently and securely improve the power dynamic balance capability of power systems
ZHU Jianguo +5 more
doaj +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
The quick growth of energy consumption in urban rail transit has drawn much attention due to the pressure of both operational cost and environmental responsibilities. In this paper, the timetable is optimized with respect to the system cost of urban rail
Huanhuan Lv +4 more
doaj +1 more source

