TY - JOUR T1 - Enhancing the Search Capability of the Imperialist Competitive Algorithm for Truck Scheduling Problem in the Cross-Docking System TT - افزایش قابلیت جستجو در الگوریتم بهینه‌سازی رقابت استعماری برای برنامه زمانبندی کامیون‌ها در سیستم انبار متقاطع JF - JAMLU JO - JAMLU VL - 19 IS - 4 UR - http://jamlu.liau.ac.ir/article-1-1993-en.html Y1 - 2022 SP - 37 EP - 61 KW - Cross-Docking KW - scheduling KW - Imperialist Competitive Algorithm KW - Principal Component Analysis N2 - In today's distribution environment, cross-docking has attracted the attention of many researchers due to its vital role in reducing costs in supply chains. The cross-docking system reduces the cost of distribution by eliminating storage and sorting. In this article, we look at the issue of truck scheduling in a cross-docking system. According to the research literature, the issue of cross-docking scheduling is one of the Np-hard problems, so in this paper, a new hybrid approach to solve this problem is presented. The Imperial Competition Algorithm (ICA) is a socio-political algorithm inspired by imperialist competition. However, when searching in a complex environment, its efficiency is significantly reduced, and this limitation confines the algorithm for achieving a good solution. This paper introduces a new search mechanism to solve this problem. This algorithm is based on the principal component analysis (PCA) method in which PCA actually extracts a low-dimensional set of features from a high-dimensional set to help record more information with fewer variables. This is why the method is called PCICA. The results from the new algorithm were compared with ICA, SA, and GA methods. Results show that PCICA performs significantly better than others and can find reasonable solutions. M3 10.52547/jamlu.19.4.37 ER -