On the probabilistic traveling salesman problem /
Verjetnostni trgovski potnik je problem trgovskega potnika, pri katerem je množica točk, ki jih mora obiskati, verjetnostna spremenljivka. Za primer privzemimo, da podjetje želi nažrtovati obhod ▫$n$▫ strank z minimalnimi stroški. Če je treba vse stranke obiskati vsakič, je to običajni problem trgov...
Shranjeno v:
| Main Authors: | , |
|---|---|
| Format: | Book Chapter |
| Jezik: | English |
| Teme: | |
| Sorodne knjige/članki: | Vsebovano v:
Proceedings of the 17th International Conference on Mathematical methods in Economics '99 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
| LEADER | 02935naa a2200241 ib4500 | ||
|---|---|---|---|
| 001 | 9035609 | ||
| 003 | SI-MaCOB | ||
| 005 | 19991018000000.0 | ||
| 008 | 990920s1999 xr |||||||||||||| ||eng c | ||
| 040 | |a MAKLJ |b slv |c SI-MaIIZ |d KTFMB |e ppiak | ||
| 080 | |a 519.8 |2 do 4. izd. | ||
| 084 | |a 05C85 |a 60J10 |a 68R10 |a 68Q25 |2 MSC 91 | ||
| 100 | 1 | |a Žerovnik, Janez, |d 1958- |4 aut | |
| 242 | 1 | 0 | |a O problemu verjetnostnega trgovskega potnika. |y slv |
| 245 | 0 | 0 | |a On the probabilistic traveling salesman problem / |c Janez Žerovnik and Janez Brest. |
| 300 | |a Str. 289-295. | ||
| 504 | |a Bibliografija: str. 294-295. | ||
| 520 | |a Verjetnostni trgovski potnik je problem trgovskega potnika, pri katerem je množica točk, ki jih mora obiskati, verjetnostna spremenljivka. Za primer privzemimo, da podjetje želi nažrtovati obhod ▫$n$▫ strank z minimalnimi stroški. Če je treba vse stranke obiskati vsakič, je to običajni problem trgovskega potnika. Če je podmnožica strank vsak dan drugačna, je naloga določiti obhod, pri katerem bo pričakovani (povprečni) strošek minimalen. PTSP je NP-težek problem, ker je posplošitev TSP. Vemo tudi, da je optimalna TSP rešitev lahko poljubno slaba rešitev za PTSP. V prispevku je predstavljena verjetnostna hevristika; ponovitve naključne konstrukcije poti, ki ji sledi lokalna optimizacija. Dodani so rezultati poskusov. | ||
| 520 | |a The probabilistic traveling salesman problem (PTSP) is essentialy the traveling salesman problem (TSP) in which the subset of locations to be visited is a random variable. For motivation assume that a company wants to design a tour through ▫$n$▫ customers and wants to minimize the routing cost only. If all customers have to be visited every day, it is an instance of the classical TSP. Assume however that the same tour has not to be used for a longer period and that the set of customers to be visited every day varies. TSP is a special case of PTSP (with all customers being present with probability 1) and therefore NP-hard. Furthermore, it is known that there are instances of PTSP for which the optimal TSP tour may be arbitrary bad. In this paper we do experimental evaluation of a tour generation based heuristics for PTSP. | ||
| 653 | 0 | |a matematika |a računalništvo |a operacijsko raziskovanje |a kombinatorična optimizacija |a verjetnostni trgovski potnik |a verjetnostni algoritem |a generacija poti | |
| 653 | 0 | |a mathematics |a computer science |a operational research |a combinatorial optimization |a probabilistic traveling salesman |a randomized heuristics |a tour generation | |
| 700 | 1 | 2 | |a Brest, Janez. |4 aut |
| 773 | 0 | |a Mathematical Methods in Economics (International Confrence) (2 : 1999 : Jindřichův Hradec) |t Proceedings of the 17th International Conference on Mathematical methods in Economics '99 |d Jindřichův Hradec : Faculty of Management : Czech Society for Operations Research : University of Economics, Prague, 1999 |w 9035353 |z 8070793716 |g Str. 289-295 | |