• Industrial Engineering and Management Systems
• /
• v.11 no.2
• /
• pp.183-187
• /
• 2012

In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed charge transportation problem is modeled on the basis of uncertainty theory. According to inverse uncertainty distribution, the model can be transformed into a deterministic form. Finally, in order to solve the uncertain fixed charge transportation problem, a numerical example is given to show the application of the model and algorithm.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.752-758
• /
• 2005

The transportation problem (TP) is known as one of the important problems in Industrial Engineering and Operational Research (IE/OR) and computer science. When the problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of NP-hard problems which is difficult to solve it by traditional methods. This paper aims to show the application of spanning-tree based Genetic Algorithm (GA)approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.91-101
• /
• 2000

The optimal congestion charge in transportation economics corresponds to the solution to the welfare maximization Problem for users of a certain road link where congestion takes Place. This congestion charge is in nature the optimal Price of the transportation facility, which is derived by the Partial equilibrium analysis on that facility. Therefore it is not certain that this congestion charge can maximize the well-being of all the users of the total transportation network, since the analysis does not count the impact of the congestion charge on traffic volumes of other links. This study suggests an alternative approach to estimate the optimal congestion charge. The key difference of this study from Previous ones is to derive the solution through the general equilibrium analysis on a market where several transportation facilities as well as Private goods are available to consumers. This approach shows a set of solutions a little different from the Previous one, which are explained below. The optimal congestion charge is derived for two different cases. One is the situation of which the congestion charge is levied on every transportation facility In this case, the optimal solution of each facility should equate the marginal utility of every user to the marginal cost of the corresponding facility. This analysis result in general equilibrium coincides with the Previous analysis result in partial equilibrium. However this result cannot apply to another case of which the charge is imposed only on a certain transportation facility. In this case, the optimal charge on a certain transportation facility should be less than the optimal congestion charge of partial equilibrium analysis.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.770-773
• /
• 2021

In this paper, the retention characteristics of 3D NAND flash memory applied with tapering and ferroelectric (HfO₂) structure were analyzed after programming operation. Electrons trapped in nitride are affected by lateral charge migration over time. It was confirmed that more lateral charge migration occurred in the channel thickened by tapering of the trapped electrons. In addition, the Oxide-Nitride-Ferroelectric (ONF) structure has better lateral charge migration due to polarization, so the change in threshold voltage (V_th) is reduced compared to the Oxide-Nitride-Oxide (ONO) structure.

• Transportation Technology and Policy
• /
• v.1 no.2
• /
• pp.71-84
• /
• 2004

In Europe, London, Edinbergh, Copenhagen has adopted the traffic congestion charge system, and now the Stockholm City Council started the implementation of a similar system of its own. According to the Swedish National Road Administration, the system implementation starts in 2004 and will be completed by 2005, and so starting 2006, this charge system will be running as planned. Unlike the system of London, that of Stockholm charges the drivers differently depending on when to pass a control point, and not only that, the City Council has a plan to adopt the emerging RFID technology. Following is the summary of both technical and policy-wise considerations of the traffic congestion charge system in Stockholm, Sweden.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.79-86
• /
• 2005

The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

• Journal of the Korean Society of Industry Convergence
• /
• v.13 no.1
• /
• pp.5-13
• /
• 2010

Industrialization and urbanization occurred-traffic delay, traffic accident and parking problem etc.-variety of transportation problems. Parking problem is one of the transportation problem then transportation engineers would get involved in trying to solve parking problem. A way to overcome a variety of parking problems needs preliminary data for conditions of parking but it lacks the preliminary data to do so. Thus this study analyzed a characteristic of a parking through a field survey for parking in Daegu Metropolitan City. This study analyzed parking characteristic of parking operation method. This study result reveals difference between a toll parking and a no charge parking characteristic. Thus a close examination for a toll parking characteristic and a no charge parking characteristic is a prerequisite for a rational parking policy.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.11a
• /
• pp.529-532
• /
• 2003

In this paper, the discharge characteristics of silent discharge chamber with 2mm and 3mm gap spacings were investigated. Dielectric of $Al_2O_3$ was embedded in the cylindrical type of discharge chamber. It was known that V-I and P-V characteristics depend strongly on the charge transportation characteristics, and in the low frequency silent discharge mode of operation, discharge voltage was always sustained to Vd, irrespective of applied voltage.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.793-796
• /
• 2008

본 논문은 생산 물류 시스템최적화의 실현에 가장 대표적인 생산수송계획문제인 수송문제(TP: Transportation Problem)에 고정비용을 고려한 고정비용 수송문제(fcTP: Fixed charge Transportation Problem)를 다룬다. 특히 NP-hard문제로 널리 알려진 TP에서 수송량에 비례하는 가변비용과 함께 추가적으로 모든 경로에서 발생하는 고정비용을 함께 고려한 fcTP를 다룬다. 따라서 이러한 fcTP를 해결하기 위해 메타 휴리스틱기법 중에 가장 널리 이용되고 있는 유전 알고리즘(CA: Genetic Algorithm)을 이용한 해법을 제시하고자 한다. 본 논문에서는 CA를 이용해 고정비용 수송문제의 해를 우선순위기반 유전자 표현법을 이용해 fcTP에 적용해 보고 수치 실험을 통해 그 성능에 대한 연구를 한다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.4
• /
• pp.113-128
• /
• 2016

This paper proposes a Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost. The problem has the property of mixed integer program with non-linear objective function and linear constraints. The bi-level procedure consists of the upper-GA and the lower-GA. While the upper-GA optimize the connectivity between each supply and demand pair, the lower-GA optimize the amount of transportation between the pairs set to be connected by the upper-GA. In the upper-GA, the feasibility of the connectivity are verified, and if a connectivity is not feasible, it is modified so as to be feasible. In the lower-GA, a simple method is used to obtain a pivot feasible solution under the restriction of the connectivity determined by the upper-GA. The obtained pivot feasible solution is utilized to generate the initial generation of chromosomes. The computational experiment is performed on the selected problems with several non-linear objective functions. The performance of the proposed procedure is analyzed with the result of experiment.