• Management Science and Financial Engineering
• /
• v.4 no.2
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• Journal of Distribution Science
• /
• v.14 no.2
• /
• pp.41-45
• /
• 2016

Purpose - Finding an optimal path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node. Research design, data, and methodology - To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution. Results - First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network. Conclusions - We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them. Extending our models for visiting two or more destinations is one of the further research topics.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2009.05a
• /
• pp.579-580
• /
• 2009

This paper presents a numerical simulation of quasi-brittle fracture in UHPFRC I-beam. A linear complementarity problem (LCP) is used to formulate the path-dependent hardening-softening behavior in non-holonomic rate form, and the PATH solver is employed to solve the LCP.

• Management Science and Financial Engineering
• /
• v.10 no.1
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.33-49
• /
• 2002

CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM Problem Is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences on machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.270-277
• /
• 2004

In this paper, path-independent values of the J-integral in the fininte element context for arbitrary two-dimensional and three-dimensional crack configurations in welds are presented. For the fracture mechanics analysis of cracks in welds, residual stress analysis and fracture analysis must be performed simultaneously. In the analysis of cracked bodies containing residual stress, the usual domain integral formulation results in path-dependent values of the J-integral. This paper discusses modifications of the conventional J-integral that yield path independence in the presence of residual stress generated by welding. The residual stress problem is treated as an initial strain problem and the J-integral modified for this class of problem is used. And a finite element program which can evaluate the J-integral for cracks in two-dimensional and three-dimensional residual stress bearing bodies is developed using the modified J-integral definition. The situation when residual stress only is present is examed as is the case when mechanical stresses are applied in conjunction with a residual stress field.

• Journal of Korean Society for Quality Management
• /
• v.26 no.1
• /
• pp.192-200
• /
• 1998

The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.4
• /
• pp.45-50
• /
• 2010

This paper explores a new approach for modeling of decision-making problems that involve uncertain, time-dependent and sequence-dependent processes which can be applied to semiconductor industry. In the proposed approach, which is based on probability theory, approximate sample paths are required to be specified by probability and statistic characteristics. Completely specified sample paths are seen to be elementary and fundamental outcomes of the related experiment. The proposed approach is suitable for modeling real processes more accurately. A case study is applied to a single item production planning problem with continuous and uncertain demand and the solution obtained by the approximate path specification method shows less computational efforts and practically desirable features. The application possibility and general plan of the proposed approach in semiconductor manufacturing process is also described in the paper.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.491-505
• /
• 1997

This paper deals with the formulation and solution of a wide class of structures, in the presence of both geometric and material nonlinearities, as a particular mathematical programming problem. We first present key ideas for the nonholonomic (path dependent) rate formulation for a suitably discretized structural model before we develop its computationally advantageous stepwise holonomic (path independent) counterpart. A feature of the final mathematical programming problem, known as a nonlinear complementarity problem, is that the governing relations exhibit symmetry as a result of the introduction of so-called nonlinear "residuals". One advantage of this form is that it facilitates application of a particular iterative algorithm, in essence a predictor-corrector method, for the solution process. As an illustrative example, we specifically consider the simplest case of plane trusses and detail in particular the general methodology for establishing the static-kinematic relations in a dual format. Extension to other skeletal structures is conceptually transparent. Some numerical examples are presented to illustrate applicability of the procedure.

• Proceedings of the KWS Conference
• /
• 2004.05a
• /
• pp.264-266
• /
• 2004

for the kぉ mechanics analysis of a crack in a weld of dissimilar steels, residual stress analysis and fracture analysis must be performed simultaneously. The standard definition of the J-integral leads to a path dependent value in the presence of a residual stress field. And unlike cracks in homogeneous materials, a bimaterial interface crack always induces both opening and shearing modes of stress in the vicinity of the crack tip. Therefore, it is necessary to develope a path independent J-integral definition for a crack in a residual stress field generated by welding of dissimilar steels. This paper addresses the modification of the Rice-J-integral to produce a path independent J-integral when residual stresses due to welding of dissimilar steels and external forces are present. The residual stress problem is heated as an initial stain problem and the J-integral proposed for this class of problems is used And a program which can evaluate the 1-integral for a crack in a weld of dissimialr steels is developed using proposed J-integral definition.