IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i3p671-688.html
   My bibliography  Save this article

Formulations and solution algorithms for dynamic assembly routing problem

Author

Listed:
  • H. Murat Afsar
  • Faicel Hnaien

Abstract

We study a dynamic version of the assembly routing problem. The assembly lot sizing section deals with decisions concerning the production phase, whereas the routing section organises the collection of raw materials necessary for the production. Traditionally, these two problems are treated separately, and more specifically, in a hierarchical way. We propose three linear programming models: a non-vehicle index model, a two-commodity flow formulation and a logic-based benders decomposition. We develop aggregated rounded capacity constraints for non-vehicle index model and separated them dynamically during the Branch & Cut procedure. Logic-based benders decomposition algorithm solves the Dynamic Assembly Routing Problem iteratively and obtains a feasible solution at each iteration. The numerical tests show that, the two first models are particularly effective at finding the optimal solutions in a reasonable amount of time on instances with up to 50 components and 3 periods.

Suggested Citation

  • H. Murat Afsar & Faicel Hnaien, 2020. "Formulations and solution algorithms for dynamic assembly routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 58(3), pages 671-688, February.
    • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:3:p:671-688
    DOI: 10.1080/00207543.2019.1588481
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1588481
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2019.1588481?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:tprsxx:v:58:y:2020:i:3:p:671-688. 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/TPRS20 .

    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.