Hybrid Clustering Algorithms with GRASP to Construct an Initial Solution for the MVPPDP
作者机构:Computer Science DepartmentCollege of Computer and Information SciencesKing Saud UniversityRiyadhSaudi Arabia College of ComputerQassim UniversityBuraydahSaudi Arabia
出 版 物:《Computers, Materials & Continua》 (计算机、材料和连续体(英文))
年 卷 期:2020年第62卷第3期
页 面:1025-1051页
核心收录:
学科分类:0831[工学-生物医学工程(可授工学、理学、医学学位)] 0808[工学-电气工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 07[理学] 0805[工学-材料科学与工程(可授工学、理学学位)] 0701[理学-数学] 0801[工学-力学(可授工学、理学学位)] 0812[工学-计算机科学与技术(可授工学、理学学位)] 070101[理学-基础数学]
主 题:Multi-vehicle profitable pickup and delivery problem K-means clustering algorithm ant colony optimisation greedy randomised adaptive search procedure metaheuristic algorithms
摘 要: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 *** demand for e-commerce increases tremendously,the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer *** 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 *** this paper,we proposed hybrid clustering algorithms with the greedy randomised adaptive search procedure(GRASP)to construct an initial solution for the *** approaches first cluster the search space in order to reduce its dimensionality,then use GRASP to build routes for each *** compared our results with state-of-the-art construction heuristics that have been used to construct initial solutions to this *** results show that our proposed algorithms contribute to achieving excellent performance in terms of both quality of solutions and processing time.