An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.

A sweep-based heuristic using common area is developed for multi-vehicle VRPs under time various and unsymmetric forward and backward vehicle moving speed. One depot and 2 delivery vehicle are assumed in this research to make the problem solving strategy simple. A common area is held to make adjustment of possible unbalance of between two vehicle delivery completion times. The 4 time zone heuristic is used to solve for efficient delivery route for each vehicle. The current size of common area needs to be studied for better results, but the suggested problem solving procedures can be expanded for any number of vehicles.

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++.

목적: 조도가 눈의 굴절력과 동공크기에 미치는 영향을 알아보고자 하였다. 방법: 안질환과 안과 수술경력이 없고 양안 교정시력이 1.0 이상인 평균 20세의 남녀 30명(남자 11명, 여자 19명)을 대상으로 조도 100Lux, 300Lux, 500Lux, 800Lux, 1,000Lux에서 각각 눈의 굴절력과 동공의 크기를 측정하여 보였다. 결과: 우안의 평균 구면 굴절력 변화는 500~800Lux 에서 S=0.03±0.24D, 좌안의 평균 구면 굴절력 변화는 100~300Lux에서 S+0.08±0.24D, 우안의 평균 원주 굴절력 변화는 500~800 Lux에서 C+0.02D, 좌안의 평균 원주 굴절력 변화는 500~800Lux에서 C+0.10D의 변화를 보였다. 또한, 조도에 따른 동공의 크기는 100Lux에서는 6.02㎜, 300Lux에서는 6.04㎜, 500Lux에서는 5.75㎜, 800Lux에서는 4.01㎜, 1,000Lux에서는 3.64㎜로 나타났다. 결론: 조도에 따른 눈의 굴절력 변화는 유의한 차이는 보이지 않았지만, 조도변화의 일부구간에서 구면 및 원주굴절력이 다소 감소하는 경향을 보이는 것으로 나타났다. 또한, 동공크기의 변화는 500Lux부터 동공의 크기가 통계적으로 유의하게 작아짐을 알 수 있었다. 따라서, 이에 대한 검안실 조도의 적절한 기준이 필요할 것으로 사료된다.

A possible heuristic to solve metropolitan area vehicle routing problems with variable vehicle speeds is suggested in this research. Delivery hours are classified into 4 different time zones to make variable vehicle speeds no change within the same time zone to make TDVRP simple to solve. The suggested heuristic consists of 2 stages such as initial solution development step and initial solution improvement step. A computer program using C++ is constructed to evaluate the suggested heuristic. Randomly generated vehicle routing problems are used for the experiments. This heuristic could be helpful to logistics companies by increasing delivery efficiencies since the 4 zone classification is taken from the observed traffic information offered by a local government.

Parcel delivery services are a bit different from general vehicle routing problems since the services require a deliver’s walking time to give the parcel to the customer. This time takes more than 1/4 of total delivery time, but it is ignored for the conv

The restrictions and conditions of parcel delivery services are different from other delivery services. There is WTD in the parcel delivery service. WTDs are various along the types of buildings and delivery points. To make the problem solving method simple and efficient using the WTD, the values are observed and grouped based on the type of buildings in this research. Efficient VRP heuristic design could be possible with introduction of WTD concept as well as the delivery time forecasting.

Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds informat

This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of

  Comparing with bar-code systems, RFID systems can supply more efficient work. Using RFID systems, logistic management systems could be helped effectively to gather real-time information. It"s available to reduce the working time and object"s delay time,

본 연구에서는 중등학교 현장에서 요구되는 전문상담교사의 실제적 역할과 그 기능을 규명하고자 하였다. 이를 위하여 학생 323명, 학부모 323명, 교사 307, 전체 953명을 대상으로 자료를 수집한 후 전문상담교사의 역할에 대한 요인분석을 실시하였다. 그 결과, 개별 및 집단 상담활동, 교사 및 부모를 위한 자문활동, 학교상담 관련 행정업무, 학생이해 및 지도를 위한 정보수집 및 제공활동, 전반적인 학교 생활지도 및 상담체제에 대한 지원, 학교 및 학급 생활지도를 위한 교육과정 구성과 실행 등 여섯 요인이 산출되었고, 각 집단별 요구구조가 안정적인 것으로 나타났다. 이를 토대로 학생, 학부모, 교사들이 요구하는 전문상담교사의 공통적인 세부 역할 및 기능에는 개별 및 집단 상담활동 중 바람직한 진로선택 및 진로결정을 위한 상담이 가장 높게 나타났다. 한편, 세 집단간 차이를 비교한 결과, 학생은 개별 및 집단상담 활동 중 바람직한 진로선택 및 진로결정을 위한 상담, 학부모는 학교상담관련 행정업무 중 학교상담실의 운영, 교사는 개별 및 집단상담 활동 중 집단 괴롭힘(왕따, 학교폭력)의 가해 및 피해 학생을 위한 상담에 대한 요구가 가장 높은 것으로 나타났다.