Collaborative multicenter vehicle routing problem with time windows and mixed deliveries and pickups
作者：
Highlights：
• Study a collaborative mechanism in a CMVRPTW with mixed deliveries and pickups.
• Propose a mixed-integer optimization model for the CMVRPMDPTW.
• Devise a hybrid solution algorithm that combines improved 3D k-means and GA-PSO.
• Conduct a case study to show the applicability of proposed model and algorithms.
• Implement a comparison analysis in five collaborative open-closed scenarios.
摘要
•Study a collaborative mechanism in a CMVRPTW with mixed deliveries and pickups.•Propose a mixed-integer optimization model for the CMVRPMDPTW.•Devise a hybrid solution algorithm that combines improved 3D k-means and GA-PSO.•Conduct a case study to show the applicability of proposed model and algorithms.•Implement a comparison analysis in five collaborative open-closed scenarios.
论文关键词：Vehicle routing problem with time windows and mixed deliveries and pickups,Space–time distance,Transportation resource sharing,3D k-means clustering algorithm,Collaborative alliance
论文评审过程：Received 21 February 2021, Revised 10 January 2022, Accepted 17 February 2022, Available online 25 February 2022, Version of Record 1 March 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2022.116690
