haku: @indexterm location problem / yhteensä: 219
viite: 99 / 219
| Tekijä: | Laporte, G. Dejax, P. J. |
| Otsikko: | Dynamic location-routeing problems |
| Lehti: | Journal of the Operational Research Society
1989 : MAY, VOL. 40:5, p. 471-482 |
| Asiasana: | LOCATION PROBLEM BRANCH AND BOUND METHODS ALGORITHMS NETWORK ANALYSIS PROBLEM SOLVING |
| Kieli: | eng |
| Tiivistelmä: | Dynamic location-routeing problems involve the determination of a least-cost sequence of depot, vehicle fleet and route configurations over a planning horizon. Two solution approaches to such problems are presented. The first can only be applied if the number of delivery points is small. A general network representation is developed, and a mathematical programming formulation as well as an optimal branch-and-bound algorithm are suggested. As a second approach, an approximation scheme of system costs is introduced for problems which cannot be tackled by an exact algorithm, and a global solution is then obtained by determining a shortest path on a directed graph. |
SCIMA