Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Performance Analysis of Heuristic Algorithms for Consolidated Transportation with Weight and Volume Constraints

무게와 부피를 고려하는 경험적 공동수송 흔적 알고리듬의 성능분석

  • Rim, Suk-Chul (Department of Industrial and Information Systems Engineering, Ajou University) ;
  • Yoo, Youngjin (Department of Industrial and Information Systems Engineering, Ajou University)
  • 임석철 (아주대학교 산업정보시스템공학부) ;
  • 유영진 (아주대학교 산업정보시스템공학부)
  • Published : 2002.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

When transporting multiple items by trucks of various size, one needs to assign a group of items to each truck so as to minimize the total cost, while meeting the weight and volume constraint of each truck. In this paper, we formulate the problem as an integer programming problem and propose four heuristic algorithms for the problem. Computer simulation is used to evaluate the average performance of the four heuristic algorithms for the consolidated transportation problem.

Keywords

References

  1. Bischoff, E. E. and Marroitt, M. D. (1990), A comparative evaluation of heuristics for container loading, European Journal of Operational Research, 44(2), 267-276 https://doi.org/10.1016/0377-2217(90)90362-F
  2. Caprara, A. and Toth, P. (2001), Lower bounds and algorithms for the 2-dimensional vector packing problem, Discrete Applied Mathematics, 111, 231-262
  3. Cooper, M. (1983), Freight Consolidation and Warehouse Location Strategies in Physical Distribution System, Journal of Business Logistics, 4(2), 53-74
  4. Hall, R. W. (1987), Consolidation Strategy: Inventory, Vehicles and Terminals, Journal of Business Logistics, 8(2), 57-73
  5. Jackson, G. C. (1985),A Survey of Freight Consolidation Practices, Journal of Business Logistics, 6(1), 13-34
  6. Martello, S., Pisinger, D. and Vigo, D. (2000), The three-dimensional bin packing problem, Operations Research, 48, 256-267
  7. Martello, S. and Toth, P. (1990), Knapsack Problems, Algorithms and Computer Implementations, John Wiley & Sons, West Sussex, England
  8. Min, H. (1996), Consolidation Terminal Location-Allocation and Consolidated Routing Problems, Journal of Business Logistics, 17(2),235-263
  9. Mohanty, B. B., Mathur, K. and Ivancic, N. J. (1994), Value considerations in three-dimensional packing-A heuristic procedure using the fractional knapsack problem, European Journal of Operational Research, 74,143-151
  10. Pooley, J. (1992), A Vehicle Routing Algorithm for the Less-Than-Truckload vs. Multiple-Stop Truckload Problem, Journal of Business Logistics, 13(1), 153-175
  11. Pooley, J. and Stenger, A. J. (1992), Modeling and Evaluating Shipment Consolidation in A Logistics System, Journal of Business Logistics, 13(2), 153-175
  12. Rim, S. C., Kim, S. B. and Kim, N. H. (2001), Modeling and Analysis of Consolidated Transportation Between Industrial Complexes, Journal of the Korean Institute of Industrial Engineers, 27(2),150-157
  13. Rim, S. C. and Yoo, Y. J. (2001), Impact of Flexible Shipping Date in Consolidated Transportation for Industrial Complexes, Proc. of the Conference on the Korean Institute of Industrial Engineers, 699-702
  14. Scholl, A., Klein, R. and Jurgens, C. (1997), BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Computers operations Research, 24(7), 627-645 https://doi.org/10.1016/S0305-0548(96)00082-2
  15. Sheffi, Y. (1986), Carrier/Shipper Interactions in the Transportation Market: An Analytic Framework, Journal of Business Logistics, 7(1), 1-27
  16. Toth, P. (2000), Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, European Journal of Operational Research, 125, 222-238 https://doi.org/10.1016/S0377-2217(99)00453-1