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

Vehicle Routing at Quality Stores

Author

Listed:
  • Candace Arai Yano

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117)

  • Thomas J. Chan

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117)

  • Lori Kaplan Richter

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117)

  • Theodore Cutler

    (Quality Stores, Inc., 1460 Whitehall Road, North Muskegon, Michigan 49445)

  • Katta G. Murty

    (Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117)

  • David McGettigan

    (Quality Stores, Inc., 1460 Whitehall Road, North Muskegon, Michigan 49445)

Abstract

Vehicle routing optimization software has been implemented on a personal computer for Quality Stores, a chain of retail stores. Customized route generation procedures are combined with an efficient branch-and-bound procedure to obtain optimal routings and assignment of routes to trucks. Both the data base maintenance routines and optimization runs are completely menu-driven, enabling personnel with no prior exposure to computers or optimization to operate the software unaided.

Suggested Citation

  • Candace Arai Yano & Thomas J. Chan & Lori Kaplan Richter & Theodore Cutler & Katta G. Murty & David McGettigan, 1987. "Vehicle Routing at Quality Stores," Interfaces, INFORMS, vol. 17(2), pages 52-63, April.
    • Handle: RePEc:inm:orinte:v:17:y:1987:i:2:p:52-63
    DOI: 10.1287/inte.17.2.52
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.17.2.52
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.17.2.52?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. Toth, Paolo & Vigo, Daniele, 1999. "A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls," European Journal of Operational Research, Elsevier, vol. 113(3), pages 528-543, March.
    2. Dominguez, Oscar & Guimarans, Daniel & Juan, Angel A. & de la Nuez, Ignacio, 2016. "A Biased-Randomised Large Neighbourhood Search for the two-dimensional Vehicle Routing Problem with Backhauls," European Journal of Operational Research, Elsevier, vol. 255(2), pages 442-462.
    3. Palhazi Cuervo, Daniel & Goos, Peter & Sörensen, Kenneth & Arráiz, Emely, 2014. "An iterated local search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 237(2), pages 454-464.
    4. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).
    5. Christos D. Tarantilis & Afroditi K. Anagnostopoulou & Panagiotis P. Repoussis, 2013. "Adaptive Path Relinking for Vehicle Routing and Scheduling Problems with Product Returns," Transportation Science, INFORMS, vol. 47(3), pages 356-379, August.
    6. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    7. Queiroga, Eduardo & Frota, Yuri & Sadykov, Ruslan & Subramanian, Anand & Uchoa, Eduardo & Vidal, Thibaut, 2020. "On the exact solution of vehicle routing problems with backhauls," European Journal of Operational Research, Elsevier, vol. 287(1), pages 76-89.
    8. Gajpal, Yuvraj & Abad, P.L., 2009. "Multi-ant colony system (MACS) for a vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 196(1), pages 102-117, July.
    9. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    10. Santos, Maria João & Curcio, Eduardo & Mulati, Mauro Henrique & Amorim, Pedro & Miyazawa, Flávio Keidi, 2020. "A robust optimization approach for the vehicle routing problem with selective backhauls," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    11. Ganesh, K. & Narendran, T.T., 2007. "CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up," European Journal of Operational Research, Elsevier, vol. 178(3), pages 699-717, May.
    12. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    13. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
    14. J-F Chen & T-H Wu, 2006. "Vehicle routing problem with simultaneous deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 579-587, May.
    15. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.

    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:17:y:1987:i:2:p:52-63. 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.