Skip to main content
MathOverflow

Return to Question

deleted 82 characters in body
Source Link
Nhân
Nhân
  • 11
  • 2

Given:

Set of n>0 cities is to be traversed by m>0 salespeople

Where all the salespeople:

  • Set of $n\gt0$ cities is to be traversed by $m \gt 0$ salesmen;

    Are positioned at the same starting city;

  • Where all the salesmen:

    • Are positioned at the same starting city;
    • Finish at a same destination (which different from starting city).
    Finish at a same destination (which different from starting city);

The problem is to determine $m$m routes such that all the salesmen have to:

  • Start from the starting city;
  • Visits each city exactly once;
  • Return to the same destination withWith optimal traversal cost/distance (load balancing if possible);
  • Each city must be visited exactly once by one salesmen.

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article (or a solution if possible).

Thank you in advance!

Given:

  • Set of $n\gt0$ cities is to be traversed by $m \gt 0$ salesmen;

  • Where all the salesmen:

    • Are positioned at the same starting city;
    • Finish at a same destination (which different from starting city).

The problem is to determine $m$ routes such that all the salesmen have to:

  • Start from the starting city;
  • Visits each city exactly once;
  • Return to the same destination with optimal traversal cost/distance (load balancing if possible).

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article (or a solution if possible).

Thank you in advance!

Given:

Set of n>0 cities is to be traversed by m>0 salespeople

Where all the salespeople:

  • Are positioned at the same starting city;
  • Finish at a same destination (which different from starting city);

The problem is to determine m routes:

  • With optimal traversal cost/distance (load balancing if possible);
  • Each city must be visited exactly once by one salesmen.

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article (or a solution if possible).

Thank you in advance!

Formatting, minor corrections
Source Link
David Roberts ♦
David Roberts ♦
  • 35.4k
  • 11
  • 124
  • 348

Algorithm for multiple travelling salemenssalesmen problem with given starting point and end point

Please feel free to edit/rename the question...Given:

  • Set of $n\gt0$ cities is to be traversed by $m \gt 0$ salesmen;

  • Where all the salesmen:

    • Are positioned at the same starting city;
    • Finish at a same destination (which different from starting city).

Here's theThe problem is to determine $m$ routes such that all the salesmen have to:

 Given:
 - Set of n (n > 0) cities is to be traversed by m (m > 0) salesmens
 - Where all the salesmen:
     - Are positioned at the same starting city
     - Finish at a same destination (which different from starting city). 

 The problem is to determine m route such that all the salesmen have to:
 - Start from the starting city
 - Visits each city exactly once 
 - Return to the same destination with optimal traversal cost/distance (load balancing if possible).
  • Start from the starting city;
  • Visits each city exactly once;
  • Return to the same destination with optimal traversal cost/distance (load balancing if possible).

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must be return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article  ( oror a solution if possible).

Thank you in advance!

Algorithm for multiple travelling salemens problem with given starting point and end point

Please feel free to edit/rename the question...

Here's the problem:

 Given:
 - Set of n (n > 0) cities is to be traversed by m (m > 0) salesmens
 - Where all the salesmen:
     - Are positioned at the same starting city
     - Finish at a same destination (which different from starting city). 

 The problem is to determine m route such that all the salesmen have to:
 - Start from the starting city
 - Visits each city exactly once 
 - Return to the same destination with optimal traversal cost/distance (load balancing if possible).

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must be return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article( or a solution if possible)

Thank you in advance!

Algorithm for multiple travelling salesmen problem with given starting point and end point

Given:

  • Set of $n\gt0$ cities is to be traversed by $m \gt 0$ salesmen;

  • Where all the salesmen:

    • Are positioned at the same starting city;
    • Finish at a same destination (which different from starting city).

The problem is to determine $m$ routes such that all the salesmen have to:

  • Start from the starting city;
  • Visits each city exactly once;
  • Return to the same destination with optimal traversal cost/distance (load balancing if possible).

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article  (or a solution if possible).

Thank you in advance!

Source Link
Nhân
Nhân
  • 11
  • 2

Algorithm for multiple travelling salemens problem with given starting point and end point

Please feel free to edit/rename the question...

Here's the problem:

 Given:
 - Set of n (n > 0) cities is to be traversed by m (m > 0) salesmens
 - Where all the salesmen:
     - Are positioned at the same starting city
     - Finish at a same destination (which different from starting city). 

 The problem is to determine m route such that all the salesmen have to:
 - Start from the starting city
 - Visits each city exactly once 
 - Return to the same destination with optimal traversal cost/distance (load balancing if possible).

Details:

I am a beginner in this kind of problem. Have been reading a lot of paper but mostly "must be return to the same city".

What "kind" of problem is this?

How would you implement a solution for it?

Please help me with keywords or article( or a solution if possible)

Thank you in advance!