IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v4y1996i1p65-86.html
   My bibliography  Save this article

The Vehicle Routing-Allocation Problem: A unifying framework

Author

Listed:
  • J. Beasley
  • E. Nascimento

Abstract

No abstract is available for this item.

Suggested Citation

  • J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
    • Handle: RePEc:spr:topjnl:v:4:y:1996:i:1:p:65-86
    DOI: 10.1007/BF02568604
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02568604
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02568604?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    2. Duin, Cees & Volgenant, Anton, 1989. "Reducing the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 39(3), pages 332-344, April.
    3. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
    4. John Current & Hasan Pirkul & Erik Rolland, 1994. "Efficient Algorithms for Solving the Shortest Covering Path Problem," Transportation Science, INFORMS, vol. 28(4), pages 317-327, November.
    5. Hasan Pirkul & John Current & V. Nagarajan, 1991. "The Hierarchical Network Design Problem: A New Formulation and Solution Procedures," Transportation Science, INFORMS, vol. 25(3), pages 175-182, August.
    6. John R. Current, 1988. "The Design of a Hierarchical Transportation Network with Transshipment Facilities," Transportation Science, INFORMS, vol. 22(4), pages 270-277, November.
    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. Baldacci, Roberto & Hill, Alessandro & Hoshino, Edna A. & Lim, Andrew, 2017. "Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms," European Journal of Operational Research, Elsevier, vol. 262(3), pages 879-893.
    2. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    3. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    4. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 0. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-25.
    5. Wang, Mengtong & Zhang, Canrong & Bell, Michael G.H. & Miao, Lixin, 2022. "A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1258-1276.
    6. Fatih Rahim & Canan Sepil, 2014. "A location-routing problem in glass recycling," Annals of Operations Research, Springer, vol. 223(1), pages 329-353, December.
    7. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    8. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    9. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
    10. R. Baldacci & M. Dell'Amico & J. Salazar González, 2007. "The Capacitated m -Ring-Star Problem," Operations Research, INFORMS, vol. 55(6), pages 1147-1162, December.
    11. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    12. Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang, 2021. "Algorithms for the metric ring star problem with fixed edge-cost ratio," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 499-523, October.
    13. Senay Solak & Christina Scherrer & Ahmed Ghoniem, 2014. "The stop-and-drop problem in nonprofit food distribution networks," Annals of Operations Research, Springer, vol. 221(1), pages 407-426, October.
    14. Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch, 2022. "Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1157-1175, March.
    15. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
    16. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.

    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. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    2. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
    3. Gollowitzer, Stefan & Gouveia, Luis & Ljubić, Ivana, 2013. "Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities," European Journal of Operational Research, Elsevier, vol. 225(2), pages 211-222.
    4. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    5. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    6. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    7. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    8. Obreque, Carlos & Donoso, Macarena & Gutiérrez, Gabriel & Marianov, Vladimir, 2010. "A branch and cut algorithm for the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 28-35, January.
    9. Eduardo Álvarez-Miranda & Ivana Ljubić & S. Raghavan & Paolo Toth, 2015. "The Recoverable Robust Two-Level Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 1-19, February.
    10. Masashi Miyagawa, 2014. "Optimal allocation of area in hierarchical road networks," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 53(2), pages 617-630, September.
    11. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
    12. Matisziw, Timothy C. & Murray, Alan T. & Kim, Changjoo, 2006. "Strategic route extension in transit networks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 661-673, June.
    13. Roy, Sandeepan & Maji, Avijit, 2019. "A Station Location Identification Model for an Integrated Interoperable High-Speed Rail System," ADBI Working Papers 956, Asian Development Bank Institute.
    14. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    15. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    16. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 102-110, June.
    17. Bowerman, Robert & Hall, Brent & Calamai, Paul, 1995. "A multi-objective optimization approach to urban school bus routing: Formulation and solution method," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 107-123, March.
    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. Masashi Miyagawa, 2009. "Optimal hierarchical system of a grid road network," Annals of Operations Research, Springer, vol. 172(1), pages 349-361, November.
    20. S. A. MirHassani & R. Ebrazi, 2013. "A Flexible Reformulation of the Refueling Station Location Problem," Transportation Science, INFORMS, vol. 47(4), pages 617-628, November.

    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:spr:topjnl:v:4:y:1996:i:1:p:65-86. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.