-
作者：Perakis, Georgia; Roels, Guillaume
作者单位：Massachusetts Institute of Technology (MIT); University of California System; University of California Los Angeles
摘要：In urban transportation planning, it has become critical (1) to determine the travel time of a traveler and how it is affected by congestion, and (2) to understand how traffic distributes in a transportation network. In the first part of this paper, we derive an analytical function of travel time, based on the theory of kinematic waves. This travel-time function integrates the traffic dynamics as well as the effects of shocks. Numerical examples demonstrate the quality of the analytical functi...
-
作者：Ceselli, Alberto; Righini, Giovanni
作者单位：University of Milan
摘要：The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with different costs. We present a branch-and-price algorithm that is the first exact algorithm for the MGAP. It is based on a decomposition into a master problem with set-partitioning constraints and a pricing subproblem that is a multiple-choice knapsack problem. We report on our computational experience with randomly gene...
-
作者：Blazewicz, Jacek; Oguz, Ceyda; Swiercz, Aleksandra; Weglarz, Jan
作者单位：Poznan University of Technology; Polish Academy of Sciences; Institute of Bioorganic Chemistry of the Polish Academy of Sciences; Koc University
摘要：An innovative approach to DNA sequencing by hybridization utilizes isothermic oligonucleotide libraries. In this paper, we demonstrate the utility of a genetic algorithm for the combinatorial portion of this new approach by incorporating characteristics of DNA sequencing by hybridization in addition to isothermic oligonucleotide libraries. Specialized crossover and mutation operators were developed for this purpose. After initial experiments for parameter adjustment, the performance of the gen...
-
作者：Washburn, Alan
作者单位：United States Department of Defense; United States Navy; Naval Postgraduate School
摘要：This paper deals with the conflict between simplicity and optimality in searching for a stationary target whose location is distributed in two dimensions, thus continuing an analysis that was begun in World War II. The search is assumed to be of the piled-slab type, where each slab consists of a uniform search of some simple region. The measure of simplicity is the number of regions (smaller is simpler). If each of a fixed number of elliptical regions is searched randomly, we find the optimal ...
