IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i4p555-567.html
   My bibliography  Save this article

Two heuristics for the capacitated minimum spanning tree problem with time windows

Author

Listed:
  • Manolis N. Kritikos
  • George Ioannou

Abstract

We consider the capacitated minimum spanning tree problem with time windows (CMSTPTW) and propose an enhancement of greedy heuristic for the uncapacitated version of it, showing that our algorithm significantly outperforms Solomon’s one based on the R7 test problem. To examine the performance of our approach, we convert the vehicle routing data sets to appropriately model CMSTPTW instances and provide solutions for all of them; in addition, we compare the solutions we reach for the uncapacitated version of all instances and those obtained by Solomon to demonstrate the consistent superiority of the proposed method. Finally, we develop a second solution approach, the local domain priority heuristic, which when applied to the same data sets results in better solutions for the majority of the CMSTPTW instances, without excessive computational effort.

Suggested Citation

  • Manolis N. Kritikos & George Ioannou, 2019. "Two heuristics for the capacitated minimum spanning tree problem with time windows," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(4), pages 555-567, April.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:4:p:555-567
    DOI: 10.1080/01605682.2018.1447255
    as

    Download full text from publisher

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

    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:taf:tjorxx:v:70:y:2019:i:4:p:555-567. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.