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

Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems

Author

Listed:
  • Don Weigel

    (Transportation/Logistics Services ESRI, Inc., 380 New York Street, Redlands, California 92373)

  • Buyang Cao

    (Transportation/Logistics Services ESRI, Inc., 380 New York Street, Redlands, California 92373)

Abstract

Sears, Roebuck and Company uses a vehicle-routing-and-scheduling system based on a geographic information system to run its delivery and home service fleets more efficiently. Although the problems to be solved can be modeled as vehicle-routing problems with time windows (VRPTW), the size of the problems and thus practical complexity make these problems of both theoretical and practical interest. We constructed a series of algorithms, including the algorithm to build the origin-and-destination matrix, the algorithm to assign resources, and algorithms to perform sequencing and route improvement. The combination of GIS and OR techniques makes the system quite efficient. The system has improved the Sears technician-dispatching and home-delivery business; resulting in over $9 million in one-time savings and over $42 million in annual savings. The success of this application also suggests a promising link between GIS and OR techniques.

Suggested Citation

  • Don Weigel & Buyang Cao, 1999. "Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems," Interfaces, INFORMS, vol. 29(1), pages 112-130, February.
    • Handle: RePEc:inm:orinte:v:29:y:1999:i:1:p:112-130
    DOI: 10.1287/inte.29.1.112
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.29.1.112
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.29.1.112?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. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    2. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    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. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    2. Helena Ramalhinho-Lourenço, 2005. "Teaching metaheuristics in business schools," Economics Working Papers 806, Department of Economics and Business, Universitat Pompeu Fabra.
    3. De Boeck, Kim & Decouttere, Catherine & Jónasson, Jónas Oddur & Vandaele, Nico, 2022. "Vaccine supply chains in resource-limited settings: Mitigating the impact of rainy season disruptions," European Journal of Operational Research, Elsevier, vol. 301(1), pages 300-317.
    4. Cavada, Juan P. & Cortés, Cristián E. & Goic, Marcel & Weintraub, Andrés & Zambrano, Juan I., 2020. "Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 287(3), pages 820-831.
    5. Peter C. Bell & Chris K. Anderson, 2002. "In Search of Strategic Operations Research/Management Science," Interfaces, INFORMS, vol. 32(2), pages 28-40, April.
    6. Repoussis, P.P. & Paraskevopoulos, D.C. & Zobolas, G. & Tarantilis, C.D. & Ioannou, G., 2009. "A web-based decision support system for waste lube oils collection and recycling," European Journal of Operational Research, Elsevier, vol. 195(3), pages 676-700, June.
    7. Prasertsri, Peerapon & Kilmer, Richard L., 2004. "Scheduling and Routing Milk from Farm to Processors by a Cooperative," Journal of Agribusiness, Agricultural Economics Association of Georgia, vol. 22(2), pages 1-14.
    8. Wooseung Jang & Huay H. Lim & Thomas J. Crowe & Gail Raskin & Thomas E. Perkins, 2006. "The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance," Interfaces, INFORMS, vol. 36(4), pages 302-313, August.
    9. Prasertsri, Peerapon & Kilmer, Richard L., 2003. "Improving Vertical Coordination From Farm-To-Plant Using A Cooperative," 2003 Annual meeting, July 27-30, Montreal, Canada 22181, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    10. Gayialis, Sotiris P. & Tatsiopoulos, Ilias P., 2004. "Design of an IT-driven decision support system for vehicle routing and scheduling," European Journal of Operational Research, Elsevier, vol. 152(2), pages 382-398, January.
    11. Ines Mathlouthi & Michel Gendreau & Jean-Yves Potvin, 2021. "Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem," SN Operations Research Forum, Springer, vol. 2(1), pages 1-35, March.
    12. Agatz, Niels A.H. & Fleischmann, Moritz & van Nunen, Jo A.E.E., 2008. "E-fulfillment and multi-channel distribution - A review," European Journal of Operational Research, Elsevier, vol. 187(2), pages 339-356, June.
    13. Helena Ramalhinho-Lourenço, 2001. "Supply chain management: An opportunity for metaheuristics," Economics Working Papers 538, Department of Economics and Business, Universitat Pompeu Fabra.
    14. Peter C. Bell & Chris K. Anderson & Stephen P. Kaiser, 2003. "Strategic Operations Research and the Edelman Prize Finalist Applications 1989--1998," Operations Research, INFORMS, vol. 51(1), pages 17-31, February.
    15. Cortés, Cristián E. & Gendreau, Michel & Rousseau, Louis Martin & Souyris, Sebastián & Weintraub, Andrés, 2014. "Branch-and-price and constraint programming for solving a real-life technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 300-312.
    16. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    17. Arthur M. Geoffrion & Ramayya Krishnan, 2001. "Prospects for Operations Research in the E-Business Era," Interfaces, INFORMS, vol. 31(2), pages 6-36, April.
    18. Kim, Nayeon & Montreuil, Benoit & Klibi, Walid & Kholgade, Nitish, 2021. "Hyperconnected urban fulfillment and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).

    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. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    2. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    3. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    4. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    5. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    6. İbrahim Muter & Ş. İlker Birbil & Güvenç Şahin, 2010. "Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 603-619, November.
    7. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    8. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    9. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    10. Jonathan F. Bard & George Kontoravdis & Gang Yu, 2002. "A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 36(2), pages 250-269, May.
    11. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    12. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    13. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    14. Range, Troels Martin, 2013. "Exploiting Set-Based Structures to Accelerate Dynamic Programming Algorithms for the Elementary Shortest Path Problem with Resource Constraints," Discussion Papers on Economics 17/2013, University of Southern Denmark, Department of Economics.
    15. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    16. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    17. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    18. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    19. Zografos, Konstantinos G. & Androutsopoulos, Konstantinos N., 2004. "A heuristic algorithm for solving hazardous materials distribution problems," European Journal of Operational Research, Elsevier, vol. 152(2), pages 507-519, January.
    20. S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam, 2014. "A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 414-446, August.

    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:29:y:1999:i:1:p:112-130. 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.