AM  Vol.3 No.5 , May 2012
Breakdown Mechanic Location Problem
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.

Cite this paper
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.
References
[1]   C. B. Djiba, “Optimal Assignment of Routes to a Terminal for an Urban Transport Network,” Master of Research Engineering Sciences, Polytechnique Graduate School of Dakar, Cheikh Anta Diop University, 2008.

[2]   Full Traffic of Dakar Dem Dikk (2008-2009). File InputOutput. http://www.demdikk.com

[3]   M. Dakin, “Network and Discrete Location: Models, Algorithms and Applications,” Wiley Interscience, New York, 1995. doi:10.1002/9781118032343

[4]   N. D. Pizzolato, B. Hamilton and D. S. Fraga, “The Location of Public Schools: Evaluation of Practical Experiences,” International Transactions in Operational Research, Vol. 4, No. 1, 1997, pp. 13-22.

[5]   M. R. Nooradelena and A. G. Noraida, “An Application of the p-Median Problem with Uncertainty in demand in Emergency Medical Services,” Proceedings of the 2nd IMT-GT Regional Conference on Mathematics, Statistics and Applications, Universiti Sains Malaysia, Penang, 1315 June 2006.

[6]   S. L. Hakimi, “Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems,” Operations Research, Vol. 13, No. 3, 1965, pp. 462-475. doi:10.1287/opre.13.3.462

[7]   S. L. Hakimi, “Optimization Locations of Switching Centers and the Absolute Centers and Medians of a Graph,” Operations Research, Vol. 12, No. 3, 1964, pp. 450-459. doi:10.1287/opre.12.3.450

[8]   R. Honey, G. Rushton, P. Lononis, B. Dalziel, M. Armstrong and S. D. P. Densham, “Stages in the Adoption of a Spatial Decision Support System for Reorganizing Service Delivery Regions,” Environment and Planning C: Government and Policy, Vol. 9, No. 1, 1991, pp. 51-63. doi:10.1068/c090051

[9]   D. Willer, “A Spatial Decision Support System for Bank Location: A Case Study,” NCGIA Technical Report 90-9, 1990.

[10]   P. Chardaire and J. L. Lutton, “Using Simulated Annealing to Solve Concentrator Location Problems in Telecommunication Networks, Applied Simulated Annealing,” Springer, Berlin, 1993, pp. 175-199.

[11]   P. Densham and G. Rushton, “A More Efficient Heuristic for Solving Large p-Median Problems,” Papers in Regional Science, Vol. 71, 1996, pp. 307-329.

[12]   INRO Consultants Inc., EMME User’s Manual, 2007.

[13]   IBM ILOG CPLEX Optimization Studio V12.3, “Using the CPLEXR Callable Library and CPLEX Barrier and Mixed Integer Solver Options,” 2011. http://www-01.ibm.com/software/integration/optimization/cplex-optimization-studio

[14]   B. Boffey, R. Galva and L. Espejo, “A Review of Congestion Models in the Location of Facilities with Immobile Servers,” European Journal of Operational Research, Vol. 178, No. 3, 2007, pp. 643-662. doi:10.1016/j.ejor.2006.04.044

 
 
Top