IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v89y1996i1p108-126.html
   My bibliography  Save this article

A heuristic algorithm for the asymmetric capacitated vehicle routing problem

Author

Listed:
  • Vigo, Daniele

Abstract

No abstract is available for this item.

Suggested Citation

  • Vigo, Daniele, 1996. "A heuristic algorithm for the asymmetric capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 89(1), pages 108-126, February.
    • Handle: RePEc:eee:ejores:v:89:y:1996:i:1:p:108-126
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)90060-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    2. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    3. Matteo Fischetti & Paolo Toth & Daniele Vigo, 1994. "A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs," Operations Research, INFORMS, vol. 42(5), pages 846-859, October.
    4. Matteo Fischetti & Paolo Toth, 1989. "An Additive Bounding Procedure for Combinatorial Optimization Problems," Operations Research, INFORMS, vol. 37(2), pages 319-328, April.
    5. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    6. Paessens, H., 1988. "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 34(3), pages 336-344, March.
    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. 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.
    2. Ann Melissa Campbell & Martin Savelsbergh, 2004. "Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 38(3), pages 369-378, August.
    3. Paolo Toth & Daniele Vigo, 2003. "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 333-346, November.
    4. Roberto Aringhieri & Maurizio Bruglieri & Federico Malucelli & Maddalena Nonato, 2018. "A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case," Transportation Science, INFORMS, vol. 52(2), pages 277-299, March.
    5. 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.
    6. 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.
    7. Lucas Agussurja & Shih-Fen Cheng & Hoong Chuin Lau, 2019. "A State Aggregation Approach for Stochastic Multiperiod Last-Mile Ride-Sharing Problems," Service Science, INFORMS, vol. 53(1), pages 148-166, February.
    8. Carrese, Stefano & Cuneo, Valerio & Nigro, Marialisa & Pizzuti, Raffaele & Ardito, Cosimo Federico & Marseglia, Guido, 2022. "Optimization of downstream fuel logistics based on road infrastructure conditions and exposure to accident events," Transport Policy, Elsevier, vol. 124(C), pages 96-105.
    9. Merve Cengiz Toklu, 2023. "A fuzzy multi-criteria approach based on Clarke and Wright savings algorithm for vehicle routing problem in humanitarian aid distribution," Journal of Intelligent Manufacturing, Springer, vol. 34(5), pages 2241-2261, June.
    10. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    11. Arvind U. Raghunathan & David Bergman & John N. Hooker & Thiago Serra & Shingo Kobori, 2024. "Seamless Multimodal Transportation Scheduling," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 336-358, March.
    12. İ K Altınel & T Öncan, 2005. "A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 954-961, August.
    13. 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.
    14. Mehmet Fatih Yuce & Erhan Musaoglu & Ali Gunes, 2016. "Enhancing heuristic bubble algorithm with simulated annealing," Cogent Business & Management, Taylor & Francis Journals, vol. 3(1), pages 1220662-122, December.
    15. Bortfeldt, Andreas & Hahn, Thomas & Männel, Dirk & Mönch, Lars, 2015. "Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 82-96.
    16. Wade, A. C. & Salhi, S., 2002. "An investigation into a new class of vehicle routing problem with backhauls," Omega, Elsevier, vol. 30(6), pages 479-487, 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. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    2. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    3. Amirsaman Kheirkhah & HamidReza Navidi & Masume Messi Bidgoli, 2016. "A bi-level network interdiction model for solving the hazmat routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 459-471, January.
    4. 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.
    5. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    6. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
    7. N A Wassan, 2006. "A reactive tabu search for the vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 111-116, January.
    8. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    9. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    10. Martin Schwardt & Kathrin Fischer, 2009. "Combined location-routing problems—a neural network approach," Annals of Operations Research, Springer, vol. 167(1), pages 253-269, March.
    11. N. R. Achuthan & L. Caccetta & S. P. Hill, 2003. "An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 37(2), pages 153-169, May.
    12. Roberto Baldacci & Paolo Toth & Daniele Vigo, 2010. "Exact algorithms for routing problems under vehicle capacity constraints," Annals of Operations Research, Springer, vol. 175(1), pages 213-245, March.
    13. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    14. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    15. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    16. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    17. A A Juan & J Faulin & J Jorba & D Riera & D Masip & B Barrios, 2011. "On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1085-1097, June.
    18. 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.
    19. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    20. M. Kritikos & G. Ioannou, 2017. "A greedy heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1223-1235, October.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:89:y:1996:i:1:p:108-126. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.