• Korean Management Science Review
• /
• v.34 no.1
• /
• pp.1-13
• /
• 2017

The percentage of 3PL (Third-party Logistics), which uses third party businesses to outsource elements of the company's distribution and fulfillment services, is increasing steadily. To provide 3PL service to the customers, it is needed to estimate the total transportation cost and propose the unit cost to the customers. In this paper, we develop a decision support system for estimation of transportation cost of 3PL provider considering various transportation services, such as direct transportation, multi point visiting transportation, and cross docking. The system supports route planning of vehicles by using algorithms based on tabu search and dynamic programming.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.331-336
• /
• 2016

Multi-bit tries have been proposed to improve the search performance of a binary trie by providing flexibility in stride values, which identify the number of bits examined at a time. However, constructing a variable-stride multi-bit trie is challenging since it is not easy to determine a proper stride value that satisfies the required performance at each node. The aim of this paper is to identify several desired characteristics of a trie for IP address lookup problems, and to propose a multi-stride decision trie that has these characteristics. Simulation results using actual routing sets with about 30,000 to 220,000 prefixes show that the proposed multi-stride decision trie has the desired characteristics and achieves IP address lookup using 33% to 47% of the 2-bit trie in the average number of node accesses, while requiring a smaller amount of memory.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.70-84
• /
• 2006

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1665-1671
• /
• 2007

Mobile Ad hoc Networks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad-hoc networks. In this study, we proposed an enhanced routing protocol based on AODV by monitoring variation of receiving signal strength. New metric function that consists of node mobility and hops of path is used for routing decision. From extensive experiments by using NS-2, The performance of the proposed routing scheme has been imp개ved by comparison to AODV protocol.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.116-125
• /
• 2019

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.623-629
• /
• 2010

A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

• Advances in aircraft and spacecraft science
• /
• v.10 no.5
• /
• pp.393-418
• /
• 2023

Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2006.10a
• /
• pp.240-257
• /
• 2006

In an effort to gain competitiveness, recently many companies are trying to outsource their logistics activities to the logistics specialists, while concentrating on their core and strategic business area. Because of this trend, the third party logistics comes to the fore, catching people's attention, and expanding its market rapidly. Under these circumstances, the third party logistics companies are making every effort to improve their logistics services and to develop an information system in order to enhance their competitiveness. In particular, among these efforts one of the critical parts is the decision support system for effective transportation network planning. To this end, this study has developed an efficient decision support system for an optimal transportation network planning by comprehensively considering the transportation mode, routing, assignment, and schedule. As a result of this study, the new system enables the expansion of the third party logistics companies' services including the multimodal transportation, not to mention one mode of transportation, and also gets them ready to plan an international transportation network.

• Journal of Korea Water Resources Association
• /
• v.30 no.6
• /
• pp.679-690
• /
• 1997

The risk assessment model for hydrlolgic safety analysis of dam and levee in developed by using Monte-Carlo and AFOSM (Advanced First-Order Second-Moment) method. The fault tree analysis and four phases approach are presented for the safety eveluation of risk of dam and levee. The risk model consists of rainfall-runoff analysis, reservoir routing and channel routing considering the variations in the model parameter. For the rainfall-runoff analysis, KRRL method is adopted with 200-year precipitation and PMP (Probable Maximum Precipitation). Reservoir routing is performed by fourth order Runge-Kutta method and channel routing by standard step method. The suggested model will contribute to safety evaluation of dam and levee and their rehabilitation decision problem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.109-113
• /
• 2011

In intelligent subway systems, UWB-based WiMedia D-MAC Protocol can be considered to send and receive multimedia data which requires high data rate. However, network devices which do not exist within 10 meters, the limited communication rage, can not communicate with each other because WiMedia does not support multi-hop communications. In this paper, we developed the algorithm to select a relaying device for multi-hop routing on WiMedia networks. In the first step, each device acquires information of neighbors through beacon and decides whether it is a normal or relaying device using the acquired information. In the next step, all devices can create the 2-hop routing table using the information received via relaying devices and the whole routing table for all devices on networks, eventually.