메뉴 건너뛰기




Volumn 39, Issue 9, 2012, Pages 2178-2195

A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP

Author keywords

3D packing; Deepest Bottom Left Fill; Maximum Touching Area; Tabu search; Vehicle routing problem

Indexed keywords

3D PACKING; BENCHMARK DATA; CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL EXPERIMENT; DEEPEST-BOTTOM-LEFT-FILL; EFFICIENT IMPLEMENTATION; MAXIMUM TOUCHING AREA; TABU SEARCH ALGORITHMS; TEST INSTANCES; THREE-DIMENSIONAL SHAPE; TRANSPORTATION INDUSTRY; TWO STAGE; VEHICLE ROUTING PROBLEM;

EID: 84855554578     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.11.001     Document Type: Article
Times cited : (60)

References (29)
  • 1
  • 2
    • 0035341621 scopus 로고    scopus 로고
    • Hybrid genetic algorithm for the container loading problem
    • DOI 10.1016/S0377-2217(00)00055-2
    • A. Bortfeldt, and H. Gehring A hybrid genetic algorithm for the container loading problem European Journal of Operational Research 131 2001 143 161 (Pubitemid 32264922)
    • (2001) European Journal of Operational Research , vol.131 , Issue.1 , pp. 143-161
    • Bortfeldt, A.1    Gehring, H.2
  • 3
    • 34447264991 scopus 로고    scopus 로고
    • A heuristic for the three-dimensional strip packing problem
    • DOI 10.1016/j.ejor.2005.07.031, PII S0377221706003031
    • A. Bortfeldt, and D. MacK A heuristic for the three-dimensional strip packing problem European Journal of Operational Research 183 2007 1267 1279 (Pubitemid 47039189)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1267-1279
    • Bortfeldt, A.1    Mack, D.2
  • 4
    • 0020797485 scopus 로고
    • Bottom-left bin-packing heuristic: An efficient implementation
    • B. Chazelle The Bottom-left bin-packing heuristic: an efficient implementation IEEE Transactions on Computers C-32 1983 697 707 (Pubitemid 14472726)
    • (1983) IEEE Transactions on Computers , vol.C-32 , Issue.8 , pp. 697-707
    • Chazelle Bernard1
  • 5
    • 0032183875 scopus 로고    scopus 로고
    • A recursive computational procedure for container loading
    • C.F. Chien, and W.T. Wu A recursive computational procedure for container loading Computers & Industrial Engineering 35 1998 319 322
    • (1998) Computers & Industrial Engineering , vol.35 , pp. 319-322
    • Chien, C.F.1    Wu, W.T.2
  • 6
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
    • (1964) Operations Research , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 9
    • 0036722385 scopus 로고    scopus 로고
    • Solving container loading problems by block arrangement
    • DOI 10.1016/S0377-2217(02)00133-9, PII S0377221702001339
    • M. Eley Solving container loading problems by block arrangement European Journal of Operational Research 141 2002 393 409 (Pubitemid 34623945)
    • (2002) European Journal of Operational Research , vol.141 , Issue.2 , pp. 393-409
    • Eley, M.1
  • 10
    • 77952017448 scopus 로고    scopus 로고
    • A tree search algorithm for solving the container loading problem
    • T. Fanslau, and A. Bortfeldt A tree search algorithm for solving the container loading problem INFORMS Journal on Computing 22 2010 222 235
    • (2010) INFORMS Journal on Computing , vol.22 , pp. 222-235
    • Fanslau, T.1    Bortfeldt, A.2
  • 11
    • 38549109642 scopus 로고    scopus 로고
    • An exact algorithm for higher-dimensional orthogonal packing
    • DOI 10.1287/opre.1060.0369
    • S.P. Fekete, J. Schepers, and J.C. van der Veen An exact algorithm for higher-dimensional orthogonal packing Operations Research 55 2007 569 587 (Pubitemid 351159510)
    • (2007) Operations Research , vol.55 , Issue.3 , pp. 569-587
    • Fekete, S.P.1    Schepers, J.2    Van Der Veen, J.C.3
  • 13
    • 33746588314 scopus 로고    scopus 로고
    • A tabu search algorithm for a routing and container loading problem
    • DOI 10.1287/trsc.1050.0145
    • M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search algorithm for a routing and container loading problem Transportation Science 40 2006 342 350 (Pubitemid 44147355)
    • (2006) Transportation Science , vol.40 , Issue.3 , pp. 342-350
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 14
    • 38149064537 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
    • M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints Networks 51 2008 4 18
    • (2008) Networks , vol.51 , pp. 4-18
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 17
    • 53749087809 scopus 로고    scopus 로고
    • An exact approach for the vehicle routing problem with two-dimensional loading constraints
    • M. Iori, J.-J. Salazar-González, and D. Vigo An exact approach for the vehicle routing problem with two-dimensional loading constraints Transportation Science 41 2007 253 264
    • (2007) Transportation Science , vol.41 , pp. 253-264
    • Iori, M.1    Salazar-González, J.-J.2    Vigo, D.3
  • 18
    • 15544372540 scopus 로고    scopus 로고
    • 3-D container packing heuristics
    • DOI 10.1007/s10489-005-5601-0
    • A. Lim, B. Rodrigues, and Y. Yang 3-D container packing heuristics Applied Intelligence 22 2005 125 134 (Pubitemid 40400729)
    • (2005) Applied Intelligence , vol.22 , Issue.2 , pp. 125-134
    • Lim, A.1    Rodrigues, B.2    Yang, Y.3
  • 20
    • 0036722395 scopus 로고    scopus 로고
    • An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
    • DOI 10.1016/S0377-2217(02)00135-2, PII S0377221702001352
    • L. Lins, S. Lins, and R. Morabito An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container European Journal of Operational Research 141 2002 421 439 (Pubitemid 34623947)
    • (2002) European Journal of Operational Research , vol.141 , Issue.2 , pp. 421-439
    • Lins, L.1    Lins, S.2    Morabito, R.3
  • 24
    • 77349100608 scopus 로고    scopus 로고
    • An integrated approach to the vehicle routing and container loading problems
    • A. Moura, and J.F. Oliveira An integrated approach to the vehicle routing and container loading problems OR Spectrum 31 2009 775 800
    • (2009) OR Spectrum , vol.31 , pp. 775-800
    • Moura, A.1    Oliveira, J.F.2
  • 26
    • 0036722393 scopus 로고    scopus 로고
    • Heuristics for the container loading problem
    • DOI 10.1016/S0377-2217(02)00132-7, PII S0377221702001327
    • D. Pisinger Heuristics for the container loading problem European Journal of Operational Research 141 2002 382 392 (Pubitemid 34623944)
    • (2002) European Journal of Operational Research , vol.141 , Issue.2 , pp. 382-392
    • Pisinger, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.