نتایج جستجو برای: line planning problem
تعداد نتایج: 1422442 فیلتر نتایج به سال:
In every production plant, it is necessary to have an estimation of production level. Sometimes there are many parameters affective in this estimation. In this paper, it tried to find an appropriate estimation of production level for an industrial factory called Barez in an uncertain environment. We have considered a part of production line, which has different production time for different kin...
The line planning problem in public transport deals with the construction of a system of lines that is both attractive for the passengers and of low costs for the operator. In general, the computed line system should be connected, i.e., for each two stations there have to be a path that is covered by the lines. This subproblem is a generalization of the well-known Steiner tree problem; we call ...
This thesis introduces the Steiner connectivity problem. It is a generalization of the well known Steiner tree problem. Given a graph G = (V,E) and a subset T ⊆ V of the nodes, the Steiner tree problem consists in finding a cost minimal set of edges connecting all nodes in T . The Steiner connectivity problem chooses, instead of edges, from a given set of paths a subset to connect all nodes in ...
My research proposes an approach to integrating planning and execution in time-sensitive environments, a setting I call continual on-line planning. New goals arrive stochastically during execution, the agent issues actions for execution one at a time, and the environment is otherwise deterministic. My dissertation will address this setting in three stages: optimizing total goal achievement time...
The problem of path planning for 3-D line laser scanning is addressed in this article. The path under study is for a line, as opposed to a point in conventional CNC and CMM toolpath planning. While the objective of the latter case is to drive a point along a curve, that of the former case is to drive a line across a surface. To solve this problem, a path planning method is developed. First, a s...
Based on evolutionary computation concepts, the Evolutionary Planner/Navigator (EP/N) represents a new approach to path planning and navigation. The major advantages of the EP/N include being able to achieve both near-optimality of paths and high planning efficiency, being able to accommodate different optimization criteria, being flexible to changes, and being robust to uncertainties. The EP/N...
We discuss an optimization model for the line planning problem in public transport in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the computational complexity of this problem for tree network topologies as well as several categories of line operations that are important for the Quito Trolebús sy...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید