-
作者：Toriello, Alejandro; Haskell, William B.; Poremba, Michael
作者单位：University System of Georgia; Georgia Institute of Technology; University of Southern California
摘要：We propose a dynamic traveling salesman problem (TSP) with stochastic arc costs motivated by applications, such as dynamic vehicle routing, in which the cost of a decision is known only probabilistically beforehand but is revealed dynamically before the decision is executed. We formulate this as a dynamic program (DP) and compare it to static counterparts to demonstrate the advantage of the dynamic paradigm over an a priori approach. We then apply approximate linear programming (ALP) to overco...
-
作者：Cote, Jean-Francois; Gendreau, Michel; Potvin, Jean-Yves
作者单位：Laval University; Universite de Montreal; Laval University; Universite de Montreal; Polytechnique Montreal; Universite de Montreal; Universite de Montreal
摘要：This paper describes an exact algorithm for solving a two-dimensional orthogonal packing problem with unloading constraints, which occurs as a subproblem of mixed vehicle routing and loading problems. The packing considered in this work is basically a feasibility problem involving a single bin. The problem is addressed through a decomposition approach wherein a branch-and-cut algorithm is designed for solving a one-dimensional relaxation of the original problem. When an integer solution is fou...
-
作者：Keskin, N. Bora; Zeevi, Assaf
作者单位：University of Chicago; Columbia University
摘要：We consider a monopolist who sells a set of products over a time horizon of T periods. The seller initially does not know the parameters of the products' linear demand curve, but can estimate them based on demand observations. We first assume that the seller knows nothing about the parameters of the demand curve, and then consider the case where the seller knows the expected demand under an incumbent price. It is shown that the smallest achievable revenue loss in T periods, relative to a clair...
-
作者：Armstrong, Michael J.
作者单位：Brock University
摘要：This paper develops a model of short-range ballistic missile defense and uses it to study the performance of Israel's Iron Dome system. The deterministic base model allows for inaccurate missiles, unsuccessful interceptions, and civil defense. Model enhancements consider the trade-offs in attacking the interception system, the difficulties faced by militants in assembling large salvos, and the effects of imperfect missile classification by the defender. A stochastic model is also developed. An...
