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.

각진장미흰깍지벌레, 참식나무흰깍지벌레와 후박나무굴깍지벌레로부터 채집된 Encarsia explorata (Silvestri) [후박굴깍지좀벌 (신칭)] 및 담배가루이로부터 채집된 Encarsia lutea (Masi) [가루이좀벌 (신칭)] 을 국내분포로 처음 보고한다. 또한 이들 종들의 검색표, 식별형질, 사진자료, 분포 및 기주 정보도 함께 제공하였다.

사철나무 잎과 가지에 발생하는 사철깍지벌레로부터4종의 면충좀벌, 제줄깍지좀벌, 주걱깍지좀벌, 장미깍지좀벌 및 Pteroptrix machiaveli (Girault)가 채집되었고, 이중 Pteroptrix machiaveli (Girault) [사철깍지네마디좀벌(신칭)] 1종을 국내분포로 처음 보고한다. 또한 이들 종들의 식 별형질, 사진자료, 분포 및 기주 정보도 함께 제공하였다.