Titlebook: Extending the Horizons: Advances in Computing, Optimization, and Decision Technologies; Edward K. Baker,Anito Joseph,Michael A. Trick Book

我要威脅

eardrum

RUPT

為敵

A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problemn-uniform Steiner tree problem, the goal is to connect a set of nodes located on an uneven landscape, in a tree in the cheapest possible way. Using a combination of novel operators, our genetic algorithm is able to find optimal or near-optimal solutions in a small fraction of the time taken by an ex

HALL

Cardinality and the Simplex Tableau for the Set Partitioning Problemnal solution can be interpreted in terms of unresolved solution cardinality. We include a cardinality row within the linear programming relaxation of the set partitioning problem to demonstrate the associated cardinality-related information present in the tableau. Working with a basic feasible solut

打火石

An Efficient Enumeration Algorithm for the Two-Sample Randomization Distributionrtain if there is in fact a statistically significant treatment effect. Exact calculation of the associated randomization distribution theoretically involves looking at all possible partitions of the original measurements into two appropriately-sized groups. Computing every possible partition is com

萬靈丹

An Adaptive Algorithm for the Optimal Sample Size in the Non-Stationary Data-Driven Newsvendor Problmance is measured by the decision-maker’s average regret. The approach we propose is entirely data-driven, in the sense that we do not estimate the probability distribution of the demand and instead rely exclusively on historical data. We propose an iterative algorithm to determine the number of pas

concert

A Neighborhood Search Technique for the Freeze Tag Problemactivate all robots in the minimum amount of time. Activation of robots, other than the initial robot, only occurs if an active robot physically moves to the location of an inactive robot. Several authors have devised heuristic algorithms to build solutions to the Freeze Tag Problem. Here, we invest

慢慢流出

Lyme-disease

Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problemformulated as a mixed-integer nonlinear program (MINLP), but solving for the exact solution is impractical. Therefore, two heuristic approaches, a clustering-based algorithm and a convex hull-based algorithm, are proposed to find near-optimal feasible solutions. The algorithms are tested on various