A new simulated annealing algorithm for the freight consolidation problem
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.
KeywordsSimulated Annealing Algorithm Insertion Cost Pickup Location Customer Node Swap Operator
Unable to display preview. Download preview PDF.
- 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.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.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