• Hi All

    Please note that at the Chandoo.org Forums there is Zero Tolerance to Spam

    Post Spam and you Will Be Deleted as a User

    Hui...

  • When starting a new post, to receive a quicker and more targeted answer, Please include a sample file in the initial post.

VRP based on nearest greedy

Nur Azriati Mat

New Member
Hi and good day,

I had a problem solving a project related to vehicle routing problem. The problem need to be solve using nearest greedy method using excel solver. I had search and try to solve it for a few days but can't get the answer.

There are several condition need to be follows:
1. The vehicle must start and end at depot (depot refer to node 1)
2. The vehicle must visit closest landfill site (either node 2 or 3) before return back to depot
3. Each customer (refer to node 4 until 11) must be visit exactly once by the vehicle

I have try to solve the problem (first condition) but the result show different. The route obtained doesn't start with node 1. For condition 2, I have no idea to start with it. I have attach my excel workbook for reference.

Hopefully, anyone can help me. Thanks in advance.
 

Attachments

  • 11x11.xlsx
    10.9 KB · Views: 7
Back
Top