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

Computational Capacity #1

Open
AGMA71997 opened this issue Aug 21, 2024 · 1 comment
Open

Computational Capacity #1

AGMA71997 opened this issue Aug 21, 2024 · 1 comment

Comments

@AGMA71997
Copy link

Hey,

Thanks for the implementation, but what is the maximum instance size (no. of nodes) for which this implementation is capable of delivering solutions within a short time (lets say a few seconds)?

Kind regards,
Abdo

@Xavier-MaYiMing
Copy link
Owner

Dear Abdo,

The CPU time is influenced by instance characteristics, such as the degree, graph structure, and time-window constraints. In my tests with randomly generated instances, including up to 10,000 vertices and 50,000 edges, the average CPU time was 24.29 seconds on a computer equipped with 32 GB of RAM and an Apple M2 Pro CPU. However, since SPPTW is NP-hard, solving larger instances efficiently may require heuristics or reinforcement learning approaches to produce good solutions within a reasonable time frame.

Additionally, I've refined the code for SPPTW.

Best regards,
Xavier

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

2 participants