Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 316908, 18 pages
Research Article

A Hybrid Genetic Algorithm for the Multiple Crossdocks Problem

1School of Management, Xiamen University, Xiamen 361005, China
2Lingnan (University) College, Sun Yat-Sen University, Guangzhou 510275, China

Received 8 December 2011; Revised 1 April 2012; Accepted 15 April 2012

Academic Editor: John Gunnar Carlsson

Copyright © 2012 Zhaowei Miao 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.


We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be NP-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure, we propose a hybrid genetic algorithm (HGA) integrating greedy technique and variable neighborhood search method to solve the problem. Extensive experiments under different scenarios were conducted, and results show that HGA outperforms CPLEX solver, providing solutions in realistic timescales.