-
作者：Wu, Lingxiao; Adulyasak, Yossiri; Cordeau, Jean-Francois; Wang, Shuaian
作者单位：Universite de Montreal; Universite de Montreal; HEC Montreal; Hong Kong Polytechnic University
摘要：Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocation problem and the pilotage planning problem are solved sequentially, leading to suboptimal or even infeasible solutions for vessel services. This paper investigates a vessel service planning problem (VSPP) in seaports that addresses berth allocation and pilotage planning in combination. We introduce a compact mixed-integer linear programm...
-
作者：Qu, Zihao; Dawande, Milind; Janakiraman, Ganesh
作者单位：University of Texas System; University of Texas Dallas; University of Texas System; University of Texas Dallas; University of Texas System; University of Texas Dallas
摘要：Motivated by an application at a postacute healthcare provider, we study an infinite-horizon, stochastic optimization problem with a set of long-term capacity investment decisions and a sequence of real-time order acceptance/rejection decisions. The goal is to maximize the long-run average expected profit per period. The firm employs full-time resources of various kinds, such as nurses and therapists. For each kind of resource, multiple types are available. For example, registered nurses (RNs)...
-
作者：Moyal, Pascal; Perry, Ohad
作者单位：Universite de Lorraine; Northwestern University
摘要：The fundamental problem in the study of parallel-server systems is that of finding and analyzing routing policies of arriving jobs to the servers that efficiently balance the load on the servers. The most well-studied policies are (in decreasing order of efficiency) join the shortest workload (JSW), which assigns arrivals to the server with the least workload; join the shortest queue (JSQ), which assigns arrivals to the smallest queue; the power-of-d (PW(d)), which assigns arrivals to the shor...
-
作者：Baek, Jackie; Ma, Will
作者单位：Massachusetts Institute of Technology (MIT); Columbia University
摘要：Network revenue management (NRM) describes a general online allocation problem in which combinations of capacity-constrained resources are sold to a stream of arriving customers. Existing papers propose one-size-fits-all methods for controlling the resource capacities over time. In this paper, we study how different methods can be used to control different resource constraints based on the network structure of each instance. Specifically, we propose a heuristic that bifurcates the resources of...
-
作者：Feldman, Jacob; Segev, Danny
作者单位：Washington University (WUSTL); Tel Aviv University
摘要：In this paper, we consider the assortment problem under the multinomial logit (MNL) model with sequential offerings recently proposed by Liu et al. [INFORMS J. Comput., 2020] to capture a multitude of applications, ranging from appointment scheduling in hospitals, restaurants, and fitness centers to product recommendations in e-commerce settings. In this problem, the purchasing dynamics of customers sequentially unfold over T stages. Within each stage, the retailer selects an assortment of pro...
-
作者：Balseiro, Santiago R.; Mirrokni, Vahab; Leme, Renato Paes; Zuo, Song
作者单位：Columbia University; Alphabet Inc.; Google Incorporated
摘要：We study the problem of designing dynamic double auctions for two-sided markets in which a platform intermediates the trade between one seller offering independent items to multiple buyers, repeatedly over a finite horizon, when agents have private values. Motivated by online platforms for advertising, ride-sharing, and freelancing markets, we seek to design mechanisms satisfying the following properties: no positive transfers, that is, the platform never asks the seller to make payments nor a...
-
作者：Anderson, Edward; Chen, Bo; Shao, Lusheng
作者单位：University of Sydney; Imperial College London; University of Warwick; University of Melbourne
摘要：We introduce a general model for suppliers competing for a buyer's procurement business. The buyer faces uncertain demand, and there is a requirement to reserve capacity in advance of knowing the demand. Each supplier has costs that are twodimensional, with some capacity costs incurred prior to production and some production costs incurred at the time of delivery. These costs are general functions of quantity, and this naturally leads us to a supply function competition framework in which each...
-
作者：Lin, Meichun; Huh, Woonghee Tim; Krishnan, Harish; Uichanco, Joline
作者单位：University of British Columbia; University of Michigan System; University of Michigan
摘要：We consider the data-driven newsvendor problem in which a manager makes inventory decisions sequentially and learns the unknown demand distribution based on observed samples of continuous demand (no truncation). We study the widely used sample average approximation (SAA) approach and analyze its performance with respect to regret, which is the difference between its expected cost and the optimal cost of the clairvoyant who knows the underlying demand distribution. We characterize how the regre...
-
作者：Furini, Fabio; Ljubic, Ivana; Malaguti, Enrico; Paronuzzi, Paolo
作者单位：Consiglio Nazionale delle Ricerche (CNR); Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti (IASI-CNR); ESSEC Business School; University of Bologna
摘要：Given an undirected graph, we study the capacitated vertex separator problem that asks to find a subset of vertices of minimum cardinality, the removal of which induces a graph having a bounded number of pairwise disconnected shores (subsets of vertices) of limited cardinality. The problem is of great importance in the analysis and protection of communication or social networks against possible viral attacks and for matrix decomposition algorithms. In this article, we provide a new bilevel int...
-
作者：Shahmoradi, Zahed; Lee, Taewoo
作者单位：University of Houston System; University of Houston
摘要：Inverse linear programming (LP) has received increasing attention because of its potential to infer efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and corresponding forward solutions from the existing inverse LP methods can be highly sensitive to noise, errors, and uncertainty in the input data, limiting their applicability in data-driven settings. We introduce the notion of inverse and forward stability i...
