IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-29210-1_48.html
   My bibliography  Save this book chapter

A new simulated annealing algorithm for the freight consolidation problem

In: Operations Research Proceedings 2011

Author

Listed:
  • Erk Struwe

    (University of Bremen, Chair of Logistics)

  • Xin Wang

    (University of Bremen, Chair of Logistics)

  • Christopher Sander
  • Herbert Kopfer

Abstract

Logistics services are one of the most outsourced activities today. Freight charges for the outsourced transportation requests are mostly calculated based on tariff agreements depending on their quantities and distances. Due to economies of scale, it is beneficial for the outsourcing company to consolidate their requests, which is called the Freight Consolidation Problem (FCP). In this paper, the FCP is formally defined and modeled. To solve large-scale instances, a simulated annealing algorithm is proposed and tested on newly generated instances. Results show that the algorithm can provide good solutions within acceptable computational times.

Suggested Citation

  • Erk Struwe & Xin Wang & Christopher Sander & Herbert Kopfer, 2012. "A new simulated annealing algorithm for the freight consolidation problem," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 299-304, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-29210-1_48
    DOI: 10.1007/978-3-642-29210-1_48
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-642-29210-1_48. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.