• 제목/요약/키워드: Cross Docking Terminal

검색결과 3건 처리시간 0.015초

다수의 도어를 갖는 크로스도킹 터미널에서 입고와 출고를 병행하는 트럭일정계획을 위한 유전알고리즘 (A Genetic Algorithm for Scheduling of Trucks with Inbound and Outbound Process in Multi-Door Cross Docking Terminals)

  • 주철민;김병수
    • 대한산업공학회지
    • /
    • 제37권3호
    • /
    • pp.248-257
    • /
    • 2011
  • Cross docking is a logistics management concept in which items delivered to a terminal by inbound trucks are immediately sorted out, routed and loaded into outbound trucks for delivery to customers. Two main advantages by introducing a cross docking terminal are to consolidate multiple smaller shipment into full truck load and remove storage and order picking processes to save up logistics costs related to warehousing and transportation costs. This research considers the scheduling problem of trucks in the cross docking terminals with multi-door in an inbound and outbound dock, respectively. The trucks sequentially deal with the storage process at the one of inbound doors and the shipping process at the one of the outbound doors. A mathematical model for an optimal solution is derived, and genetic algorithms with two different chromosome representations are proposed. To verify performance of the GA algorithms, we compare the solutions of GAs with the optimal solutions and the best solution using randomly generated several examples.

작업시간창이 주어진 크로스토킹 터미널에서 미 선적 물량 최소화를 위한 입출고 트럭 일정계획 (Inbound and Outbound Truck Scheduling to Minimize the Number of Items Unable to Ship in Cross Docking Terminals with a Time Window)

  • 주철민;김병수
    • 대한산업공학회지
    • /
    • 제37권4호
    • /
    • pp.342-349
    • /
    • 2011
  • This paper considers the inbound and outbound truck scheduling problem in a cross docking terminal. The unloading process from inbound trucks and loading process to outbound trucks are assumed to be performed within a time window. If some items are not able to be loaded to their scheduled outbound trucks within the time window, they are stored in the terminal and shipped using the truck visiting the next time window. The objective of this paper is to schedule inbound and outbound trucks to minimize the number of items unable to ship within the time window. A mathematical model for an optimal solution is derived, and a rule-based local search heuristic algorithm and genetic algorithm (GA) are proposed. The performance of the algorithms are evaluated using randomly generated several examples.

In - Silico approach and validation of JNK1 Inhibitors for Colon Rectal Cancer Target

  • Bavya, Chandrasekhar;Thirumurthy, Madhavan
    • 통합자연과학논문집
    • /
    • 제15권4호
    • /
    • pp.145-152
    • /
    • 2022
  • Colon rectal cancer is one of the frequently diagnosed cancers worldwide. In recent times the drug discovery for colon cancer is challenging because of their speedy metastasis and morality of these patients. C-jun N-terminal kinase signaling pathway controls the cell cycle survival and apoptosis. Evidence has shown that JNK1 promotes the tumor progression in various types of cancers like colon cancer, breast cancer and lung cancer. Recent study has shown that inhibiting, JNK1 pathway is identified as one of the important cascades in drug discovery. One of the recent approaches in the field of drug discovery is drug repurposing. In drug repurposing approach we have virtually screened ChEMBL dataset against JNK1 protein and their interactions have been studied through Molecular docking. Cross docking was performed with the top compounds to be more specific with JNK1 comparing the affinity with JNK2 and JNK3.The drugs which exhibited higher binding were subjected to Conceptual - Density functional theory. The results showed mainly Entrectinib and Exatecan showed better binding to the target.