Table of Contents
Journal of Industrial Engineering
Volume 2014, Article ID 128542, 12 pages
Research Article

A Multiobjective Iterated Greedy Algorithm for Truck Scheduling in Cross-Dock Problems

1Department of Industrial Engineering, Faculty of Engineering, University of Kharazmi, Karaj, Iran
2Department of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran

Received 27 January 2014; Accepted 8 April 2014; Published 8 May 2014

Academic Editor: Wen-Chiung Lee

Copyright © 2014 B. Naderi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The cross-docking system is a new distribution strategy which can reduce inventories, lead times, and improve responding time to customers. This paper considers biobjective problem of truck scheduling in cross-docking systems with temporary storage. The objectives are minimizing both makespan and total tardiness. For this problem, it proposes a multiobjective iterated greedy algorithm employing advance features such as modified crowding selection, restart phase, and local search. To evaluate the proposed algorithm for performance, it is compared with two available algorithms, subpopulation particle swarm optimization-II and strength Pareto evolutionary algorithm-II. The comparison shows that the proposed multiobjective iterated greedy algorithm shows high performance and outperforms the other two algorithms.