An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries

Abstract

This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.