Qhov teeb meem ntawm tus neeg muag khoom mus txawv tebchaws nug cov lus nug hauv qab no: "Muab cov npe ntawm lub nroog thiab qhov kev ncua deb ntawm txhua ob lub nroog, txoj kev luv tshaj plaws uas tuaj xyuas txhua lub nroog yog dab tsi thiab rov qab mus rau lub nroog keeb kwm?"
Tus neeg muag khoom mus ncig yog dab tsi?
Tus neeg muag khoom mus txawv tebchaws yog tus muag khoom ntawm qhov rooj mus rau qhov rooj, tseem hu ua a peddler.
Tus neeg muag khoom taug kev puas tau daws?
Cov kws tshawb fawb hauv Japantau daws teeb meem kev mus ncig ntau dua li tus neeg muag khoom ua ntej. Cov qauv yav dhau los rau kev daws teeb meem tam sim no yog 16 "lub nroog," thiab cov kws tshawb fawb no tau siv cov txheej txheem tshiab los daws 22 lub nroog. Lawv hais tias nws yuav tau coj ib txwm von Neumann CPU 1, 200 xyoo los ua ib yam haujlwm.
Yuav daws tus neeg muag khoom mus txawv tebchaws li cas?
Yuav daws TSP siv Brute-Force mus kom ze, koj yuav tsum suav tag nrho cov kev khiav thiab tom qab ntawd kos thiab sau tag nrho cov kev ua tau. Xam qhov kev ncua deb ntawm txhua txoj kev thiab tom qab ntawd xaiv qhov luv tshaj plaws-qhov no yog qhov kev daws teeb meem zoo tshaj plaws. Txoj kev no rhuav tshem qhov teeb meem kom daws tau ntau yam teeb meem.
Puas yog tus neeg muag khoom mus ncig NP- nyuaj?
Traveling Salesman Optimization(TSP-OPT) is a NP-hard problem and Traveling Salesman Search(TSP) is NP-complete. Txawm li cas los xij, TSP-OPT tuaj yeem raug txo rau TSP vim tias yog TSP tuaj yeem daws tau hauv lub sijhawm ntau, ces TSP-OPT (1).
