We introduce a novel optimization problem to support the planning and routing of on-demand buses in an urban context. call this bus (ODBRP). Given are fleet with fixed capacity, set stations travel times between them, transportation requests. Each request consists potential departure arrival stations, as well time window, that is, earliest latest time. The aim ODBRP is (1) assign each passenger...

We describe a \topology advisor" for routing of critical (multi-source) buses in building-block design. The tool accepts as input a block layout, a two-layer routing cost structure superposed over the block layout, terminal locations for a multi-source bus, and source-sink delay upper bound (linear or Elmore delay) constraints for all terminal pairs. The b best routing solutions (b a user param...

The bus network design problem is an important problem in transportation planning. It is the problem of determining a network of bus lines which best achieves a predetermined objective. This may be done with or without the presence of rapid transit lines. This study is devoted to solving this problem using genetic algorithm. The fitness function is defined as the benefit to the users of the bus...

We describe a \topology advisor" for routing of critical (multisource) buses in building-block design. The tool accepts as input a block layout, a two-layer routing cost structure superposed over the block layout, terminal locations for a multi-source bus, and source-sink delay upper bound (linear or Elmore delay) constraints for all terminal pairs. The b best routing solutions (b a user parame...

Permutation is a common problem in both computation and communication. We add the buses to the mesh-connected multiprocessors and introduce the tokens to control the buses. We propose to use the mesh with segmented reconngurable bus to increase performance of data routing. Segmented reconngurable bus can not only use the bus-token more eeciently than the traditional bus, but also reduce interco...

This paper proposes a new formulation for the school bus scheduling problem (SBSP), which optimizes start times and operation to minimize transportation cost. The goal is number of buses serve all routes such that each route arrives in time window before starts. We show introducing context-specific features, common many districts, can lead time-indexed integer linear programming (ILP) formulati...

This paper presents a model to schedule school buses transportation routes. Student’s daily routes defined between student’s homes, schools and extra curricula activities are analysed while accounting for three different objectives: number of vehicles, route total time and average passenger travelling time. A combined multiobjective function is defined. As solution method to this problem, a heu...

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...