• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.4
• /
• pp.1261-1267
• /
• 2014

It is generally recognize that the weight of energy cost for railroad alignment in the life cycle cost is higher than that for roadway. This study analyzed the relative weights of railroad road-bed construction cost and energy cost in the case of Seoul-Pusan High Speed Rail. Recently, the optimization of railroad alignment with computerized methodology has been studies. The optimization is supposed to aim the minimization of life cycle cost including the energy cost as well as the minimization of the construction cost. The operation period of the Seoul-Pusan High Speed Rail is limited to ten years, then various future operation scenario were developed for the next 20 years. The weight of energy cost is estimated 10~30% of the construction cost by scenario, and it is lower than the figure generally expected. It may be meaningful to provide the method to include the energy cost in the railroad alignment optimization.

• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.21-27
• /
• 2013

Construction safety is a predominant hindrance in in-situ workflow and considered an unresolved issue. Current methods used for safety optimization and prediction, with limited exceptions, are paper-based, thus error prone, as well as time and cost ineffective. In an attempt to exploit the potential of BIM for safety, the objective of the proposed methodology is to automatically predict hazardous on-site conditions related to the route that the dozers follow during the different phases of the project. For that purpose, safety routes used by construction equipment from an origin to multiple destinations are computed using video cameras and their cycle times are calculated. The cycle times and factors; including weather and light conditions, are considered to be independent and identically distributed random variables (iid); and simulated using the Arena software. The simulation clock is set to 100 to observe the minor changes occurring due to external parameters. The validation of this technology explores the capabilities of BIM combined with simulation for enhancing productivity and improving safety conditions a-priori. Preliminary results of 262 measurements indicate that the proposed methodology has the potential to predict with 87% the location of exclusion zones. Also, the cycle time is estimated with an accuracy of 89%.

• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.1
• /
• pp.41-46
• /
• 2014

Bus service is easily adjusted to accommodate the changed demand. Despite the flexibility of that, its relocation should overcome the following problems: first, Bus line rearrangement should consider the balance between the demand and the supply to enhance the transit equity among the users scattered around the area that supply against demand imbalances. Second, the existing demand analysed is to crude since the demand was analysed based on TAZ. mainly based on the Dong unit. Utilization of the GWR and GIS-T data can resolve the problem. In this paper, the limitation of the conventional transit demand analysis model is overcome by deploying the GWR model which identifies the transit demand based on the geographic relation between the service location and those of the users. GWR model considers the spatial effect of the bus demand in accordance with the distance to the each bus stops using SCD(Smart Card Data) and BIS(Bus Information System). This demand map was then superimposes with the existing bus route which identified the areas where the balance between demand and supply is severly skewed. since the analysis was computed with SCD and BIS at every bus stops. the shortage and surplus of bus service of entire study area could computed. Further. based on this computational result and considering the entire bus service capacity data. Bus routes optimization from the oversupplied areas to the undersupplied area was illustrated thus this study clearly compared the benefits the GIS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4661-4676
• /
• 2014

In Wireless Mesh Networks (WMN), an authentication technique can be compromised due to the distributed network architecture, the broadcast nature of the wireless medium and dynamic network topology. Several vulnerabilities exist in different protocols for WMNs. Hence, in this paper, we propose trust based authentication and key establishment for secure routing in WMN. Initially, a trust model is designed based on Ant Colony Optimization (ACO) to exchange the trust information among the nodes. The routing table is utilized to select the destination nodes, for which the link information is updated and the route verification is performed. Based on the trust model, mutual authentication is applied. When a node moves from one operator to another for accessing the router, inter-authentication will be performed. When a node moves within the operator for accessing the router, then intra-authentication will be performed. During authentication, keys are established using identity based cryptography technique. By simulation results, we show that the proposed technique enhances the packet delivery ratio and resilience with reduced drop and overhead.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.115-125
• /
• 2015

This paper presents a Cuckoo search algorithm to secure adversaries misdirecting multi-hop routing in Mobile ad hoc networks (MANETs) using a robust Trust Predicated Routing Framework with an optimized cluster head selection. The clustering technique designed in this framework leads to efficient routing in MANETs. The heavy work load in the node causes an energy drop in cluster head, which leads to re-clustering of the group, and another cluster head is selected to avoid packet loss during data transmission. The problem in the re-clustering process is that the overall efficiency of the routing process is reduced and the processing time is increased. A Cuckoo search based optimization algorithm is proposed to solve the problem of re-clustering by selecting the secondary cluster head within the initially formed cluster group and eliminating the reclustering process. The proposed framework enables a node to select a reliable and secure route for MANET and the performance can be evaluated by comparing the simulated results with the AODV routing protocol, which shows that the performance of the proposed routing protocol are improved significantly.

• Journal of Ocean Engineering and Technology
• /
• v.29 no.3
• /
• pp.263-269
• /
• 2015

This paper proposes a new approach for solving the weather routing problem by dividing it into two phases with the goal of fuel saving. The problem is to decide two optimal variables: the heading angle and speed of the ship under several constraints. In the first phase, the optimal route is obtained using the Real-Time Adaptive A* algorithm with a fixed ship speed. In other words, only the heading angle is decided. The second phase is the speed scheduling phase. In this phase, the original problem, which is a nonlinear optimization problem, is converted into a geometric programming problem. By solving this geometric programming problem, which is a convex optimization problem, we can obtain an optimal speed scheduling solution very efficiently. A simple case of numerical simulation is conducted in order to validate the proposed method, and the results show that the proposed method can save fuel compared to a constant engine output voyage and constant speed voyage.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.55-64
• /
• 2023

The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.53 no.6
• /
• pp.153-163
• /
• 2011

This research describe improved algorithm that is able to decide terminal criterion of Evolutionary Structural Optimization (ESO), reducing load of calculation to search load path of concrete beam, and apply to agricultural facilities. The ESO method is that make to discrete structure, structural analyze each element stress through FEM. And repeat generation with next material condition to become for most suitable composing. Individual element introduces concept of zero stiffness, but zero stiffness decisions are gone to direction of exclusion. In this stduy, improve algorithm to be convergence by 'Rule of Alive or Die' in arrival because is most suitable. Also, existing terminal criterion lack consistency because that used depend on experience of researcher. This research procedure is fellowed. First, all modulus of elasticity assume a half of elasticity modulus of material, Second, structural analysis by FEM, Third, apply to the remove ratio and restoration ratio for the 'rule of alive or die'. Forth, reconstruct the element and material conditions. And repeat the first to forth process. The terminal time of evolutional procedure is the all elastic modulus of element changed to blank value or elasticity modulus value of original. Therefore, in this study, consist the algorithm for programming, and apply to the agricultural facilities with concrete.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.46 no.1
• /
• pp.121-131
• /
• 2004

Transportation and logistics of agricultural products have been one of the major interests of many researches. Most of researches have been limited to presuming these as a first dimensional process or considering only economic value of agricultural products at each stage of logistics. However, the particular characteristics of agricultural products, such as quality change during transportation or extensively scattered origins, require examining these problems as a whole system. Network model has been adopted to represent nodes, which stand for spatial location of demand and supply of agricultural products, and communication between these nodes. Based on network theory and advanced marketing potential function, an optimal routes selection model is developed. The model employed network simplex method for routes optimization. The application of the model focused on transportation network organization to reflect different market prices for different locations and resulted in optimum routes and profit improvement of the applied agricultural product.

• Journal of Korean Society of Transportation
• /
• v.20 no.5
• /
• pp.193-206
• /
• 2002

A signal optimization model is proposed by applying the Cell-Transmission Model(CTM) as an embedded traffic flow model to estimate a system-optimal signal timing plan in a transportation network composed of signalized intersections. Beyond the existing signal-optimization models, the CTM provides appropriate theoretical and practical backgrounds to simulate oversaturation phenomena such as shockwave, queue length, and spillback. The model is formulated on the Mixed-Integer Programming(MIP) theory. The proposed model implies a system-optimal in a sense that traffic demand and signal system cooperate to minimize the traffic network cost: the demand departing from origins through route choice behavior until arriving at destinations and the signal system by calculating optimal signal timings considering the movement of these demand. The potential of model's practical application is demonstrated through a comparison study of two signal control strategies: optimal and fixed signal controls.