IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v37y2007i2p120-132.html
   My bibliography  Save this article

Schlumberger Uses Simulation in Bidding and Executing Land Seismic Surveys

Author

Listed:
  • Peter Mullarkey

    (NetQoS Inc., 6504 Bridge Point Parkway, Suite 501, Austin, Texas 78730)

  • Grant Butler

    (Grant Geophysical Inc., 21 Murranji Street, Hawker, Australian Capital Territory, Australia 2614)

  • Srinagesh Gavirneni

    (Johnson Graduate School of Management, Cornell University, Ithaca, New York 14853)

  • Douglas Morrice

    (McCombs School of Business, University of Texas at Austin, Austin, Texas 78712-1175)

Abstract

Schlumberger and its competitors use seismic surveying, the process of mapping subterranean rock formations with reflected sound waves, as an important first step in identification and recovery of oil and gas reserves. This complicated logistical operation commonly lasts two to six months, covers hundreds of square miles, employs scores of people, and utilizes a large variety of equipment. To win these jobs, Schlumberger participates in a closed bidding process organized by the oil companies. To succeed, it must quickly and accurately estimate the costs of seismic surveys. We developed a simulation tool to evaluate the impact of crew sizes (people and equipment), survey area, geographical region, and weather conditions on survey costs and durations. Schlumberger uses it to obtain and profit from a larger portion of the global seismic survey market. We demonstrated cost savings to clients of about $2 million on four surveys. Based on the number of surveys that Schlumberger conducts each year, it should save about $1.5 to $3 million each year.

Suggested Citation

  • Peter Mullarkey & Grant Butler & Srinagesh Gavirneni & Douglas Morrice, 2007. "Schlumberger Uses Simulation in Bidding and Executing Land Seismic Surveys," Interfaces, INFORMS, vol. 37(2), pages 120-132, April.
    • Handle: RePEc:inm:orinte:v:37:y:2007:i:2:p:120-132
    DOI: 10.1287/inte.1060.0230
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1060.0230
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1060.0230?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
    ---><---

    References listed on IDEAS

    as
    1. John Butler & Douglas J. Morrice & Peter W. Mullarkey, 2001. "A Multiple Attribute Utility Theory Approach to Ranking and Selection," Management Science, INFORMS, vol. 47(6), pages 800-816, June.
    2. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    2. Roel G. van Anholt & Leandro C. Coelho & Gilbert Laporte & Iris F. A. Vis, 2016. "An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines," Transportation Science, INFORMS, vol. 50(3), pages 1077-1091, August.
    3. Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis, 2017. "Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 339-365, September.
    4. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    5. Alessandro Hill & Roberto Baldacci & Edna Ayako Hoshino, 2019. "Capacitated ring arborescence problems with profits," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 357-389, June.
    6. Ángel Corberán & Isaac Plana & Miguel Reula & José M. Sanchis, 2019. "A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 312-326, July.
    7. Jahangirian, Mohsen & Eldabi, Tillal & Naseer, Aisha & Stergioulas, Lampros K. & Young, Terry, 2010. "Simulation in manufacturing and business: A review," European Journal of Operational Research, Elsevier, vol. 203(1), pages 1-13, May.
    8. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    9. Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
    10. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    11. David A. Flores-Garza & M. Angélica Salazar-Aguilar & Sandra Ulrich Ngueveu & Gilbert Laporte, 2017. "The multi-vehicle cumulative covering tour problem," Annals of Operations Research, Springer, vol. 258(2), pages 761-780, November.
    12. Jürgen Branke & Stephen E. Chick & Christian Schmidt, 2007. "Selecting a Selection Procedure," Management Science, INFORMS, vol. 53(12), pages 1916-1932, December.
    13. Ahmed, Mohamed A. & Alkhamis, Talal M., 2009. "Simulation optimization for an emergency department healthcare unit in Kuwait," European Journal of Operational Research, Elsevier, vol. 198(3), pages 936-942, November.
    14. Sigrún Andradóttir & Seong‐Hee Kim, 2010. "Fully sequential procedures for comparing constrained systems via simulation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(5), pages 403-421, August.
    15. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    16. Francesco Carrabs & Carmine Cerrone & Raffaele Cerulli & Bruce Golden, 2020. "An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1030-1048, October.
    17. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
    18. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    19. J Renaud & F F Boctor & G Laporte, 2004. "Efficient heuristics for Median Cycle Problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 179-186, February.
    20. Stephen E. Chick & Noah Gans, 2009. "Economic Analysis of Simulation Selection Problems," Management Science, INFORMS, vol. 55(3), pages 421-437, March.

    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:orinte:v:37:y:2007:i:2:p:120-132. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.