Answers are grounded in this paper and cite their sources.
A mixed integer programming mathematical formulation of vehicle routing problemwith simultaneous pickups and deliveries, and time window constraints (VRP-SPDTW)is presented in this paper. The proposed model aims at minimizing the vehicle numberand the overall travel cost. A novel two-stage hybrid metaheuristic method for VRP-SDPTWis also proposed. The first stage adopts improved ant colony optimization (IACO) to determinethe minimum number of used vehicles. The second stage employs improved Tabu search to optimizethe total travel cost, in which the initial solutions are obtained by IACO in the first stage.Experimental results demonstrate the effectiveness of the proposed metaheuristic method.
No takes yet. Share an insight, caveat, or question.
Lai et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: