Kharazmi University International Journal of Supply and Operations Management 23831359 2 3 2015 11 01 A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking 833 855 2453 10.22034/2015.3.02 EN Sanae Larioui University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Mohamed Reghioui University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Abdellah El Fallahi University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco 0000-0001-7747-7833 Kamal El Kadiri University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Journal Article 2015 06 26 In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respecting time window constraints of suppliers and customers and a time horizon for the whole transportation operation. Rummaging through all the work of literature on vehicle routing problems with cross-docking, there is no work that considers that customer will receive its requests from several suppliers; this will be the point of innovation of this work. A heuristic and a memetic algorithm are used to solve the problem. The proposed algorithms are implemented and tested on data sets involving up to 200 nodes (customers and suppliers). The first results show that the memetic algorithm can produce high quality solutions. Cross-docking Vehicle routing problem Pickup and Delivery Memetic algorithm http://www.ijsom.com/article_2453_e07cbbc65a3ecffa3df3458ffd4baeb9.pdf