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

Saving Federal Travel Dollars

Author

Listed:
  • Jeffrey L. Huisingh

    (US Army Cadet Command, 55 Patch Road, Fort Monroe, Virginia 23651-1052)

  • Harold M. Yamauchi

    (Rolands and Associates Corporation, 500 Sloat Avenue, Monterey, California 93940-3535)

  • Randy Zimmerman

    (TRADOC Analysis Center, 255 Sedgwick Avenue, Fort Leavenworth, Kansas 66027-2345)

Abstract

Federal employees frequently travel to professional-development conferences and training events. Conference planners often decide on event locations arbitrarily with little regard for travel cost. We developed a method for evaluating travel costs and determining the least expensive conference site from over 261 US cities with government-contracted air-fares. It involves using the relaxation method for solving the noncapacitated shortest-path-network problem and computing interairport distances using latitude and longitude data. A decision support tool called OffSite allows conference planners to assess collective travel costs for attendees arriving from geographically dispersed locations. Event planners input a list of origin cities for conference participants, and OffSite then determines the lowest-cost location. This tool can restrict the search for meeting venues to the origin locations of potential hosts for the conference. In addition, OffSite is flexible enough to allow planners to choose a preferred destination.

Suggested Citation

  • Jeffrey L. Huisingh & Harold M. Yamauchi & Randy Zimmerman, 2001. "Saving Federal Travel Dollars," Interfaces, INFORMS, vol. 31(5), pages 13-23, October.
    • Handle: RePEc:inm:orinte:v:31:y:2001:i:5:p:13-23
    DOI: 10.1287/inte.31.5.13.9657
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.31.5.13.9657
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.31.5.13.9657?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. Dimitri P. Bertsekas & Paul Tseng, 1988. "Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems," Operations Research, INFORMS, vol. 36(1), pages 93-114, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Patrick Hew, 2007. "ASP, The Art and Science of Practice: Direct Advisors vs. Tool Developers---Implications for Practice," Interfaces, INFORMS, vol. 37(3), pages 279-284, June.
    2. Peter McKenzie & Alexandra M. Newman & Luis Tenorio, 2008. "Front Range Aggregates Optimizes Feeder Movements at Its Quarry," Interfaces, INFORMS, vol. 38(6), pages 436-447, December.

    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. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    2. P. Beraldi & F. Guerriero & R. Musmanno, 1997. "Efficient Parallel Algorithms for the Minimum Cost Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 501-530, December.
    3. Sharma, R. R. K. & Sharma, K. D., 2000. "A new dual based procedure for the transportation problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 611-624, May.
    4. B Karimi & S M T Fatemi Ghomi & J M Wilson, 2006. "A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 140-147, February.
    5. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    6. Carvalho, Desiree M. & Nascimento, Mariá C.V., 2022. "Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup," European Journal of Operational Research, Elsevier, vol. 296(1), pages 158-173.
    7. Sebastian Lozano & Belarmino Adenso-Diaz, 2018. "Network DEA-based biobjective optimization of product flows in a supply chain," Annals of Operations Research, Springer, vol. 264(1), pages 307-323, May.
    8. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
    9. Elsie Sterbin Gottlieb, 2002. "Solving generalized transportation problems via pure transportation problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 666-685, October.
    10. Meyr, Herbert & Mann, Matthias, 2013. "A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production Lines," European Journal of Operational Research, Elsevier, vol. 229(3), pages 718-731.
    11. Antonio Frangioni & Antonio Manca, 2006. "A Computational Study of Cost Reoptimization for Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 61-70, February.

    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:31:y:2001:i:5:p:13-23. 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.