I want to solve Heterogeneous fleet in vehicle routing problem using the Clarke and Wright saving algorithm. After reading many literature I found two options:

  1. Explicit and early assignment for the route.

  2. Using saving algorithm sequentially, and iterating over all generated routes to fulfill capacity constraints.

But I'm unsure about these two options. Is there any other solution?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.