Parallel Savings Based Heuristics for the Delivery Problem

From MaRDI portal





The authors regard the problem of finding a set of routes for a fleet of capacitated vehicles to satisfy the cargo requirements of customers. The vehicles are located in a depot, and have to fulfill the delivery requirements in a sequence that minimizes total delivery costs. All vehicles have the same capacity. The authors present parallel savings algorithms for generating feasible solutions to this problem. The new algorithm combines the savings approach with matching based procedures. The authors compare the algorithm computationally with other heuristics.




Cited in
(20)








This page was built for publication: Parallel Savings Based Heuristics for the Delivery Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978843)