Author(s)

Cheikh B. Djiba, Mamadou Balde, Babacar M. Ndiaye, Roger M. Faye, Diaraf Seck

Laboratory of Information Processing, ESP, Cheikh Anta Diop University, Dakar, Senegal.
Laboratory of Mathematics of Decision and Numerical Analysis, Cheikh Anta Diop University, Dakar, Senegal.
Unité Mixte Internationale, UMMISCO, Institut de Recherche pour le Développement, Bondy, France.

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.

Optimization; Location; Assignment; Urban Transportation Network

C. Djiba, M. Balde, B. Ndiaye, R. Faye and D. Seck, "Breakdown Mechanic Location Problem," Applied Mathematics, Vol. 3 No. 5, 2012, pp. 467-472. doi: 10.4236/am.2012.35070.