SUMMARY The breakdown of trade barriers among countries led to an enormous increase in the volume international trade. Consequently, amount bulk cargo carried containers and transported overseas exploded because flexibility reliability this type transportation. So, efficiency container terminals has emerged as a major problem. In work, we deal with operational problem terminals. We try develop strategies minimize total time required retrieve from bay predetermined sequence. is solved...

The problem of generating the sequence tests required to reach a diagnostic conclusion with minimum average cost, which is also known as test-sequencing problem, considered. traditional generalized here include asymmetrical tests. In general, next test execute depends on results previous Hence, can naturally be formulated an optimal binary AND/OR decision tree construction whose solution NP-hard. Our approach based integrating concepts from one-step look-ahead heuristic algorithms and basic...

Abstract We introduce and study a generalization of the classic sequential testing problem, asking to identify correct state given series system that consists independent stochastic components. In this setting, costly tests are required examine individual components, which sequentially tested until can be uniquely identified. The goal is propose policy minimizes expected cost, a‐priori probabilistic information on nature each component. Unlike where variables one after other, we allow...

We address the most general case of multiperiod, multiproduct network planning problems, where we allow spoilage on arcs and storage at nodes. In our models, all parameters change over time products. The minimum-cost flow problem in discrete-time model with varying is investigated when and/or spoilage, some reformulation techniques employing polyhedrals are developed to obtain optimal solutions for a predefined horizon. Our methods rely appropriate definitions matrices that lead LP problems...

We consider source-initiated broadcast session traffic in an ad hoc wireless network operating under a hard constraint on the end-to-end delay between source and any node network. measure to given number of hops data travels from that node, our objective this paper is construct energy-efficient tree has maximum depth Δ, where Δ; represents hop characterize optimal solution closely related problem massively dense networks using dynamic programming formulation. prove can be obtained by...

Stochastic Boolean Function Evaluation (SBFE) is the problem of determining value a given function $f$ on an unknown input $x$, when each bit $x_i$ $x$ can only be determined by paying associated cost $c_i$. Further, drawn from product distribution: for $x_i$, $Prob[x_i=1] = p_i$, and bits are independent. The goal to minimize expected evaluation. In this paper, we study complexity SBFE classes DNF formulas. We consider both exact approximate versions subclasses DNF, arbitrary costs...

This paper addresses the Vehicle Routing Problem (VRP) of a Home Health Care (HCC) service provider that serves patients requesting different types care. In this problem, HCC services are provided by two personnel, nurses and health care aides, number each type personnel is limited. Each patient must be visited exactly once even if her servicing requires both associated with strict time window during which provided. We first present 0-1 mixed integer programming formulation problem. Since...

Multi-period multi-product distribution planning problems are depicted as multi-commodity network flow where parameters may change over time. The corresponding mathematical formulation is presented for a discrete time setting, and it can also be used an approximation continuous setting. A penalty-based method which employs cost-scaling approach developed to solve some auxiliary penalty aiming obtain optimal solution the original problem. experiments on both random instances case study show...