Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Question on Solving SPCTSP with UDC #29

Open
abcdhhhh opened this issue Jan 5, 2025 · 0 comments
Open

Question on Solving SPCTSP with UDC #29

abcdhhhh opened this issue Jan 5, 2025 · 0 comments

Comments

@abcdhhhh
Copy link

abcdhhhh commented Jan 5, 2025

Thanks for your excellent research! I have a question on solving SPCTSP with UDC (https://github.com/CIAM-Group/NCO_code/tree/main/single_objective/UDC-Large-scale-CO-master/UDC/SPCTSP-AGNN-POMO).

In SPCTSP, the real collected prize of each node only becomes known upon visitation. Due to the uncertainty, a fixed tour planned before visitation could be invalid. In my understanding, it is only allow to reveal the real prize when planning the final tour.

In UDC, do you reveal the real prize during each conquering step, or only during the final conquering step? How do you ensure the validity of the final tour?

Hope for your clarification. Thank you.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant