메뉴 건너뛰기




Volumn 201, Issue 3, 2010, Pages 751-759

Metaheuristics for vehicle routing problems with three-dimensional loading constraints

Author keywords

Ant Colony Optimization; Three dimensional packing; Vehicle routing

Indexed keywords

ANT COLONY OPTIMIZATION; ANT COLONY OPTIMIZATION ALGORITHMS; CAPACITATED VEHICLE ROUTING PROBLEM; COMBINATORIAL COMPLEXITY; FREIGHT DISTRIBUTION; HEURISTIC INFORMATION; LOADING CONSTRAINTS; META HEURISTICS; NUMERICAL TESTS; ROAD NETWORK; TEST INSTANCES; THREE-DIMENSIONAL PACKING; VEHICLE ROUTING PROBLEMS;

EID: 70349464713     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.03.046     Document Type: Article
Times cited : (146)

References (32)
  • 4
    • 84989235027 scopus 로고    scopus 로고
    • Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading
    • Carrabs F., Cordeau J.-F., and Laporte G. Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing 19 (2007) 618-632
    • (2007) INFORMS Journal on Computing , vol.19 , pp. 618-632
    • Carrabs, F.1    Cordeau, J.-F.2    Laporte, G.3
  • 5
    • 0002893433 scopus 로고
    • An algorithm for two-dimensional cutting problems
    • Christofides N., and Whitlock C. An algorithm for two-dimensional cutting problems. Operations Research 25 (1977) 30-44
    • (1977) Operations Research , vol.25 , pp. 30-44
    • Christofides, N.1    Whitlock, C.2
  • 6
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G., and Wright J.V. 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.V.2
  • 8
    • 73849105288 scopus 로고    scopus 로고
    • Branch-and-cut for the pickup and delivery traveling salesman problem with LIFO loading
    • in press
    • J.-F. Cordeau, M. Iori, G. Laporte, J.J. Salazar-González, Branch-and-cut for the pickup and delivery traveling salesman problem with LIFO loading, Networks (in press).
    • Networks
    • Cordeau, J.-F.1    Iori, M.2    Laporte, G.3    Salazar-González, J.J.4
  • 10
    • 71949092423 scopus 로고    scopus 로고
    • Vehicle routing
    • Handbooks in Operations Research and Management Science
    • J.F. Cordeau, G. Laporte, M.W.P. Savelsbergh, D. Vigo, Vehicle routing, in: Transportation, Handbooks in Operations Research and Management Science, vol. 14, 2007, pp. 367-417.
    • (2007) Transportation , vol.14 , pp. 367-417
    • Cordeau, J.F.1    Laporte, G.2    Savelsbergh, M.W.P.3    Vigo, D.4
  • 11
    • 61349094010 scopus 로고    scopus 로고
    • Extreme point-based heuristics for the three-dimensional bin packing
    • Crainic T.G., Perboli G., and Tadei R. Extreme point-based heuristics for the three-dimensional bin packing. INFORMS Journal on Computing 20 (2008) 368-384
    • (2008) INFORMS Journal on Computing , vol.20 , pp. 368-384
    • Crainic, T.G.1    Perboli, G.2    Tadei, R.3
  • 14
    • 34548276401 scopus 로고    scopus 로고
    • Metaheuristics for vehicle routing problems with loading constraints
    • Doerner K.F., Fuellerer G., Gronalt M., Hartl R., and Iori M. Metaheuristics for vehicle routing problems with loading constraints. Networks 49 4 (2007) 294-307
    • (2007) Networks , vol.49 , Issue.4 , pp. 294-307
    • Doerner, K.F.1    Fuellerer, G.2    Gronalt, M.3    Hartl, R.4    Iori, M.5
  • 15
    • 0036722385 scopus 로고    scopus 로고
    • Solving container loading problems by block arrangement
    • Eley M. Solving container loading problems by block arrangement. European Journal of Operational Research 141 (2002) 393-409
    • (2002) European Journal of Operational Research , vol.141 , pp. 393-409
    • Eley, M.1
  • 16
    • 3843072027 scopus 로고    scopus 로고
    • Guided local search for the three-dimensional bin packing problem
    • Faroe O., Pisinger D., and Zachariasen M. Guided local search for the three-dimensional bin packing problem. INFORMS Journal on Computing 15 (2003) 267-283
    • (2003) INFORMS Journal on Computing , vol.15 , pp. 267-283
    • Faroe, O.1    Pisinger, D.2    Zachariasen, M.3
  • 17
    • 70349467112 scopus 로고    scopus 로고
    • G. Fuellerer, K.F. Doerner, R.F. Hartl, M. Iori, Ant colony optimization for the two-dimensional loading vehicle routing problem: Detailed results, Technical Report, POM, University of Vienna, 2007, .
    • G. Fuellerer, K.F. Doerner, R.F. Hartl, M. Iori, Ant colony optimization for the two-dimensional loading vehicle routing problem: Detailed results, Technical Report, POM, University of Vienna, 2007, .
  • 18
    • 53749107567 scopus 로고    scopus 로고
    • Ant colony optimization for the two-dimensional loading vehicle routing problem
    • Fuellerer M., Doerner K.F., Hartl R., and Iori M. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research 36 (2009) 655-673
    • (2009) Computers & Operations Research , vol.36 , pp. 655-673
    • Fuellerer, M.1    Doerner, K.F.2    Hartl, R.3    Iori, M.4
  • 19
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
    • (1994) Management Science , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 20
    • 33746588314 scopus 로고    scopus 로고
    • A tabu search algorithm for a routing and container loading problem
    • Gendreau M., Iori M., Laporte G., and Martello S. A tabu search algorithm for a routing and container loading problem. Transportation Science 40 (2006) 342-350
    • (2006) Transportation Science , vol.40 , pp. 342-350
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 21
    • 38149064537 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
    • Gendreau M., Iori M., Laporte G., and Martello S. 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
  • 22
    • 70349457098 scopus 로고    scopus 로고
    • An exact approach for the vehicle routing problem with two-dimensional loading constraints
    • Iori M., Salazar-González J.J., and Vigo D. An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 40 (2006) 342-350
    • (2006) Transportation Science , vol.40 , pp. 342-350
    • Iori, M.1    Salazar-González, J.J.2    Vigo, D.3
  • 23
    • 85191116165 scopus 로고    scopus 로고
    • Vehicle routing: Handling edges exchanges windows
    • Aarts E., and Lenstra J.K. (Eds), John Wiley & Sons Ltd., Chichester
    • Kindervater G.A.P., and Savelsbergh M.W.P. Vehicle routing: Handling edges exchanges windows. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), John Wiley & Sons Ltd., Chichester 337-360
    • (1997) Local Search in Combinatorial Optimization , pp. 337-360
    • Kindervater, G.A.P.1    Savelsbergh, M.W.P.2
  • 24
    • 0001595376 scopus 로고    scopus 로고
    • Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
    • Lodi A., Martello S., and Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11 (1999) 345-357
    • (1999) INFORMS Journal on Computing , vol.11 , pp. 345-357
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 25
  • 26
    • 33947711857 scopus 로고    scopus 로고
    • Algorithm 864: Algorithms for general and robot-packable variants of the three-dimensional bin packing problem
    • March, Article 7, 12p
    • S. Martello, D. Pisinger, D. Vigo, E. den Boef, J. Korst, Algorithm 864: Algorithms for general and robot-packable variants of the three-dimensional bin packing problem, ACM Transactions on Mathematical Software 33 (1) 7, March 2007, Article 7, 12p.
    • (2007) ACM Transactions on Mathematical Software , vol.33 , Issue.1 , pp. 7
    • Martello, S.1    Pisinger, D.2    Vigo, D.3    den Boef, E.4    Korst, J.5
  • 27
    • 62549093551 scopus 로고    scopus 로고
    • The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches
    • Petersen H.L., and Madsen O.B.G. The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches. European Journal of Operational Research 198 (2009) 139-147
    • (2009) European Journal of Operational Research , vol.198 , pp. 139-147
    • Petersen, H.L.1    Madsen, O.B.G.2
  • 29
    • 0346009088 scopus 로고    scopus 로고
    • D-ants: Savings based ants divide and conquer the vehicle routing problem
    • Reimann M., Doerner K.F., and Hartl R.F. D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31 4 (2004) 563-591
    • (2004) Computers & Operations Research , vol.31 , Issue.4 , pp. 563-591
    • Reimann, M.1    Doerner, K.F.2    Hartl, R.F.3


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