• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.81-91
• /
• 2005

The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.145-154
• /
• 2004

The growing demand for customer-responsive, made-to-order manufacturing is stimulating the need for improved dynamic decision-making processes in commercial fleet operations. Moreover, the rapid growth of electronic commerce through the internet is also requiring advanced and precise real-time operation of vehicle fleets. Accompanying these demand side developments/pressures, the growing availability of technologies such as AVL(Automatic Vehicle Location) systems and continuous two-way communication devices is driving developments on the supply side. These technologies enable the dispatcher to identify the current location of trucks and to communicate with drivers in real time affording the carrier fleet dispatcher the opportunity to dynamically respond to changes in demand, driver and vehicle availability, as well as traffic network conditions. This research investigates key aspects of real time dynamic routing and scheduling problems in fleet operation particularly in a truckload pickup-and-delivery problem under various settings, in which information of stochastic demands is revealed on a continuous basis, i.e., as the scheduled routes are executed. The most promising solution strategies for dealing with this real-time problem are analyzed and integrated. Furthermore, this research develops. analyzes, and implements hybrid algorithms for solving them, which combine fast local heuristic approach with an optimization-based approach. In addition, various partitioning algorithms being able to deal with large fleet of vehicles are developed based on 'divided & conquer' technique. Simulation experiments are developed and conducted to evaluate the performance of these algorithms.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.70-77
• /
• 2009

In an RFID network consisting of a single reader and many tags, a framed and slotted ALOHA, which provides a number of slots for the tags to respond, was introduced for arbitrating a collision among tags' responses. In a framed and slotted ALOHA, the number of slots in each frame should be optimized to attain the maximal efficiency in tag cognizance. While such an optimization necessitates the knowledge about the number of tags, the reader hardly knows it. In this paper, we propose a tag cognizance scheme based on framed and slotted ALOHA, which is characterized by directly taking a Bayes action on the number of slots without estimating the number of tags separately. Specifically, a Bayes action is yielded by solving a decision problem which incorporates the prior distribution the number of tags, the observation on the number of slots in which no tag responds and the loss function reflecting the cognizance rate. Also, a Bayes action in each frame is supported by an evolution of prior distribution for the number of tags. From the simulation results, we observe that the pair of evolving prior distribution and Bayes action forms a robust scheme which attains a certain level of cognizance rate in spite of a high discrepancy between the Due and initially believed numbers of tags. Also, the proposed scheme is confirmed to be able to achieve higher cognizance completion probability than a scheme using classical estimate of the number of tags separately.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.3
• /
• pp.18-31
• /
• 2002

In this study, we introduce a concept of advanced neurofuzzy polynomial networks(ANFPN), a hybrid modeling architecture combining neurofuzzy networks(NFN) and polynomial neural networks(PNN). These networks are highly nonlinear rule-based models. The development of the ANFPN dwells on the technologies of Computational Intelligence(Cl), namely fuzzy sets, neural networks and genetic algorithms. NFN contributes to the formation of the premise part of the rule-based structure of the ANFPN. The consequence part of the ANFPN is designed using PNN. At the premise part of the ANFPN, NFN uses both the simplified fuzzy inference and error back-propagation learning rule. The parameters of the membership functions, learning rates and momentum coefficients are adjusted with the use of genetic optimization. As the consequence structure of ANFPN, PNN is a flexible network architecture whose structure(topology) is developed through learning. In particular, the number of layers and nodes of the PNN are not fixed in advance but is generated in a dynamic way. In this study, we introduce two kinds of ANFPN architectures, namely the basic and the modified one. Here the basic and the modified architecture depend on the number of input variables and the order of polynomial in each layer of PNN structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the ANFPN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed ANFPN can produce the model with higher accuracy and predictive ability than any other method presented previously.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.63-72
• /
• 2013

Business Process Intelligence (BPI) is one of the emerging technologies in the knowledge discovery and analysis area. BPI deals with a series of techniques from discovering knowledge to analyzing the discovered knowledge in BPM-supported organizations. By means of the BPI technology, we are able to provide the full functionality of control, monitoring, prediction, and optimization of process-supported organizational knowledge. Particularly, we focus on the focal organizational knowledge, which is so-called the BPM activity-performer affiliation networking knowledge that represents the affiliated relationships between performers and activities in enacting a specific business process model. That is, in this paper we devise a statistical analysis method to be applied to the BPM activity-performer affiliation networking knowledge, and dubbed it the activity-performer correspondence analysis method. The devised method consists of a series of pipelined phases from the generation of a bipartite matrix to the visualization of the analysis result, and through the method we are eventually able to analyze the degree of correspondences between a group of performers and a group of activities involved in a business process model or a package of business process models. Conclusively, we strongly expect the effectiveness and efficiency of the human resources allotments, and the improvement of the correlational degree between business activities and performers, in planning and designing business process models and packages for the BPM-supported organization, through the activity-performer correspondence analysis method.

• Journal of the Korean Vacuum Society
• /
• v.16 no.5
• /
• pp.371-376
• /
• 2007

We have investigated the lasing characteristics of the InGaAs quantum dot laser diode (QD-LD) and InGaAs quantum well laser diode (QW-LD) operated at the 980 nm wavelength range. The 980-nm lasers are used as a pumping source for a erbium-doped fiber amplifier (EDFA) and it shows high efficiency in long-haul optical fiber network. We have compared the threshold current density, the characteristic temperature, the optical power and the internal efficiency of QD-LD and QW-LD under a pulsed current condition. The QD-LD shows superior performances to the QW-LD. Further optimization of a LD structure is expected to the superior performances of a QD-LD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.333-341
• /
• 2002

This article is written to make a foundation for effective radio network engineering by enabling the accurate traffic assumption between Base Station (BTS : Base Station Transceiver Subsystem) md Repeater through the scientific and systematic analysis of mobile traffic dealt within CDMA Base Station. Among these, Repeater, having direct physical connection with BTS, simply does the remote relay function but the volume of the traffic flowed into the repeater is not accountable. The total BTS traffic is the sum of traffic dealt by the BTS and multiple Repeaters. In this article, we tried traffic analysis of this kind by adopting RTD (Round Trip Delay) which is specially designed to measure distribution of the distance between the Base Station and the Mobile station by differentiating the traffic dealt by BTS from traffic dealt by Repeaters. The fact that the connection between mobile station and BTS via Repeater (which is located remotely) yields far more delay than the direct connection between mobile station and BTS is the clue of this article. Based on this fact, Time Delay equipment was put at the receiving side of the Repeater to add certain amount of delay to the traffic to BTS and the result showed that the 99.78% of the traffic can be identified.

• Journal of Korea Water Resources Association
• /
• v.31 no.6
• /
• pp.727-739
• /
• 1998

The main objectives o reservoir optimal operation can be described as follows : maximization of the benefits through optimal allocation of the limited water resources for various purpose; minimization of t도 costs by the flood damage in potential damaging regions and risk of dam failure, etc. through safe drainage of a bulky volume of excessive water by a proper reservoir operation. Reviewing the past research works related to reservoir operation, we can find that the study on the matter of the former has been extensively carried out in last decades rather than the matter of the latter. This study is focused on developing a methodology of optimal reservoir operation for flood control, and a case study is performed on the Chungju multipurpose reservoir in Korea. The final goal of the study is to establish a reservoir optimal operation system which can search optimal policy to compromise two conflicting objectives: downstream flood damage and dam safety-upstream flood damage. In order to reach the final goal of the study, the following items were studied : (1)validation of hydrological data using HYMOS: (2)establishment of a downstream flood routing model coupling a rainfall-runoff model and SOBEK system for 1-D hydrodynamic flood routing; (3)replication of a flood damage estimation model by a neural network; (4)development of an integrated reservoir optimization module for an optimal operation policy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.115-121
• /
• 2015

In this paper, we proposed an iterative data-flow optimal scheduling algorithm based on genetic algorithm for high-performance multiprocessor. The basic hardware model can be extended to include detailed features of the multiprocessor architecture. This is illustrated by implementing a hardware model that requires routing the data transfers over a communication network with a limited capacity. The scheduling method consists of three layers. In the top layer a genetic algorithm takes care of the optimization. It generates different permutations of operations, that are passed on to the middle layer. The global scheduling makes the main scheduling decisions based on a permutation of operations. Details of the hardware model are not considered in this layer. This is done in the bottom layer by the black-box scheduling. It completes the scheduling of an operation and ensures that the detailed hardware model is obeyed. Both scheduling method can insert cycles in the schedule to ensure that a valid schedule is always found quickly. In order to test the performance of the scheduling method, the results of benchmark of the five filters show that the scheduling method is able to find good quality schedules in reasonable time.