• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.71-78
• /
• 2013

An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3257-3274
• /
• 2012

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

• (The)Study of the Eastern Classic
• /
• no.73
• /
• pp.415-444
• /
• 2018

This study was designed to analyze the delivery patterns of early(1900-1945) letters from the beginning of the postal service in order to examine the process of establishing the modern postal system after the constitution of the Postal Service(1884). In Chapter 2, we examined the 'change of the way letters are delivered', Chapter 3 is about the 'change of expression' and Chapter 4 is about 'double-faced of the post'. In the examination of aspects of changing the way letters were delivered, the phase of postal delivery by personal delivery to postal delivery were divided into three phases: [the period of personal delivery delivery] > [the coexistence period of personal delivery and postal deliveryy] > [the period of postal delivery]. In particular, it was interesting to see that the same sender and receiver mixed up postal delivery and personal delivery by the case in the second period. In addition, the functional differences between the express, telegram and particular post were found in the examination fo contents of the letter. In the examination of aspects of changing in expression, a change of common expression in 'greeting, ending, and receiving expressions' were confirmed. Also, it was confirmed that 'woo-pyeon' was not used as the basic term, but instead replaced with various terms, and that 'woo' was used independently and productively. In the double-faced aspects of post, there were disadvantages of the postal delivery such as 'discontent of the lost' and 'security of confidentiality', despite the advantages of 'economic, rapid, and long-distance delivery'. Because the disadvantage of postal delivery could be supplemented by personal delivery, postal delivery and personal delivery could coexist for a considerable period of time.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.33-43
• /
• 2007

The pickup and delivery problem with time windows generally involves the construction of optimal routeswhich satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity, andavailability constraints. In this paper, we added some constraints to the problem and adopted an objectivefunction based on number of used vehicles, total travel distance and total schedule duration to consider morerealistic problems. A branch and price algohthm for the problem is proposed and an enumeration method is usedfor the subproblems. The algorithm was tested on randomly generated instances and computational results werereported.

• Journal of Plant Biotechnology
• /
• v.7 no.2
• /
• pp.113-121
• /
• 2005

The objective of this study was to identify the major parameters controlling DNA delivery by particle bombardment to immature embryos of Chinese spring wheat (Triticum aestivum L.). Efficiency of DNA (uidA gene) delivery was assessed by transient GUS (${\beta}$-glucuronidase) expression in bombarded tissues. Of the parameters analyzed, acceleration pressure, bombardment distance, chamber vacuum pressure, bombardment times, osmotic conditioning of culture had a remarkable influence on transient gene expression. A bombardment procedure suitable for Chinese spring wheat cultivars was developed which allowed high-efficiency DNA delivery combined with reduced damage to target tissues. The high efficiency made the system practical for wheat genetic transformation research and accelerating wheat breeding programs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.160-170
• /
• 2009

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

• Transactions of the Society of Information Storage Systems
• /
• v.7 no.1
• /
• pp.36-41
• /
• 2011

The micro laser module was designed and prepared to deliver the light to the HAMR head. It consists of laser diode, photo diode and actuator to realize stable light delivery even though the head is fluctuated during the disk rotation. The optical evaluation was carried out with the actual distance between the light source and HAMR head with a range of reflectivity and it was found that the incident angle could be controlled within ${\pm}0.125^{\circ}$ to maintain same intensity into the HAMR head. It was also confirmed that the designed micro laser module is thermally stable without any severe effect on the magnetic head.

• ETRI Journal
• /
• v.45 no.2
• /
• pp.329-337
• /
• 2023

For safe last-mile autonomous robot delivery services in complex environments, rapid and accurate collision prediction and detection is vital. This study proposes a suitable neural network model that relies on multiple navigation sensors. A light detection and ranging technique is used to measure the relative distances to potential collision obstacles along the robot's path of motion, and an accelerometer is used to detect impacts. The proposed method tightly couples relative distance and acceleration time-series data in a complementary fashion to minimize errors. A long short-term memory, fully connected layer, and SoftMax function are integrated to train and classify the rapidly changing collision countermeasure state during robot motion. Simulation results show that the proposed method effectively performs collision prediction and detection for various obstacles.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.461-472
• /
• 2006

In this paper, we propose a novel on-demand multicasting algorithm, 'Durable Distance Vector Multicasting(DDVM),' for Mobile Ad hoc Network(MANET). DDVM has a more efficient routing-control complexity than Link State Routing(LSR) and with the smaller complexity, DDVM provides a high delivery ratio for MANET with high mobility by adapting to dynamic topological changes. This is achieved by adding 'combined path durability' statistic into the routing-control information of Distance Vector Routing(DVR). The routing-path duration statistic is computed in a fully distributed manlier at each node in the network based on only local information from neighbour nodes. We show by simulation studies the effectiveness of DDVM compared with On-demand Multicast Routing Protocol(ODMRP).

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.602-609
• /
• 2003

Emerging high-speed next-generation Internet is enabling immersive media communication systems and applications to realize geographically distributed team collaborations while overcoming the limit of distance and time. Focusing on the reliable real-time delivery of 3D (i.e., stereo) video among corresponding parties, in this paper, key schemes for stereo video processing/display and reliable transport of stereo video packets over high-speed Internet are designed and implemented. The performance of proposed stereo video delivery system is evaluated both by emulating various network situations for quantitative comparison and by transmitting over real-world Internet up to the speed of around 100 Mbps. The results demonstrate the feasibility of the proposed system in supporting the desired immersive communication.