IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v41y1995i3p496-512.html
   My bibliography  Save this article

An Integer Programming Model for Locating Vehicle Emissions Testing Stations

Author

Listed:
  • Arthur J. Swersey

    (Yale School of Organization and Management, Yale University, New Haven, Connecticut 06511)

  • Lakshman S. Thakur

    (Operations and Information Management Department, School of Business Administration, University of Connecticut, Storrs, Connecticut 06269)

Abstract

Connecticut and other states not in compliance with federal air quality standards are required to implement a motor vehicle inspection program to test vehicles for pollutants---hydrocarbons and carbon monoxide. The problem is to determine the number, size, and locations of stations given constraints on the maximum travel distance from each town to its nearest station and the average waiting time at a station. In this paper we use simulation to find the maximum allowable arrival rates (in vehicles per hour) of stations of different sizes and formulate the station location problem as a set covering model. We generate a range of solutions through sensitivity analysis, varying both the average waiting time and maximum distance constraints. Comparing the current configuration of stations in Connecticut to our integer programming solutions we find that the integer programming approach reduces the objective function by at least $3 million. The current configuration has more stations than the IP solutions but they are not as well distributed.

Suggested Citation

  • Arthur J. Swersey & Lakshman S. Thakur, 1995. "An Integer Programming Model for Locating Vehicle Emissions Testing Stations," Management Science, INFORMS, vol. 41(3), pages 496-512, March.
    • Handle: RePEc:inm:ormnsc:v:41:y:1995:i:3:p:496-512
    DOI: 10.1287/mnsc.41.3.496
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.41.3.496
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.41.3.496?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qian Wang & Rajan Batta & Christopher M. Rump, 2004. "Facility location models for immobile servers with stochastic demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 137-152, February.
    2. Grossman, Thomas A. & Brandeau, Margaret L., 2002. "Optimal pricing for service facilities with self-optimizing customers," European Journal of Operational Research, Elsevier, vol. 141(1), pages 39-57, August.
    3. Troncoso, Juan J. & Garrido, Rodrigo A., 2005. "Forestry production and logistics planning: an analysis using mixed-integer programming," Forest Policy and Economics, Elsevier, vol. 7(4), pages 625-633, May.
    4. Wright, Christine M. & Mechling, George, 2002. "The importance of operations management problems in service organizations," Omega, Elsevier, vol. 30(2), pages 77-87, April.
    5. Bapna, Ravi & Thakur, Lakshman S. & Nair, Suresh K., 2002. "Infrastructure development for conversion to environmentally friendly fuel," European Journal of Operational Research, Elsevier, vol. 142(3), pages 480-496, November.
    6. Daniel, S. E. & Diakoulaki, D. C. & Pappis, C. P., 1997. "Operations research and environmental planning," European Journal of Operational Research, Elsevier, vol. 102(2), pages 248-263, October.
    7. Amini, M. Mehdi & Retzlaff-Roberts, Donna & Bienstock, Carol C., 2005. "Designing a reverse logistics operation for short cycle time repair services," International Journal of Production Economics, Elsevier, vol. 96(3), pages 367-380, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:41:y:1995:i:3:p:496-512. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.