排序方式: 共有103条查询结果,搜索用时 437 毫秒
41.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
42.
In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
43.
针对高超声速滑翔飞行器再入轨迹规划问题,提出了一种基于微分平坦理论的三自由度轨迹生成方法。在分析纵向运动简化模型的微分平坦属性基础上,将纵向参考轨迹规划问题映射到平坦输出空间,消除微分动力学约束的同时降低系统设计的维数,进而提高求解效率;采用全局插值多项式参数化平坦输出函数,将问题转换为非线性规划问题求解;设计比例-微分反馈控制律跟踪纵向参考轨迹,同时采用航向角误差走廊控制侧向运动,实现三自由度轨迹生成。仿真分析表明所提出的方法能够较快生成满足多种约束且性能优化的飞行轨迹。 相似文献
44.
将分段幂多项式拟合方法与线性兴波阻力理论相结合,提出一种针对复杂线型小水线面双体船的兴波阻力数值计算方法,该方法应用于常规小水线面双体船的兴波阻力计算,表明该方法能在常规的幂多项式拟合方法的基础上进一步提高计算精度,同时也验证了该方法的正确性,将该方法的计算结果与复杂线型小水线面双体船剩余阻力的试验结果相比,两者吻合较好,证明了该方法用于复杂线型小水线面双体船的兴波阻力计算是可行的。 相似文献
45.
Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
46.
In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
47.
提出一种新的多学科设计优化方法,即子空间分解与淘汰优化方法.该方法通过子空间的分解和淘汰,提高剩余子空间的近似模型精度,基于子空间近似模型优化获取最优解.首先,基于设计空间近似模型获取最优解,如果近似模型达到满意精度,则终止优化;否则将设计空间分解为多个子空间.然后,各子空间基于近似模型优化,如果子空间没有可能获得优于... 相似文献
48.
分析了将函数逼近理论与方法引入神经网络研究的必要性;从经典函数逼近与统计分析两方面详细地讨论了多层前馈网(MLP)逼近能力分析的基本方法及结论;分析了正则理论观点下的径向基函数网络(RBF)的逼近能力;讨论了RBF网与多层前馈网在最佳逼近特性上的差异。文末指出了神经网络函数逼近的发展方向。 相似文献
49.
Non‐preemptive scheduling of n independent jobs on m unrelated machines so as to minimize the maximal job completion time is considered. A polynomial algorithm with the worst‐case absolute error of min{(1 ? 1/m)pmax, p} is presented, where pmax is the largest job processing time and p is the mth element from the non‐increasing list of job processing times. This is better than the earlier known best absolute error of pmax. The algorithm is based on the rounding of acyclic multiprocessor distributions. An O(nm2) algorithm for the construction of an acyclic multiprocessor distribution is also presented. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
50.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献