0

I have a problem that related to Travelling Salesman Problem with multiple salesmen. I have a list of cities to visit from an initial location,and the all salesmen start and end at the same places .Each salesman have to visit cities and come back to its initial location within given deadline (deadline for distance).The goal is to minimize travelling distance for all saleman.

I tried to solve the problem using MathProg language in GLPK. But i could not come up with good solution (Subtour not properly eliminated,feasible solution not obtained...) .If any body solve this types of problem, I need advise from them...(How to solve my problem and obtain result for this problem)

Vadim Kotov
  • 8,084
  • 8
  • 48
  • 62
Tina
  • 111
  • 1
  • 1
  • 9
  • This is the classical vehicle routing problem (VRP). There are a lot of heuristics and exact algorithms. It generally is not solved directly as a math programming problem because of the exponential size. Some Googling should get you started. – LarrySnyder610 Dec 14 '15 at 15:50
  • @ grendelsdad Thank you for your reply.Can you give me some simple hints from where i can start?Actually i am new in that area.So,any recommendation from you helps me much.Thanks advance.. – Tina Dec 15 '15 at 06:19
  • try http://neo.lcc.uma.es/vrp/. – LarrySnyder610 Dec 16 '15 at 01:09
  • You should look into Genetic algorithms for an efficient way find good solutions to the VRP. – Mark Butler Dec 17 '15 at 14:35
  • @grendelsdad this link helps me much.thank you. – Tina Dec 18 '15 at 02:32
  • @Mark-Thank you for your reply...any useful link helps me much.. – Tina Dec 18 '15 at 02:34

0 Answers0