Advertisement
Overview
The Traveling Salesman Problem (TSP) is well documented as being a hard problem to solve, precisely the optimization form (TSP_OPT versus TSP_DECIDE). Chronicling the thesis development steps of the doctoral dissertation to investigate performance enhancements using divide and conquer approaches and parallel computing approaches, this application provides performance (time and quality of route) analysis of seminal work as well original work developed as part of the dissertation. The exhaustive search is the best-known approach in terms of quality of the results, but runtimes become prohibitive for all but the most trivial instances. The Greedy algorithm is the fastest, simplest, and poorest performing in terms of the quality of the solution. This app demonstrates the time and quality of the greedy heuristic algorithm on a variety of problems (trivial, large realistic, and a couple of pathological sample problems).
Features
Time and quality demonstrations of TSP solver algorithms
What's new
This is the first edition - The greedy heuristic algorithm is implemented. Updated at v 3.6.63 to use Win2D Direct 2D graphics rendering package. Also dropped the XAML StackPanel controls because they do not support fitting child elements to fill remaining area. With this fix, the frame element that contains the drawing area now auto resizes elements to fills the remaining area as the main windows is resized. Build version 3.6.67 includes progress indicator and an additional large set. Also included is a toaster notification for Optimization completion feedback, a few bug fixes (abnormal terminate if refresh selected prior to selection of of a problem set (indexing null collection), correction of icon colors for start and end nodes, and adjustment of MinWidth on main page to accommodate single screen on Windows 10X. Build version 3.6.76 removes StackPanel xaml control in favor of the more capable Grid control.
Now has route trace - use canvas control, TODO leverage canvas animated control
Build 3.6.70 now has animated canvas control for route trace, much better performance, much less flickering
Build 3.6.72 has improved route trace graphics / visualization
Build 3.6.75 has improved main selector panel UI feedback (mouse enter/leave)
Build 3.6.84 has minor graph display bug fixes, scenario menu hide
Additional Information
- Developed by r. fine
- Version 2020.09.17
-
Requires
Available on: PC, Mobile, Surface Hub, HoloLens
OS: Windows 10 version 17134.0 or higher
- Published 2020-05-26
- Size 36.17 MB
- File Type appx/msix
-
Language
English (United States)
-
Permissions
Access your Internet connection
- Microsoft Store ID 9pb43hkcn3d8
Advertisement
How to download and install Combinatorial Optimizations Dissertation from the Microsoft
Method 1: Download and Install via the Microsoft Store
This is the most straightforward and secure way to get Combinatorial Optimizations Dissertation.Step 1: Open the Microsoft Store
Step 2: Search for Combinatorial Optimizations Dissertation
Step 3: Download and Install
Step 4: Access the App
Method 2: Download from the Official Microsoft Website
If you prefer downloading directly from the web, you can use the official Microsoft website.Step 1: Visit the Combinatorial Optimizations Dissertation Page
Step 2: Download the App
Step 3: Install Combinatorial Optimizations Dissertation
Step 4: Use Combinatorial Optimizations Dissertation
Tips for a Smooth Installation
Conclusion:
Both methods ultimately utilize the Microsoft Store, ensuring the app's safety and reliability. Whether you prefer browsing within the Store or starting via the website, both approaches lead you to successfully download and install Combinatorial Optimizations Dissertation.Combinatorial Optimizations Dissertation FAQs
How to download and Install Combinatorial Optimizations Dissertation on Windows PC via the NWindows Store
How to Search and Download Combinatorial Optimizations Dissertation for PC Windows?