haku: @author Sforza, A. / yhteensä: 2
viite: 1 / 2
« edellinen | seuraava »
| Tekijä: | Avella, P. Boccia, M. Sforza, A. |
| Otsikko: | A penalty function heuristic for the resource constrained shortest path problem |
| Lehti: | European Journal of Operational Research
2002 : OCT, VOL. 142:2, p. 221-230 |
| Asiasana: | HEURISTIC METHODS PROBLEM FORMULATION NETWORKS |
| Kieli: | eng |
| Tiivistelmä: | The resource constrained shortest path problem (RCSP) consists of finding the shortest path between two nodes of an assigned network, with the constraint that traversing an arc of the network implies the consumption of certain limited resources. In this paper the authors propose a new heuristic for the solution of the RCSP problem in medium and large scale networks. It is based on the extension to the discrete case of the penalty function heuristic approach for the fast e-approximate solution of difficult large-scale continuous linear programming problems. Computational experience on test instances has shown that the proposed penalty function heuristic (PFH) is very effective in the solution of medium and large scale RCSP instances. |
« edellinen | seuraava »
SCIMA