Published May 2012 | Version v1
Journal article

Breakdown Mechanic Location Problem

  • 1. Laboratory of Information Processing, ESP, Cheikh Anta Diop University, Dakar (Senegal)
  • 2. Laboratory of Mathematics of Decision and Numerical Analysis, Cheikh Anta Diop University, Dakar (Senegal)
  • 3. Unite Mixte Internationale, UMMISCO, Institut de Recherche pour le Developpement, Bondy (France)

Description

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 breakdown 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 mechanics 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. (author)

Availability note (English)

Available online: http://dx.doi.org/10.4236/am.2012.35070

Additional details

Publishing Information

Journal Title
Applied Mathematics (Irvine, Calif. : Online)
Journal Volume
2
Journal Issue
5
Journal Page Range
p. 467-472
ISSN
2152-7393

INIS

Country of Publication
United States
Country of Input or Organization
Senegal
INIS RN
50055407
Subject category
S97: MATHEMATICAL METHODS AND COMPUTING;
Descriptors DEI
ALLOCATIONS; BREAKDOWN; BUSES; MASS TRANSIT SYSTEMS; NUMERICAL ANALYSIS; OPTIMIZATION; PUBLIC ENTERPRISES; SENEGAL; STATISTICS; TIME DEPENDENCE
Descriptors DEC
AFRICA; DEVELOPING COUNTRIES; MATHEMATICS; TRANSPORTATION SYSTEMS; VEHICLES

Optional Information

Notes
2 figs.; 2 tabs.; 14 refs.; Copyright © 2018 by authors and Scientific Research Publishing Inc.