메뉴 건너뛰기




Volumn 38, Issue 3, 2011, Pages 617-640

A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem

Author keywords

2L CVRP; Evolutionary local search; GRASP; Iterated local search; Vehicle routing; VRP

Indexed keywords

2L-CVRP; GRASP; ITERATED LOCAL SEARCH; LOCAL SEARCH; VRP;

EID: 77957321273     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.08.017     Document Type: Article
Times cited : (94)

References (41)
  • 2
    • 0027544944 scopus 로고
    • Multiobjective transportation network design and routing problems: Taxonomy and annotation
    • J.R. Current, and M. Marsh Multiobjective transportation network design and routing problems: taxonomy and annotation European Journal of Operational Research 65 1993 4 19
    • (1993) European Journal of Operational Research , vol.65 , pp. 4-19
    • Current, J.R.1    Marsh, M.2
  • 5
    • 70449522378 scopus 로고    scopus 로고
    • Two Memetic algorithms for heterogeneous fleet vehicle routing problems
    • C. Prins Two Memetic algorithms for heterogeneous fleet vehicle routing problems Engineering Applications of Artificial Intelligence 22 2009 916 928
    • (2009) Engineering Applications of Artificial Intelligence , vol.22 , pp. 916-928
    • Prins, C.1
  • 7
    • 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 1 2008 4 18
    • (2008) Networks , vol.51 , Issue.1 , pp. 4-18
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 8
    • 56349108222 scopus 로고    scopus 로고
    • A guided Tabu search for the vehicle routing problem with two dimensional loading constraints
    • E.E. Zachariadis, C.D. Tarantilis, and C. Kiranoudis A guided Tabu search for the vehicle routing problem with two dimensional loading constraints European Journal of Operational Research 3 16 2009 729 743
    • (2009) European Journal of Operational Research , vol.3 , Issue.16 , pp. 729-743
    • Zachariadis, E.E.1    Tarantilis, C.D.2    Kiranoudis, C.3
  • 9
    • 53749107567 scopus 로고    scopus 로고
    • Ant colony optimization for the two-dimensional loading vehicle routing problem
    • G. Fuellerer, K.F. Doerner, R.F. Hartl, and M. Iori Ant colony optimization for the two-dimensional loading vehicle routing problem Computers and Operations Research 36 3 2009 655 673
    • (2009) Computers and Operations Research , vol.36 , Issue.3 , pp. 655-673
    • Fuellerer, G.1    Doerner, K.F.2    Hartl, R.F.3    Iori, M.4
  • 10
    • 53749087809 scopus 로고    scopus 로고
    • An exact approach for capacitated vehicle routing problems with two-dimensional loading constraints
    • M. Iori, J.J. Salazar Gonzlez, and D. Vigo An exact approach for capacitated vehicle routing problems with two-dimensional loading constraints Transportation Science 41 2 2007 253 264
    • (2007) Transportation Science , vol.41 , Issue.2 , pp. 253-264
    • Iori, M.1    Salazar Gonzlez, J.J.2    Vigo, D.3
  • 12
    • 0032023068 scopus 로고
    • Exact solution of the two-dimensional finite bin packing problem
    • S. Martello, and D. Vigo Exact solution of the two-dimensional finite bin packing problem Management Science 44 1988 388 399
    • (1988) Management Science , vol.44 , pp. 388-399
    • Martello, S.1    Vigo, D.2
  • 13
    • 84947944462 scopus 로고    scopus 로고
    • Sweep as a generic pruning technique applied to the non-overlapping rectangles constraints. Principles and practice of Constraint Programming (CP'2001)
    • N. Beldiceanu, and M. Carlsson Sweep as a generic pruning technique applied to the non-overlapping rectangles constraints. Principles and practice of Constraint Programming (CP'2001) Lecture Notes in Computer Science 2239 2001 377 391
    • (2001) Lecture Notes in Computer Science , vol.2239 , pp. 377-391
    • Beldiceanu, N.1    Carlsson, M.2
  • 14
    • 35048896644 scopus 로고    scopus 로고
    • On using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem
    • Department of Computer Science, University of Copenhagen
    • Pisinger D, Sigurd M. On using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. Technical Report, Department of Computer Science, University of Copenhagen, 2003.
    • (2003) Technical Report
    • Pisinger, D.1    Sigurd, M.2
  • 15
    • 38549109642 scopus 로고    scopus 로고
    • An exact algorithm for higher-dimensional orthogonal packing
    • S. Fekete, J. Schepers, and J. van der Veen An exact algorithm for higher-dimensional orthogonal packing Operations Research 55 3 2006 569 587
    • (2006) Operations Research , vol.55 , Issue.3 , pp. 569-587
    • Fekete, S.1    Schepers, J.2    Van Der Veen, J.3
  • 16
    • 4043106962 scopus 로고    scopus 로고
    • A combinatorial characterization of higher-dimensional orthogonal packing
    • S. Fekete, and J. Schepers A combinatorial characterization of higher-dimensional orthogonal packing Mathematics of Operations Research 29 2004 353 368
    • (2004) Mathematics of Operations Research , vol.29 , pp. 353-368
    • Fekete, S.1    Schepers, J.2
  • 17
    • 0037448817 scopus 로고    scopus 로고
    • Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
    • T.W. Leung, C.K. Chan, and M.D. Troutt Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem European Journal of Operational Research 145 3 2003 530 542
    • (2003) European Journal of Operational Research , vol.145 , Issue.3 , pp. 530-542
    • Leung, T.W.1    Chan, C.K.2    Troutt, M.D.3
  • 18
    • 34447106676 scopus 로고    scopus 로고
    • A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
    • J.F. Gonalves A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem European Journal of Operational Research 183 3 2007 1212 1229
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1212-1229
    • Gonalves, J.F.1
  • 19
    • 0032599517 scopus 로고    scopus 로고
    • A genetic algorithm for a 2D industrial packing problem
    • E. Hopper, and B. Turton A genetic algorithm for a 2D industrial packing problem Computers & Industrial Engineering 37 12 1999 375 378
    • (1999) Computers & Industrial Engineering , vol.37 , Issue.12 , pp. 375-378
    • Hopper, E.1    Turton, B.2
  • 23
    • 0000801563 scopus 로고    scopus 로고
    • An integrated survey of deterministic project scheduling
    • R. Kolisch, and R. Padman An integrated survey of deterministic project scheduling Omega 29 2001 249 272
    • (2001) Omega , vol.29 , pp. 249-272
    • Kolisch, R.1    Padman, R.2
  • 26
    • 0038522575 scopus 로고    scopus 로고
    • Insertion techniques for static and dynamic resource-constrained project scheduling
    • C. Artigues, P. Michelon, and S. Reusser Insertion techniques for static and dynamic resource-constrained project scheduling European Journal of Operational Research 149 2003 249 267
    • (2003) European Journal of Operational Research , vol.149 , pp. 249-267
    • Artigues, C.1    Michelon, P.2    Reusser, S.3
  • 27
    • 33748439560 scopus 로고    scopus 로고
    • A hybrid metaheuristic for the resource-constrained project scheduling problem
    • L.Y. Tseng, and S.C. Chen A hybrid metaheuristic for the resource-constrained project scheduling problem European Journal of Operational Research 175 2006 707 721
    • (2006) European Journal of Operational Research , vol.175 , pp. 707-721
    • Tseng, L.Y.1    Chen, S.C.2
  • 28
    • 23044518893 scopus 로고    scopus 로고
    • Packing problems and project scheduling models: An integrating perspective
    • S. Hartmann Packing problems and project scheduling models: an integrating perspective Journal of the Operational Research Society 51 2000 1083 1092
    • (2000) Journal of the Operational Research Society , vol.51 , pp. 1083-1092
    • Hartmann, S.1
  • 32
    • 4444280768 scopus 로고    scopus 로고
    • Competitive memetic algorithms for arc routing problems
    • DOI 10.1023/B:ANOR.0000039517.35989.6d, Meta-Heuristics - Theory, Applications and Software
    • P. Lacomme, C. Prins, and W. Ramdane-Chrif Competitive Memetic algorithms for arc routing problems Annals of Operations Research 131 2004 159 185 (Pubitemid 39187378)
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 159-185
    • Lacomme, P.1    Prins, C.2    Ramdane-Cherif, W.3
  • 33
    • 2642522782 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for the vehicle routing problem
    • C. Prins A simple and effective evolutionary algorithm for the vehicle routing problem Computers and Operations Research 31 2004 1985 2002
    • (2004) Computers and Operations Research , vol.31 , pp. 1985-2002
    • Prins, C.1
  • 35
    • 79953049588 scopus 로고    scopus 로고
    • A memetic approach for the capacitated location routing problem
    • Troyes, France, October 23-24
    • Duhamel C, Lacomme P, Prins C, Prodhon C. A memetic approach for the capacitated location routing problem. EU-MEeting 2008, Troyes, France, October 2324, 2008.
    • (2008) EU-MEeting 2008
    • Duhamel, C.1    Lacomme, P.2    Prins, C.3    Prodhon, C.4
  • 36
    • 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
  • 37
    • 0020543990 scopus 로고
    • Computational experiments with algorithms for a class of routing problems
    • B.L. Golden, J.S. DeArmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Computers and Operations Research 10 1 1983 47 59
    • (1983) Computers and Operations Research , vol.10 , Issue.1 , pp. 47-59
    • Golden, B.L.1    Dearmon, J.S.2    Baker, E.K.3
  • 38
    • 33845270624 scopus 로고    scopus 로고
    • Experimental investigation of heuristics for resource-constrained project scheduling: An update
    • R. Kolisch Experimental investigation of heuristics for resource-constrained project scheduling: an update European Journal of Operational Research 174 2006 23 37
    • (2006) European Journal of Operational Research , vol.174 , pp. 23-37
    • Kolisch, R.1
  • 39
    • 0021034477 scopus 로고
    • Route-first cluster-second methods for vehicle routing
    • J.E. Beasley Route-first cluster-second methods for vehicle routing Omega 11 1983 403 408
    • (1983) Omega , vol.11 , pp. 403-408
    • Beasley, J.E.1


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