• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.99-109
• /
• 1997

This paper considers to determine the processing workstation of parts and number of machines at workstations in multi-stage manufacturing system. Several part types are processed simultaneously through multi-stage, which consist of several workstations. The machines in each stage are identical in function, but non-identical in functional performance depending on workstations. Two models are suggested. One is assumed that a part type can be processed at the only one workstation in each processing stage. The other is assumed that a part type can be processed at several workstations. Decision criteria is to minimize the sum of the processing cost, travel cost and machine setup cost. Model formulations are presented, and a numerical example is shown.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• Journal of Korean Society of Transportation
• /
• v.27 no.3
• /
• pp.131-140
• /
• 2009

A diversity of railway network function enhancement projects such as the double tracking, electrification, and direct operation have been actively executed to improve the railway service. When the new rapid railway is provided, how many people will use it instead of other transports? How will the railway choice behavior be changed? Accordingly, in this paper, the applicability of diverted travel demand forecast method by Stated Preference(SP) and Transfer Price(TP) data was reviewed for Daegu metropolitan railway service. As the result of implementing the Revealed Preference(RP) and RP+SP model, the total travel time and travel cost parameters are of the right sign and are highly significant. In particular, when TP data is used as the complementary investigation of SP, the boundary value of diverted travel demand can be easily identified by railway fare and travel time service level. Therefore, it is considered that this will practically apply even in other regions as well as Daegu metropolitan railway.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.129-140
• /
• 2007

The planning procedure of a transit operation consists of design, operation, and evaluation according to the research characteristics. There are some review studies on the operation and evaluation procedure, but the research on the design procedure has not yet been organized systematically. In this study, the research on transit system design was reviewed and the model structure and its solution method were arranged. The decision variables of the design procedure are network structure, line spacing or position, stop spacing, dispatching headway, and fleet size. In the analytical research on design procedure, system total cost is generally used as the objective function. System total cost is comprised of user cost, which is the sum of user access, waiting, and travel cost, and operating cost. Total cost of the transit system, used as the objective function, has the unique minimum because it is differentiable. There is a certain decision variable that makes the derivative of the objective function equal to zero and the second derivative of the objective function is positive. Therefore the decision variable that makes the first derivative of the objective function zero is the optimum that minimizes the objective function, and each of the cost components of the objective function become the same. This study is expected to help understanding about the research on the design procedure of transit operation planning and to help be a catalyst for relevant research.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.157-168
• /
• 2009

The random utility theory and the multinomial logit model (including a more recent variant--the mixed multinomial logit) derived from it have constituted a back bone for theoretical and empirical analyses of various travel demand features including mode choice. In their empirical applications, however, it is customary to specify random utilities which are linear in modal attributes such as time and cost, and in socio-economic variables. The linearity helps easy derivation of important information such as value of travel time savings by calculating marginal rate of substitution between time and cost. In this paper the author focuses on the very linearity of the random utilities. Taking into account the fact that the mode chooser is also labour supplier, commodity consumer as well as leisure-seeker, the author sets up a maximization model of the traveller, which encompasses various economic activities of the traveller. The author derive from the model the indifference curve defined on the space of modal attributes, time and cost and investigate under what conditions the random utility of the traveller becomes linear. It turns out that there exist the conditions under which the random utility is really linear in modal attributes, but the property does not hold when the traveller has a corner solution on the space of modal attributes, or when the primary utility function of the traveller is directly affected by labour provided and/or the travel time itself. As a corollary of the analysis, a random utility is suggested, approximated up to the second order of the variables involved for empirical studies of the field.

• IE interfaces
• /
• v.20 no.2
• /
• pp.103-111
• /
• 2007

A heterogeneous VRP which considers various capacities, fixed and variable costs was suggested in this study. The transportation cost for vehicle is composed of its fixed and variable costs incurred proportionately to the travel distance. The main objective is to minimize the total sum of transportation costs. A mathematical programming model was suggested for this purpose and it gives an optimal solution by using OPL-STUDIO (ILOG CPLEX). A genetic algorithm which considers improvement of an initial solution, new fitness function with weighted cost and distance rates, and flexible mutation rate for escaping local solution was also suggested. The suggested algorithm was compared with the results of a tabu search and sweeping method by Taillard and Lee, respectively. The suggested algorithm gives better solutions rather than existing algorithms.

• International Journal of Highway Engineering
• /
• v.19 no.2
• /
• pp.143-152
• /
• 2017

PURPOSES : This study intends to estimate the tangible benefits derived from the integration of operations of an Express Intercity Bus Terminal and a Highway Service Area. METHODS: For the study, a highway service area was chosen to function as a bus terminal, integrating its services with that of a nearby bus terminal plagued by operating losses. The exercise also helped improve mobility owing to the introduction of local buses between the terminals and utilization of the existing infrastructure such as rest areas. Thus, a terminal that was not being utilized for its intended functionality was integrated with an existing facility to improve the utilization of both and subsequently aid local development. The impact of the exercise was then measured by evaluating the variation in utilization efficiency, operating costs, travel time between two regions (Seoul-Jeomchon and Seoul-Geumsan), and the social costs before and after the integration of the two facilities. RESULTS :The impact of the integration was an increase in utilization efficiency, a decrease in operating cost, a decrease in travel time, and a decrease in social cost in both the regions. The benefits of improved utilization and cost saving can be passed on to the citizens in the form of discounts. A local power generation facility will eventually replace the bus terminal, which can revitalize the local economy. CONCLUSIONS :The integration of the highway service area with the bus terminal is expected to have a win-win effect on the passengers as well as the operators. The study also proposes a sustainable strategic plan for existing terminals and rest areas to implement a method to compete with KTX transportation.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.71-82
• /
• 2012

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.