TAS:Situace/Řešitel (F5 nebo F6)/en: Porovnání verzí
Skočit na navigaci
Skočit na vyhledávání
(založena nová stránka s textem „Solver (F5 or F6)“) |
(založena nová stránka s textem „<br />“) |
||
| (Není zobrazena jedna mezilehlá verze od jednoho dalšího uživatele.) | |||
| Řádek 1: | Řádek 1: | ||
<languages /> | <languages /> | ||
[[File:TAS_Situace_eitel_(F5_nebo_F6)128Resit.png]] | [[File:TAS_Situace_eitel_(F5_nebo_F6)128Resit.png]] | ||
| Řádek 6: | Řádek 7: | ||
The '''F5''' or '''F6''' key can be used. | The '''F5''' or '''F6''' key can be used. | ||
* [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/Pou%C5%BEij_heuristiku_pro_v%C3%BDm%C4%9Bnu_vozidel Use heuristics to change vehicles] | * [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/Pou%C5%BEij_heuristiku_pro_v%C3%BDm%C4%9Bnu_vozidel/en Use heuristics to change vehicles] | ||
* [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/R%C5%AFzn%C3%A9_situace_v_%C5%99e%C5%A1iteli Different situations in the solver] | * [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/R%C5%AFzn%C3%A9_situace_v_%C5%99e%C5%A1iteli/en Different situations in the solver] | ||
* [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/Zásady_řešitele/en Solver Principles] | |||
* [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/Nastavení_řešitele/en Solver options] | |||
* [https://wiki.solvertech.cz/wiki/TAS:Situace/%C5%98e%C5%A1itel_(F5_nebo_F6)/Funkce_řešitele/en Solver features] | |||
</div> | </div> | ||
Aktuální verze z 4. 4. 2023, 07:48
128Resit.png)
Starts the solution calculation.
The F5 or F6 key can be used.
- Use heuristics to change vehicles
- Different situations in the solver
- Solver Principles
- Solver options
- Solver features
At the core of the Tasha computations is a heuristic algorithm based on the scientific paper(s) "A general heuristic for vehicle routing problems" by David Pisinger and Stefan Ropke. It uses the "Ruin and Recreate" method for state space shifting, and the Simulated Annealing method for solution evaluation.
The main advantage of the algorithm is its extensibility and generality in solving a wide range of problems. The algorithm has also been developed and updated since 2006 and has stood the test of time in solving many different types of problems.