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

An efficient transformation of the generalized vehicle routing problem

Author

Listed:
  • Ghiani, Gianpaolo
  • Improta, Gennaro

Abstract

No abstract is available for this item.

Suggested Citation

  • Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    • Handle: RePEc:eee:ejores:v:122:y:2000:i:1:p:11-17
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00073-9
    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. H. A. Eiselt & Michel Gendreau & Gilbert Laporte, 1995. "Arc Routing Problems, Part II: The Rural Postman Problem," Operations Research, INFORMS, vol. 43(3), pages 399-414, June.
    2. Laporte, Gilbert & Chapleau, Suzanne & Landry, Philippe-Eric & Mercure, Hélène, 1989. "An algorithm for the design of mailbox collection routes in urban areas," Transportation Research Part B: Methodological, Elsevier, vol. 23(4), pages 271-280, August.
    3. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    4. H. A. Eiselt & Michel Gendreau & Gilbert Laporte, 1995. "Arc Routing Problems, Part I: The Chinese Postman Problem," Operations Research, INFORMS, vol. 43(2), pages 231-242, April.
    Full references (including those not matched with items on IDEAS)

    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. Arbib, Claudio & Servilio, Mara & Archetti, Claudia & Speranza, M. Grazia, 2014. "The directed profitable location Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 811-819.
    2. Akbari, Vahid & Salman, F. Sibel, 2017. "Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity," European Journal of Operational Research, Elsevier, vol. 257(2), pages 625-640.
    3. Barbara De Rosa & Gennaro Improta & Gianpaolo Ghiani & Roberto Musmanno, 2002. "The Arc Routing and Scheduling Problem with Transshipment," Transportation Science, INFORMS, vol. 36(3), pages 301-313, August.
    4. Angel Corberán & Gustavo Mejía & José M. Sanchis, 2005. "New Results on the Mixed General Routing Problem," Operations Research, INFORMS, vol. 53(2), pages 363-376, April.
    5. Jesica Armas & Peter Keenan & Angel A. Juan & Seán McGarraghy, 2019. "Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 135-162, February.
    6. Chefi Triki, 2017. "Solving the Periodic Edge Routing Problem in the Municipal Waste Collection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(03), pages 1-13, June.
    7. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    8. 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.
    9. Yuhui Sun & Wei Yu & Zhaohui Liu, 2023. "Approximation algorithms for some min–max and minimum stacker crane cover problems," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-25, January.
    10. Li, Jiliu & Qin, Hu & Shen, Huaxiao & Tsui, Kwok Leung, 2019. "The unilateral transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 1-29.
    11. Muyldermans, L. & Cattrysse, D. & Van Oudheusden, D. & Lotan, T., 2002. "Districting for salt spreading operations," European Journal of Operational Research, Elsevier, vol. 139(3), pages 521-532, June.
    12. Gilbert Laporte & Roberto Musmanno & Francesca Vocaturo, 2010. "An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 44(1), pages 125-135, February.
    13. Letchford, Adam N., 1999. "The general routing polyhedron: A unifying framework," European Journal of Operational Research, Elsevier, vol. 112(1), pages 122-133, January.
    14. Tagmouti, Mariam & Gendreau, Michel & Potvin, Jean-Yves, 2007. "Arc routing problems with time-dependent service costs," European Journal of Operational Research, Elsevier, vol. 181(1), pages 30-39, August.
    15. Beullens, Patrick & Muyldermans, Luc & Cattrysse, Dirk & Van Oudheusden, Dirk, 2003. "A guided local search heuristic for the capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 147(3), pages 629-643, June.
    16. Letchford, Adam N., 1997. "New inequalities for the General Routing Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 317-322, January.
    17. Letchford, A.N. & Eglese, R.W., 1998. "The rural postman problem with deadline classes," European Journal of Operational Research, Elsevier, vol. 105(3), pages 390-400, March.
    18. Corberan, A. & Sanchis, J. M., 1998. "The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra," European Journal of Operational Research, Elsevier, vol. 108(3), pages 538-550, August.
    19. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    20. John Sniezek & Lawrence Bodin, 2006. "Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles," Annals of Operations Research, Springer, vol. 144(1), pages 33-58, April.

    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:122:y:2000:i:1:p:11-17. 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.