Simulated Annealing with a Time-Slot Heuristic for Ready-Mix Concrete Delivery
The concrete delivery problem (CDP) is an NP-hard, real world combinatorial optimization problem. The CDP involves tightly interrelated routing and scheduling constraints that have to be satisfied by considering the tradeoff between production and distribution costs. Various exact and heuristic methods have been developed to address the CDP. However, due to the limitation of the exact methods for dealing with such a complex problem, (meta-)heuristics have been more popular. For this purpose, the present study proposes a hybrid algorithm combining simulated annealing (SA) with a time-slot heuristic (TH) for tackling the CDP. The TH is applied for generating new solutions through perturbation while simulated annealing is utilized to decide on whether to accept these solutions. The proposed algorithm, i.e. SA-TH, is compared to an existing CDP heuristic on a diverse set of CDP benchmarks. The computational results conducted through a series of experiments validate the efficiency and success of SA-TH.
KeywordsReady-mix concrete delivery Vehicle routing Scheduling
This work was supported in part by the National Natural Science Foundation of China (NSFC) under grant 61300159, by the Natural Science Foundation of Jiangsu Province of China under grant BK20130808 and by China Postdoctoral Science Foundation under grant 2015M571751. The authors thank J. Kinable, T. Wauters and G. Vanden Berghe, for providing their CDP source code.
- 7.Lu, M.: HKCONSIM: a simulation platform for planning and optimizing concrete plant operations in Hong Kong. In: Proceedings of International Conference on Innovation and Sustainable Development of Civil Engineering in the 21st Century, Beijing, China, pp. 278–283 (2002)Google Scholar
- 8.Lu, M., Wu, D., Zhang, J.: A particle swarm optimization-based approach to tackling simulation optimization of stochastic, large-scale and complex systems. In: Yeung, D.S., Liu, Z.-Q., Wang, X.-Z., Yan, H. (eds.) ICMLC 2005. LNCS, vol. 3930, pp. 528–537. Springer, Heidelberg (2006). doi: 10.1007/11739685_55 CrossRefGoogle Scholar
- 9.Lu, M., Lam, H.C.: Optimized concrete delivery scheduling using combined simulation and genetic algorithms. In: Proceedings of the 37th Conference on Winter Simulation, Winter Simulation Conference, pp. 2572–2580 (2005)Google Scholar
- 12.Mayteekrieangkrai, N., Wongthatsanekorn, W.: Optimized ready mixed concrete truck scheduling for uncertain factors using bee algorithm. Songklanakarin J. Sci. Technol. 37(2), 221–230 (2015)Google Scholar
- 16.Silva, C., Faria, J., Abrantes, P., Sousa, J., Surico, M., Naso, D.: Concrete delivery using a combination of GA and ACO. In: 44th IEEE Conference on Decision and Control, 2005 and 2005 European Control Conference, CDC-ECC 2005, pp. 7633–7638. IEEE (2005)Google Scholar
- 18.Misir, M., Vancroonenburg, W., Verbeeck, K., Berghe, G.V.: A selection hyper-heuristic for scheduling deliveries of ready-mixed concrete. In: Proceedings of the Metaheuristics International Conference (MIC), Udine, Italy, pp. 289–298 (2011)Google Scholar
- 22.Kinable, J.: (2013). https://sites.google.com/site/cdplib