Paper Info
Title
Search strategies for the feeder bus network design problem
Abstract
This paper reports on computing solutions for a specific problem arising in public transport systems - the Feeder Bus Network Design Problem (FBDP). The problem requires the design of a set of feeder bus routes and the definition of their service frequencies to satisfy both the resource constraints and the demand for transportation: passengers located at any of the bus stops wish to go to any of the stations of a rail transit line in order to access a common destination identified as the central station. The objective is to minimize a cost function, where both passenger and operator interests are considered. This problem may be formulated as a difficult, nonlinear and nonconvex mixed integer problem, classified as NP-hard. The study focuses on a combined building plus improving heuristic procedure, partially taken from literature. The starting module builds up a solution through a sequential savings or a two-phase method, and for the last module the method includes local search, as well as tabu search heuristics with different strategies. Additionally, computational results from a set of problems simulating real life situations are given. Through this experiment the authors conclude that the simplest short-term version of tabu search is one of most promising heuristics.
Year
DOI
Venue
1998
10.1016/S0377-2217(97)00283-X
European Journal of Operational Research
Keywords
Field
DocType
Heuristics,Tabu search,Transportation,Network design,Routing
Flow network,Mathematical optimization,Bus network,Bitwise operation,Network planning and design,Public transport,Heuristics,Local search (optimization),Mathematics,Operations management,Tabu search
Journal
Volume
Issue
ISSN
106
2-3
0377-2217
Citations 
PageRank 
References 
7
0.93
6
Authors
2
Name
Order
Citations
PageRank
Carlos Lúcio Martins170.93
Margarida Vaz Pato218315.05