相关论文: An Exact Method for the Daily Package Shipment Pro…

This paper examines the generalisation of the Pickup and Delivery Problem that allows mid-route load exchanges among vehicles and obeys strict time-windows at all locations. We propose a novel Logic-Based Benders Decomposition (LBBD) that…

In this paper, we investigate a supply chain network with a supplier and multiple retailers. The supplier can either take orders from retailers directly, or choose to build a warehouse somewhere in the network to centralize the ordering…

This paper presents a physical layer network coding (PNC) approach for network MIMO (N-MIMO) systems to release the heavy burden of backhaul load. The proposed PNC approach is applied for uplink scenario in binary systems, and the design…

The proliferation of large-scale AI and data-intensive applications has driven the development of Computing Power Networks (CPN). It is a key paradigm for delivering ubiquitous, on-demand computational services with high efficiency.…

Discrete Optimal Transport problems give rise to very large linear programs (LP) with a particular structure of the constraint matrix. In this paper we present a hybrid algorithm that mixes an interior point method (IPM) and column…

The load pick-up (LPP) problem searches the optimal configuration of the electrical distribution system (EDS), aiming to minimize the power loss or provide maximum power to the load ends. The piecewise linearization (PWL) approximation…

Managing delivery deadlines in automated warehouses and factories is crucial for maintaining customer satisfaction and ensuring seamless production. This study introduces the problem of online multi-agent pickup and delivery with task…

Ready Mixed Concrete Delivery Problem (RMCDP) is a multi-objective multi-constraint dynamic combinatorial optimization problem. From the operational research prospective, it is a real life logistic problem that is hard to be solved with…

Research on container loading problems has been proved effective in increasing the filling rate of containers in different practical situations. However, the broader logistic context might pressure the loading process, leading to…

Process Planning and Scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research use iterative methods to solve such problems; however, they cannot achieve satisfactory results…

Electric utility companies perform numerous technical interventions every day. Since it is generally not possible to complete all planned interventions within a single day, companies face two objectives: maximizing the total duration of…

This paper introduces a new optimization model that integrates the multi-port stowage planning problem with the container relocation problem. This problem is formulated as a binary mathematical programming model that must find the…

Online Freight Exchange Systems (OFEX) play a crucial role in modern freight logistics by facilitating real-time matching between shippers and carrier. However, efficient combinatorial bundling of transporation jobs remains a bottleneck. We…

This paper proposes a mathematical model for the design of a two-echelon supply chain where a set of suppliers serve a set of terminal facilities that receive uncertain customer demands. This model integrates a number of system decisions in…

This paper proposes a novel reinforcement learning framework to address the Liner Shipping Network Design Problem (LSNDP), a challenging combinatorial optimization problem focused on designing cost-efficient maritime shipping routes.…

In this paper, we consider the Delay Constrained Unsplittable Shortest Path Routing problem which arises in the field of traffic engineering for IP networks. This problem consists, given a directed graph and a set of commodities, to compute…

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each to a specified target location. Appearing in the context of…

In this work, a novel idea is presented for combinatorial optimization problems, a hybrid network, which results in a superior outcome. We applied this method to graph pointer networks [1], expanding its capabilities to a higher level. We…

Interplanetary networks (IPNs) present unique challenges such as extreme delay, high loss, and frequent disruptions that severely degrade the performance of conventional transport protocols like Transmission Control Protocol (TCP) and Quick…

We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a predefined velocity and is only allowed to move along the edges…