-
作者：Long, Jiancheng; Huang, Hai-Jun; Gao, Ziyou; Szeto, W. Y.
作者单位：Hefei University of Technology; Beihang University; Beijing Jiaotong University; University of Hong Kong
摘要：In this paper a novel variational inequality (VI) formulation of the dynamic user optimal (DUO) route choice problem is proposed using the concept of approach proportion. An approach proportion represents the proportion of travelers that select a turning or through movement when leaving a node. Approach proportions contain travelers' route information so that the realistic effects of physical queues can be captured in a formulation when a physical-queue traffic flow model is adopted, and so th...
-
作者：Bertsimas, Dimitris; Nasrabadi, Ebrahim; Stiller, Sebastian
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); Technical University of Berlin
摘要：We study network flow problems in an uncertain environment from the viewpoint of robust optimization. In contrast to previous work, we consider the case that the network parameters (e.g., capacities) are known and deterministic, but the network structure (e.g., nodes and arcs) is subject to uncertainty. In this paper, we study the robust and adaptive versions of the maximum flow problem and minimum cut problems in networks with node and arc failures, and establish structural and computational ...
-
作者：Rustogi, Kabir; Strusevich, Vitaly A.
作者单位：University of Greenwich
摘要：We consider the classical scheduling problems of processing jobs on identical parallel machines to minimize (i) the makespan (the maximum completion time) or (ii) the total flow time (the sum of the completion times). The focus of this study is on the impact that additional machines may have, if added to the system. We measure such a machine impact by the ratio of the value of the objective function computed with the original number of machines to the one computed with extra machines. We give ...
