Track: Logistics

Abstract

Fully accessible bus service is a critical element for a good working public transportation system. Bus stops are a vital link to this situation. Therefore, accessibility to bus stops must be investigated and the bus stops must be located regarding passengers’ demand and their walking availability. In this paper, a set covering problem is studied to find the minimum number of bus stops to be located within a walking coverage limit. A network including 30 demand points and 15 alternative bus stop locations are considered in a university campus. Our goal is to conduct bus stop site selection problem in order to suggest new locations where reachable for passengers within a reasonable walking distance. The proposed 0-1 integer programming model is run under different distance limits and the results are discussed. Results demonstrates that all passengers can reach to any bus stop under four different distance limits and bus station S1 is reachable for whole distance limits. Finally, potential locations for bus stops are suggested.