We illustrate how integer linear programming techniques can be applied to the popular game of poker Texas Hold'em in order to evaluate the strength of a hand. In particular, we give models aimed at (i) minimizing ...
详细信息
ISBN:
(纸本)9789616165402
We illustrate how integer linear programming techniques can be applied to the popular game of poker Texas Hold'em in order to evaluate the strength of a hand. In particular, we give models aimed at (i) minimizing the number of features that a player should look at when estimating his winning probability (called his equity);(ii) giving weights to such features so that the equity is approximated by the weighted sum of the selected features. We show that ten features or less are enough to estimate the equity of a hand with high precision.
The Upper Chattahoochee Watershed supplies most of the drinking water to the Atlanta Metropolitan Area, a region with one of the fastest urban growth rates in the United States. Smart conservation planning is necessar...
详细信息
The Upper Chattahoochee Watershed supplies most of the drinking water to the Atlanta Metropolitan Area, a region with one of the fastest urban growth rates in the United States. Smart conservation planning is necessary to conciliate urban development and the provision of critical ecosystem services (ESs) such as water quality, carbon storage, and wildlife habitat. We employed optimization models to compare the value of the ESs provided by alternative allocations of land parcels for conservation. We adopted boundary penalties to determine the trade-offs of choosing higher connectivity among parcels regarding economic values provided by carbon storage, wildlife habitat, and water quality. We used InVEST models to quantify and map ESs and value transfer to assign economic values to them. We set low and high ESs economic value bounds and discounted their values to perpetuity using 3% and 7% discount rates. Our results indicate that incorporating boundary penalties results in solutions with larger, fewer, and more connected parcels but yields lower economic benefits than unconstrained models. However, these differences are relatively small (between 2.6% and 7.3% loss in economic value). Additional transaction costs of purchasing more parcels and improving ecological networks provided by larger forest patches might justify the selection of solutions with higher connectivity. Decision-makers can use the developed models for estimating the economic cost of selecting connected parcels for conservation purposes at the landscape level.
Optical network-on-chip (ONoC) is an emerging upgrade for electronic network-on-chip (ENoC). As a kind of ONoC, wavelength-routed ONoC (WRONoC) shows ultrahigh bandwidth and ultralow latency in data communication. Man...
详细信息
Optical network-on-chip (ONoC) is an emerging upgrade for electronic network-on-chip (ENoC). As a kind of ONoC, wavelength-routed ONoC (WRONoC) shows ultrahigh bandwidth and ultralow latency in data communication. Manually designed WRONoC topologies typically reserve all to all links. This causes the waste of resources. Topology customization for each individual communication network can save resources, but requires automation for efficient design. The state-of-the-art design automation method is not efficient and does not support crosstalk analysis and signal-to-noise ratio (SNR) optimization. Moreover, the state of the art does not consider the physical locations of the data sending/receiving ports, causing unavoidable detours and crossings in the physical layout. In this work, we present FAST+: an automatic topology customization and optimization method. Compared with the state of the art, FAST+ operates much more efficiently and proposes a concrete router-level crosstalk-analysis method and a novel SNR optimization algorithm. This work also provides solutions to avoid detours and crossings in the physical layout. When SNR optimization is not enabled, experimental results show that FAST+ runs thousands times faster than the state of the art on average while providing multiple better or equally good topologies regarding resource usage and the worst case insertion loss. When SNR optimization is enabled, FAST+ provides 1.75x better worst case SNR on average after the optimization while not sacrificing resource usage and the worst case insertion loss.
Parameter control involves dynamically adjusting the parameter values of the evolutionary algorithm throughout the optimization process, including parameters like mutation rate and operator selection. Self-adaptation ...
详细信息
In the presence of distributed energy resources (DERs), distribution networks (DNs) operate in multiple configurations. Maintaining complete observability is essential for the monitoring of the network during operatio...
详细信息
In the presence of distributed energy resources (DERs), distribution networks (DNs) operate in multiple configurations. Maintaining complete observability is essential for the monitoring of the network during operation in any configuration. This article proposes a methodology for the optimal deployment of micro-phasor measurement units ($\mu$PMUs) in a DN operating in multiple configurations. A composite objective function has been formulated to minimize the number of $\mu$PMUs while maximizing measurement redundancy. The optimal solution has been obtained considering the $\mu$PMU with or without channel limits. The constraints have been formed simultaneously to cover all operational configuration of the network while eliminating repetition. The proposed methodology has been illustrated on an eight-node reconfigurable network. It has also been verified on several reconfigurable DNs, having 33, 34, 69, 118, 123, and 167 nodes. A comparison between the proposed methodology and recently published approaches has been made. The constraints for zero-injection nodes with various network configuration has also been considered to find optimal $\mu$PMU deployment. The obtained optimal deployment of $\mu$PMUs with or without channel limit satisfies the criteria of complete topological observability, topological in-dependency, and maximizes the sum of topology measurement redundancy.
Recently, space-division multiplexing (SDM) has been incorporated with elastic optical networks (EONs) to enhance the fiber capability, which forms space-division multiplexing-based elastic optical networks (SDM-EONs)...
详细信息
Recently, space-division multiplexing (SDM) has been incorporated with elastic optical networks (EONs) to enhance the fiber capability, which forms space-division multiplexing-based elastic optical networks (SDM-EONs). During transmission of optical signals through multi-core fibers, inter-core crosstalk (XT) and intra-core physical layer impairments (PLIs) arise, which deteriorate the signal quality. Existing models typically handle inter-core XT and intra-core PLIs separately and set a single XT threshold for each modulation format, which results in an unacceptable lightpath due to the degradation of signal quality or leads to inefficient spectrum utilization. This paper proposes a routing, modulation, spectrum, and core allocation (RMSCA) model for SDM-EONs to consider inter-core XT and intra-core PLIs jointly. For each modulation format, it sets different XT thresholds and transmission reaches according to inter-core XT and intra-core PLIs. An optimization problem is formulated as an integer linear programming (ILP) problem. We prove that the RMSCA decision problem is NP-complete. We introduce a heuristic algorithm when the ILP problem is not tractable. Numerical results demonstrate that, by setting several XT limits for each modulation format, the proposed model increases spectrum efficiency compared to a benchmark model based on the literature.
This paper presents the capacitated and economic districting problem (CEDP), which searches for the best edge partition defining connected, capacitated, and balanced districts in an undirected connected graph, weighin...
详细信息
This paper presents the capacitated and economic districting problem (CEDP), which searches for the best edge partition defining connected, capacitated, and balanced districts in an undirected connected graph, weighing the economic value of each district. This problem provides a comprehensive description of the decision making on service networks districting, where the order by which the districts are serviced plays a role in the profit. This is observed in the arrangement of districts formeter reading, as the day in which each district is read impacts the revenue. Two integer linear programming formulations are proposed for CEDP, accompanied by a proof of NP-hardness. To tackle large instances, a greedy randomized adaptive search procedure (GRASP) metaheuristic, embedded with reactive parameter tuning, statistical filtering of solutions subjected to intensification, and a set of solution repairing procedures, is proposed. The GRASP is hybridized to each model to evaluate the outcomes of combining their individual merits. Computational experiments were performed on a new benchmark composed of 144 instances of different sizes, edge densities, network topologies, balance tolerances, and district capacities. The results show the effectiveness of the exact methodologies in solving the models and providing optimal solutions for the set of small instances. The GRASP was capable of tackling large networks, achieving feasible solutions to almost all instances. The results also show that the hybridized methodologies outperformed their standalone counterparts with respect to the attained primal and dual bounds.
There have been numerous attempts at solving the optimal camera placement problem across multiple applications. Exact linearprogramming-based, as well as, heuristic combinatorial optimization methods were shown to be...
详细信息
There have been numerous attempts at solving the optimal camera placement problem across multiple applications. Exact linearprogramming-based, as well as, heuristic combinatorial optimization methods were shown to be successful in providing optimal or near-optimal solutions to this problem. Working over a discrete space model is the general practice when solving the camera placement problem. However, discretized environments often limit the methods' usage only to small-scale datasets due to resource and time constraints that grow exponentially with the number of 3D points collected from the discrete space. We propose a multi-resolution approach that enables the usage of existing optimization algorithms on large real-world problems modelled using high resolution 3D grids. Our method works by grouping together the given discrete set of possible camera locations into clusters of points, multiple times, resulting in multiple resolution levels. Camera placement optimization is repeated for all resolution levels while propagating the optimized solution from low to high resolutions. Our experiments on both simulated and real data with grids of varying sizes show that using our multi-resolution approach, existing camera placement optimization methods can be used even on high resolution grids consisting of hundreds of thousands of points. Our results also show that the strategy of grouping points together by exploiting underlying 3D geometry to optimize camera poses is not only significantly faster than optimizing on the entire set of samples but, it also provides better camera coverage.
In this paper, modified social spider optimization algorithm (MSSO) has been proposed to solve the spectrum allocation problem in Macrocell/Femtocell heterogeneous network. As an integerprogramming problem, existing ...
详细信息
This paper presents nonlinear optimal classification trees, an advanced approach developed to enhance the accuracy and interpretability of classification trees. By integrating kernel-based methods and symbolic functio...
详细信息
暂无评论