A new simulated annealing algorithm for the Freight Consolidation Problem
From MaRDI portal
Recommendations
- A simulated annealing approach to the railroad freight transportation design problem
- Solving a Freight Transport Problem Using Facility Location Techniques
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- A MIP model for freight consolidation in road transportation considering outsourced fleet
- Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
Cites work
- Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen Güterfernverkehr. (Concepts of genetic algorithms and their application to the freight optimization problem of distant commercial goods transportation)
- Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
Cited in
(6)- A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
- A MIP model for freight consolidation in road transportation considering outsourced fleet
- Modeling and optimization of pickup and delivery problem using constraint logic programming
- scientific article; zbMATH DE number 1488895 (Why is no real title available?)
- Greedy algorithms for the freight consolidation problem
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
This page was built for publication: A new simulated annealing algorithm for the Freight Consolidation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176320)