Over the last decades, researchers have studied one of the most complex combinatorial problems, i.e., the Concrete Delivery Problem (CDP), set different formulations of it, considered several objectives, and suggested various approaches. But no work has gathered this information to facilitate the comprehensive study of the CDP and investigate the research paths taken until today. Using a systematic search and mapping review, this paper fills that gap by (a) performing a comprehensive search on the CDP, and (b) mapping out and categorizing the existing literature. Specifically, this paper provides an overview of the various methods of the literature, categorizing the problem formulations based on the literature's different concepts, i.e., Integer Programming (IP), Time-Space Network, and the Job Shop model. The consistency between industry needs and existing constraints was discussed, and insights into the data sets corresponding to real-world cases were provided, identifying the necessary data for practitioners.