Click here to Skip to main content
15,564,330 members
Home / Discussions / Java
   

Java

 
AnswerRe: How to put the condition if the array may be empty? Pin
Richard MacCutchan26-Nov-22 4:04
mveRichard MacCutchan26-Nov-22 4:04 
GeneralRe: How to put the condition if the array may be empty? Pin
Cris29M26-Nov-22 4:43
Cris29M26-Nov-22 4:43 
GeneralRe: How to put the condition if the array may be empty? Pin
Richard MacCutchan26-Nov-22 5:41
mveRichard MacCutchan26-Nov-22 5:41 
GeneralRe: How to put the condition if the array may be empty? Pin
Cris29M26-Nov-22 5:53
Cris29M26-Nov-22 5:53 
QuestionAddress Book System Help Pin
Ghost 717-Nov-22 20:19
Ghost 717-Nov-22 20:19 
SuggestionRe: Address Book System Help Pin
Richard MacCutchan17-Nov-22 21:38
mveRichard MacCutchan17-Nov-22 21:38 
AnswerRe: Address Book System Help Pin
CHill6018-Nov-22 1:02
mveCHill6018-Nov-22 1:02 
QuestionTravel Salesman Problem find itinerary with highest visited sites attractiveness score Pin
Faroug Tifratene16-Nov-22 1:36
Faroug Tifratene16-Nov-22 1:36 
i am trying develop an algorithm to solve a Travelling Salesman Problem similar case where the goal is to find the best route with the highest attractiveness score (sum of scores for all visited sites/nodes) within a fixed time frame.

to illustrate this more:

a tourist wants to visit N attraction sites in a city and he only has 8 hours to visit as many attraction sites as possible. every site has an attractiveness score and the time spent to visit it.

example:
- site A with ID 0 has an attractiveness score of 90 and requires 10 minutes to visit it ([0, 90, 10])
- site B with ID 1 has an attractiveness score of 69 and requires 7 minutes to visit it ([1, 69, 7])
- site C with ID 2 has an attractiveness score of 72 and requires 7 minutes to visit it ([2, 72, 11])
- site D with ID 3 has an attractiveness score of 116 and requires 16 minutes to visit it ([3, 116, 16])
.
.
.

and so on.

Now we have a time matrix T where T[i][j] represents the necessary time to go from site i to site j. finally we consider site 0 as both the start site and the end site, i.e. the tourist starts his journey at site 0 and returns to site 0 (a hotel for instance).

so the task is to find an itinerary for the tourist to visit as many attractions as possible with a maximum sum score of attractiveness.

example of T matrix for sites A,B,C and D (it could be 50 sites):

T = [0, 40, 35, 90]
[30, 0, 25, 130]
[67, 83, 0, 75]
[45, 79, 130, 0]

The TSP has been solved using different algorithms or methods but i am stuck with this one as it's a little bit different in the sense that the goal is to find the maximum attractiveness score for an itinerary within a time frame, and not the shortest route.

your help is much appreciated

I thought of methods like greedy algorithm, dynamic programming used in TSP but couldn't find a way to solve this particular problem.
QuestionJavaFX ScrollPane scroll child to bottom Pin
MVSoftVM14-Nov-22 7:30
MVSoftVM14-Nov-22 7:30 
AnswerRe: JavaFX ScrollPane scroll child to bottom Pin
englebart19-Nov-22 16:53
professionalenglebart19-Nov-22 16:53 
QuestionError while fetching Path locally during unit testing but not at runtime Pin
saurabh jasmeen mehta12-Nov-22 20:44
saurabh jasmeen mehta12-Nov-22 20:44 
AnswerRe: Error while fetching Path locally during unit testing but not at runtime Pin
Richard MacCutchan12-Nov-22 22:15
mveRichard MacCutchan12-Nov-22 22:15 
AnswerRe: Error while fetching Path locally during unit testing but not at runtime Pin
jschell14-Nov-22 7:36
jschell14-Nov-22 7:36 
Questionradiusofcircle Pin
Halima Kidiwala9-Nov-22 18:03
Halima Kidiwala9-Nov-22 18:03 
AnswerRe: radiusofcircle Pin
Richard MacCutchan9-Nov-22 23:00
mveRichard MacCutchan9-Nov-22 23:00 
Questioncheck and correct the following code Pin
EngySamy23-Oct-22 15:40
EngySamy23-Oct-22 15:40 
GeneralRe: check and correct the following code Pin
Richard MacCutchan23-Oct-22 22:50
mveRichard MacCutchan23-Oct-22 22:50 
GeneralRe: check and correct the following code Pin
EngySamy23-Oct-22 23:55
EngySamy23-Oct-22 23:55 
GeneralRe: check and correct the following code Pin
Richard MacCutchan24-Oct-22 0:24
mveRichard MacCutchan24-Oct-22 0:24 
GeneralRe: check and correct the following code Pin
Dave Kreskowiak24-Oct-22 3:30
mveDave Kreskowiak24-Oct-22 3:30 
GeneralRe: check and correct the following code Pin
Richard MacCutchan24-Oct-22 4:26
mveRichard MacCutchan24-Oct-22 4:26 
AnswerRe: check and correct the following code Pin
jschell24-Oct-22 15:03
jschell24-Oct-22 15:03 
QuestionI have problem in Recursion code please help Pin
EngySamy22-Oct-22 17:19
EngySamy22-Oct-22 17:19 
AnswerRe: I have problem in Recursion code please help Pin
Gerry Schmitz23-Oct-22 6:49
mveGerry Schmitz23-Oct-22 6:49 
GeneralRe: I have problem in Recursion code please help Pin
EngySamy23-Oct-22 15:53
EngySamy23-Oct-22 15:53 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.