Related papers: Solving the Integrated Bin Allocation and Collecti…
This paper presents an iteration method for solving linear particle transport problems in binary stochastic mixtures. It is based on nonlinear projection approach. The method is defined by a hierarchy of equations consisting of the…
In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth…
We consider the worst-case load-shedding problem in electric power networks where a number of transmission lines are to be taken out of service. The objective is to identify a pre-specified number of line outage that leads to the maximum…
In this paper, we investigate vehicle routing problems with third-party transshipment facilities that arise in the context of city logistics. Contrary to classical vehicle routing problems, where each customer request is delivered directly…
Electric Vehicles (EVs) are becoming increasingly prevalent nowadays, with studies highlighting their potential as mobile energy storage systems to provide grid support. Realising this potential requires effective charging coordination,…
Bin Packing with Conflicts (BPC) are problems in which items with compatibility constraints must be packed in the least number of bins, not exceeding the capacity of the bins and ensuring that non-conflicting items are packed in each bin.…
In recent years, it has become crucial to improve the resilience of electricity distribution networks (DNs) against storm-induced failures. Microgrids enabled by Distributed Energy Resources (DERs) can significantly help speed up…
In this paper, a non-linear p-robust hub location problem is extended to a risky environment where augmented chance constraint with a min-max regret form is employed to consider network risk as one of the objectives. The model considers…
In this work, we study the square min-sum bin packing problem (SMSBPP), where a list of square items has to be packed into indexed square bins of dimensions $1 \times 1$ with no overlap between the areas of the items. The bins are indexed…
The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi…
This paper investigates a specific instance of the static repositioning problem within station-based bike-sharing systems. Our study incorporates operational and damaged bikes, a heterogeneous fleet, and multiple visits between stations and…
This paper examines Mixed-Integer Multi-Level problems with Sequential Followers (MIMLSF), a specialized optimization model aimed at enhancing upper-level decision-making by incorporating anticipated outcomes from lower-level sequential…
Bike-sharing systems have been regarded as a critical component of solutions towards the transition to greener and more sustainable transportation, with the benefits of reducing carbon emissions, improving public health, and mitigating…
In this paper, we consider a probabilistic set covering problem (PSCP) in which each 0-1 row of the constraint matrix is random with a finite discrete distribution, and the objective is to minimize the total cost of the selected columns…
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the presence of skewed data, sophisticated redistribution…
In recent years, the throughput requirements of e-commerce fulfillment warehouses have seen a steep increase. This has resulted in various automation solutions being developed for item picking and movement. In this paper, we address the…
The optimal mass transport problem gives a geometric framework for optimal allocation, and has recently gained significant interest in application areas such as signal processing, image processing, and computer vision. Even though it can be…
A major issue for policy makers and planners is the definition of the "ideal" regional partition, i.e. the delimitation of sub-regional domains showing a sufficient level of homogeneity with respect to some specific territorial features. In…
The Bin Packing Problem involves efficiently packing items into a limited number of bins without exceeding their capacity. In this paper, we try to answer a specific question in this field. Mathematically the combinatorial optimization…
We present an approach for solving to optimality the budget-constrained Dynamic Uncapacitated Facility Location and Network Design problem (DUFLNDP). This is a problem where a network must be constructed or expanded and facilities placed in…