This paper studies the problem of locating breakdown mechanic. We consider a public transport network in which it can provide buses failure. The objective is, taking into account the statistics of breakdowns registere...This paper studies the problem of locating breakdown mechanic. We consider a public transport network in which it can provide buses failure. The objective is, taking into account the statistics of breakdowns registered on the network, to locate optimally breakdown mechanics so as to minimize the response time (to ensure the network coverage of break- down mechanics). In this work, we present a binary linear programming model for this location problem which provides assignments-locations of areas served. Once the location made, we discuss dynamic assignment of breakdown mechan- ics depending on their position in the network at a given time t. Numerical simulation results are presented based on real data of urban transportation society of Dakar Dem Dikk.展开更多
This paper studies the buses assignment from their depots to their routes starting points in urban transportation network. It describes a computational study to solve the dead mileage minimization to optimality. The o...This paper studies the buses assignment from their depots to their routes starting points in urban transportation network. It describes a computational study to solve the dead mileage minimization to optimality. The objective of this work is to assign the buses to depots while optimizing dead mileage associated with pull-out trips and pull-in trips. To do so, a new mixed-integer programming model with 0 - 1 variables is proposed which takes into account the specificity of the buses of Dakar Dem Dikk (the main public transportation company in Dakar). This company manages a fleet of buses which, depending on road conditions some buses cannot circulate on some roads of the network. Thus, buses are classified into two categories and are assigned based on these categories. The related mixed-integer 0 - 1 linear program is solved efficiently to minimize the cumulative distance covered by all buses. Numerical simulations on real datasets are presented.展开更多
文摘This paper studies the problem of locating breakdown mechanic. We consider a public transport network in which it can provide buses failure. The objective is, taking into account the statistics of breakdowns registered on the network, to locate optimally breakdown mechanics so as to minimize the response time (to ensure the network coverage of break- down mechanics). In this work, we present a binary linear programming model for this location problem which provides assignments-locations of areas served. Once the location made, we discuss dynamic assignment of breakdown mechan- ics depending on their position in the network at a given time t. Numerical simulation results are presented based on real data of urban transportation society of Dakar Dem Dikk.
文摘This paper studies the buses assignment from their depots to their routes starting points in urban transportation network. It describes a computational study to solve the dead mileage minimization to optimality. The objective of this work is to assign the buses to depots while optimizing dead mileage associated with pull-out trips and pull-in trips. To do so, a new mixed-integer programming model with 0 - 1 variables is proposed which takes into account the specificity of the buses of Dakar Dem Dikk (the main public transportation company in Dakar). This company manages a fleet of buses which, depending on road conditions some buses cannot circulate on some roads of the network. Thus, buses are classified into two categories and are assigned based on these categories. The related mixed-integer 0 - 1 linear program is solved efficiently to minimize the cumulative distance covered by all buses. Numerical simulations on real datasets are presented.
