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

New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

Author

Listed:
  • A. Felipe

    ()

  • M. Ortuño

    ()

  • G. Tirado

    ()

Abstract

No abstract is available for this item.

Suggested Citation

  • A. Felipe & M. Ortuño & G. Tirado, 2009. "New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(1), pages 190-213, July.
  • Handle: RePEc:spr:topjnl:v:17:y:2009:i:1:p:190-213
    DOI: 10.1007/s11750-009-0080-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-009-0080-9
    Download Restriction: Access to full text is restricted to subscribers.

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Felipe, Angel & Teresa Ortuño, M. & Tirado, Gregorio, 2011. "Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints," European Journal of Operational Research, Elsevier, vol. 211(1), pages 66-75, May.
    2. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    3. Cheang, Brenda & Gao, Xiang & Lim, Andrew & Qin, Hu & Zhu, Wenbin, 2012. "Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints," European Journal of Operational Research, Elsevier, vol. 223(1), pages 60-75.
    4. Flavia Bonomo & Sara Mattia & Gianpaolo Oriolo, 2010. "Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem," DIS Technical Reports 2010-06, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    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:17:y:2009:i:1:p:190-213. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.