haku: @indexterm heuristic methods / yhteensä: 556
viite: 54 / 556
| Tekijä: | Deitch, R. Ladany, S. |
| Otsikko: | The one-period bus touring problem: solved by an effective heuristic for the orienteering tour problem and improvement algorithm |
| Lehti: | European Journal of Operational Research
2000 : NOV 16, VOL. 127:1, p. 69-77 |
| Asiasana: | INTEGER PROGRAMMING LINEAR PROGRAMMING HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | The one-period bus touring problem -- also referred to as simply the bus touring problem (BTP) -- objective is to maximize the total attractiveness of the tour by selecting a subset of sites to be visited and scenic routes to be traveled -- both having associated non-negative attractivity values -- given the geographic frame considerations and constraints on touring time, cost and/or total distance. This article presents a transformation from the BTP to the orienteering tour problem (OTP). |
SCIMA