Advertisement

A new simulated annealing algorithm for the freight consolidation problem

  • Erk Struwe
  • Xin Wang
  • Christopher Sander
  • Herbert Kopfer
Conference paper
Part of the Operations Research Proceedings book series (ORP)

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.

Keywords

Simulated Annealing Algorithm Insertion Cost Pickup Location Customer Node Swap Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kopfer, H.: Der Entwurf und die Realisierung eines A-Verfahrens zur LÖsung des Frachtoptimierungsproblems. OR Spektrum 12/4, 207–218 (1990)Google Scholar
  2. 2.
    Kopfer, H.: Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen G¨uterverkehr. OR Spektrum 14/3, 137–147 (1992)Google Scholar
  3. 3.
    Kopfer, H., Wang, X.: Combining Vehicle Routing with Forwarding — Extension of the Vehicle Routing Problem by Different Types of Sub-contraction. Journal of the Korean Institute of Industrial Engineers 35(1), 1–14 (2009)Google Scholar
  4. 4.
    Krajewska, M.A., Kopfer, H.: Transportation planning in freight forwarding companies — Tabu search algorithm for the integrated operational transportation planning problem. European Journal of Operational Research 197, 741–751 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Erk Struwe
    • 1
  • Xin Wang
    • 1
  • Christopher Sander
  • Herbert Kopfer
  1. 1.University of Bremen, Chair of LogisticsBremenGermany

Personalised recommendations