Solving the k-centre problem as a method for supporting the Park and Ride facilities location decision

@article{Prokop2016SolvingTK,
  title={Solving the k-centre problem as a method for supporting the Park and Ride facilities location decision},
  author={Bartosz Prokop and Jan W. Owsinski and Krzysztof Sep and Piotr Sapiecha},
  journal={2016 Federated Conference on Computer Science and Information Systems (FedCSIS)},
  year={2016},
  pages={1223-1228}
}
In this article we analyze the problem of optimal location of transportation hubs in Warsaw, namely the Park and Ride location problem (P&RP).We take into account the expected travel time using public transport between particular points of the trip. In the currently existing P&R system we have 14 hub locations, and in this case the maximum travel time exceeds 50 minutes. The P&R problem can be reduced to the centers location problem (in our particular approach - the dominating set problem, DS… CONTINUE READING