Breakdown Mechanic Location Problem英文文献资料.docVIP

Applied Mathematics, 2012, 3, 467-472 /10.4236/am.2012.35070 Published Online May 2012 (http://www.SciRP.org/journal/am) Breakdown Mechanic Location Problem Cheikh B. Djiba , Mamadou Balde , Babacar M. Ndiaye , Roger M. Faye , Diaraf Seck 1 1 2 1 2,3 1 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 2 3 Email: cdjiba83@yahoo.fr, mbalde111@ucad.sn, {roger.faye, babacarm.ndiaye, diaraf.seck}@.sn Received March 2, 2012; revised March 28, 2012; accepted April 5, 2012 ABSTRACT 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. Keywords: Optimization; Location; Assignment; Urban Transportation Network 1. Introduction tion problem wherein breakdown mechanics are assigned to potential sites to provide adequate coverage. In their previous studies, the 3D company has ad- dressed questions of how many units to use, what is de- mand at the a