Hybrid Clustering Algorithms with GRASP to Construct an Initial Solution for the MVPPDP
Mobile commerce (m-commerce) contributes to increasing the popularity of electronic commerce (e-commerce), allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time. As demand for e-commerce increases tremendously, the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction. One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem (MVPPDP), where a selected set of pickup and delivery customers need to be served within certain allowed trip time. In this paper, we proposed hybrid clustering algorithms with the greedy randomised adaptive search procedure (GRASP) to construct an initial solution for the MVPPDP. Our approaches first cluster the search space in order to reduce its dimensionality, then use GRASP to build routes for each cluster. We compared our results with state-of-the-art construction heuristics that have been used to construct initial solutions to this problem. Experimental results show that our proposed algorithms contribute to achieving excellent performance in terms of both quality of solutions and processing time.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Articles published by TSP are under an Open Access license, which means all articles published by TSP are accessible online free of charge and as free of technical and legal barriers to everyone. Published materials can be re-used if properly acknowledged and cited Open Access publication is supported by the authors' institutes or research funding agencies by payment of a comparatively low Article Processing Charge (APC) for accepted articles.