On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

0.00 Avg rating0 Votes
Article ID: iaor19951766
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 1
End Page Number: 22
Publication Date: Jan 1994
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: networks: path, programming: quadratic
Abstract:

This paper considers the inverse shortest paths problem where arc costs are subject to correlation constraints. The motivation for this research arises from applications in traffic modelling and seismic tomography. A new method is proposed for solving this class of problems. It is constructed as a generalization of the algorithm presented in Burton and Toint for uncorrelated inverse shortest paths. Preliminary numerical experience with the new method is presented and discussed.

Reviews

Required fields are marked *. Your email address will not be published.