메뉴 건너뛰기




Volumn 171, Issue 3, 2006, Pages 750-775

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls

Author keywords

Large neighborhood search; Metaheuristics; Vehicle routing problems

Indexed keywords

CONSTRAINT THEORY; CUSTOMER SATISFACTION; DISTRIBUTION OF GOODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 31144472823     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.09.004     Document Type: Article
Times cited : (355)

References (47)
  • 2
    • 14844341132 scopus 로고    scopus 로고
    • The vehicle routing problem with time windows and simultaneous pick-up and delivery
    • A. Klose M.G. Speranza L.N. Van Wassenhove Springer-Verlag
    • E. Angelelli, and R. Mansini The vehicle routing problem with time windows and simultaneous pick-up and delivery A. Klose M.G. Speranza L.N. Van Wassenhove Quantitative Approaches to Distribution Logistics and Supply Chain Management 2002 Springer-Verlag 249 267
    • (2002) Quantitative Approaches to Distribution Logistics and Supply Chain Management , pp. 249-267
    • Angelelli, E.1    Mansini, R.2
  • 3
    • 0000204415 scopus 로고    scopus 로고
    • The vehicle-routing problem with delivery and back-haul options
    • S. Anily The vehicle-routing problem with delivery and back-haul options Naval Research Logistics 43 1996 415 434
    • (1996) Naval Research Logistics , vol.43 , pp. 415-434
    • Anily, S.1
  • 5
    • 0000539863 scopus 로고
    • Vehicle routing with backhauls: Models, algorithms and case studies
    • B. Golden A. Assad North-Holland Amsterdam
    • D.O. Casco, B.L. Golden, and E.A. Wasil Vehicle routing with backhauls: Models, algorithms and case studies B. Golden A. Assad Vehicle Routing: Methods and Studies 1988 North-Holland Amsterdam 127 147
    • (1988) Vehicle Routing: Methods and Studies , pp. 127-147
    • Casco, D.O.1    Golden, B.L.2    Wasil, E.A.3
  • 7
    • 45949095603 scopus 로고    scopus 로고
    • Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhauls
    • Porto, Portugal, July 16-20
    • J. Crispim, J. Brandao, Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with backhauls, in: MIC'2001 4th Metaheuristic International Conference, Porto, Portugal, July 16-20, 2001.
    • (2001) MIC'2001 4th Metaheuristic International Conference
    • Crispim, J.1    Brandao, J.2
  • 9
    • 85047696572 scopus 로고    scopus 로고
    • Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls
    • J. Dethloff Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls Journal of the Operational Research Society 53 2002 115 118
    • (2002) Journal of the Operational Research Society , vol.53 , pp. 115-118
    • Dethloff, J.1
  • 10
    • 0008936447 scopus 로고    scopus 로고
    • Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
    • J. Dethloff Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up OR Spektrum 23 2001 79 96
    • (2001) OR Spektrum , vol.23 , pp. 79-96
    • Dethloff, J.1
  • 12
    • 0031072439 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with back-hauls and time windows
    • C. Duhamel, J.-Y. Potvin, and J.-M. Rousseau A tabu search heuristic for the vehicle routing problem with back-hauls and time windows Transportation Science 31 1997 49 59
    • (1997) Transportation Science , vol.31 , pp. 49-59
    • Duhamel, C.1    Potvin, J.-Y.2    Rousseau, J.-M.3
  • 13
    • 21844484570 scopus 로고
    • A new branching strategy for time constrained routing problems with application to backhauling
    • S. Gelinas, M. Desrochers, J. Desrosiers, and M.M. Solomon A new branching strategy for time constrained routing problems with application to backhauling Annals of Operations Research 61 1995 91 109
    • (1995) Annals of Operations Research , vol.61 , pp. 91-109
    • Gelinas, S.1    Desrochers, M.2    Desrosiers, J.3    Solomon, M.M.4
  • 14
    • 0033166618 scopus 로고    scopus 로고
    • Heuristics for the traveling salesman problem with pickup and delivery
    • M. Gendreau, G. Laporte, and D. Vigo Heuristics for the traveling salesman problem with pickup and delivery Computers & Operations Research 26 1999 699 714
    • (1999) Computers & Operations Research , vol.26 , pp. 699-714
    • Gendreau, M.1    Laporte, G.2    Vigo, D.3
  • 15
    • 0037290973 scopus 로고    scopus 로고
    • A neural network algorithm for the traveling salesman problem with backhauls
    • H. Ghaziri, and I.H. Osman A neural network algorithm for the traveling salesman problem with backhauls Computers & Industrial Engineering 44 2003 267 281
    • (2003) Computers & Industrial Engineering , vol.44 , pp. 267-281
    • Ghaziri, H.1    Osman, I.H.2
  • 17
    • 31144471709 scopus 로고    scopus 로고
    • Models for pick-up and deliveries from depots with lasso solutions
    • Collaboration in logistics: Connecting Islands using Information Technology, Reykjavik, Iceland, 2001-06-14-2001-06-15, Chalmers University of Technology, Göteborg, Sweden
    • ∅. Halskau, I. Gribkovskaia, K.N.B. Myklebost, Models for pick-up and deliveries from depots with lasso solutions, in: Proceedings of the 13th Annual Conference on Logistics Research - NOFOMA 2001, Collaboration in logistics: Connecting Islands using Information Technology, Reykjavik, Iceland, 2001-06-14-2001-06-15, Chalmers University of Technology, Göteborg, Sweden, 2001, pp. 279-293.
    • (2001) Proceedings of the 13th Annual Conference on Logistics Research - NOFOMA 2001 , pp. 279-293
    • Halskau, Ø.1    Gribkovskaia, I.2    Myklebost, K.N.B.3
  • 19
    • 0009605365 scopus 로고
    • PhD thesis, Institute of Mathematical Statistics and Operations Research (IMSOR), Technical University of Denmark
    • K. Halse, Modeling and Solving Complex Vehicle Routing Problems, PhD thesis, Institute of Mathematical Statistics and Operations Research (IMSOR), Technical University of Denmark, 1992.
    • (1992) Modeling and Solving Complex Vehicle Routing Problems
    • Halse, K.1
  • 22
    • 0039113408 scopus 로고
    • The vehicle routing problem with backhauls: Properties and solution algorithms
    • Georgia Tech Research Corporation
    • C. Jacobs-Blecha, M. Goetschalckx, The vehicle routing problem with backhauls: Properties and solution algorithms, Technical Report, 1992-1998, Georgia Tech Research Corporation.
    • (1992) Technical Report
    • Jacobs-Blecha, C.1    Goetschalckx, M.2
  • 23
    • 0003047320 scopus 로고
    • A GRASP for the vehicle routing problem with time windows
    • G. Kontoravdis, and J.F. Bard A GRASP for the vehicle routing problem with time windows ORSA Journal on Computing 7 1995 10 23
    • (1995) ORSA Journal on Computing , vol.7 , pp. 10-23
    • Kontoravdis, G.1    Bard, J.F.2
  • 24
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • J.B. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society 7 1956 48 50
    • (1956) Proceedings of the American Mathematical Society , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 25
    • 0024838030 scopus 로고
    • The multiple vehicle routing problem with simultaneous delivery and pickup
    • H. Min The multiple vehicle routing problem with simultaneous delivery and pickup Transportation Research Part A 23 1989 377 386
    • (1989) Transportation Research Part A , vol.23 , pp. 377-386
    • Min, H.1
  • 26
    • 0033338780 scopus 로고    scopus 로고
    • An exact method for the vehicle routing problem with backhauls
    • A. Mingozzi, S. Giorgi, and R. Baldacci An exact method for the vehicle routing problem with backhauls Transportation Science 33 1999 315 329
    • (1999) Transportation Science , vol.33 , pp. 315-329
    • Mingozzi, A.1    Giorgi, S.2    Baldacci, R.3
  • 27
    • 8344236786 scopus 로고    scopus 로고
    • Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
    • in press
    • G. Nagy, S. Salhi, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, European Journal of Operational Research, in press.
    • European Journal of Operational Research
    • Nagy, G.1    Salhi, S.2
  • 28
    • 0001120381 scopus 로고    scopus 로고
    • A reactive tabu search meta-heuristic for the vehicle routing problem with backhauls
    • I.H. Osman, and N.A. Wassan A reactive tabu search meta-heuristic for the vehicle routing problem with backhauls Journal of Scheduling 5 2002 263 285
    • (2002) Journal of Scheduling , vol.5 , pp. 263-285
    • Osman, I.H.1    Wassan, N.A.2
  • 29
    • 0027591102 scopus 로고
    • A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
    • J.Y. Potvin, and J.-M. Rousseau A parallel route building algorithm for the vehicle routing and scheduling problem with time windows European Journal of Operational Research 66 1993 331 340
    • (1993) European Journal of Operational Research , vol.66 , pp. 331-340
    • Potvin, J.Y.1    Rousseau, J.-M.2
  • 30
    • 84974730882 scopus 로고    scopus 로고
    • Insertion based ants for vehicle routing problems with backhauls and time windows
    • M. Reimann, K. Doerner, and R.F. Hartl Insertion based ants for vehicle routing problems with backhauls and time windows LNCS 2463 2002 135 148
    • (2002) LNCS , vol.2463 , pp. 135-148
    • Reimann, M.1    Doerner, K.2    Hartl, R.F.3
  • 31
    • 33751004963 scopus 로고    scopus 로고
    • An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    • DIKU, University of Copenhagen
    • S. Ropke, D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Technical Report 04/13, DIKU, University of Copenhagen, 2004.
    • (2004) Technical Report , vol.4 , Issue.13
    • Ropke, S.1    Pisinger, D.2
  • 32
    • 47249145303 scopus 로고    scopus 로고
    • A unified heuristic for vehicle routing problems with backhauls
    • DIKU, University of Copenhagen
    • S. Ropke, D. Pisinger, A unified heuristic for vehicle routing problems with backhauls, Technical Report 04/14, DIKU, University of Copenhagen, 2004.
    • (2004) Technical Report , vol.4 , Issue.14
    • Ropke, S.1    Pisinger, D.2
  • 33
    • 0033440859 scopus 로고    scopus 로고
    • A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
    • S. Salhi, and G. Nagy A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling Journal of the Operational Research Society 50 1999 1034 1042
    • (1999) Journal of the Operational Research Society , vol.50 , pp. 1034-1042
    • Salhi, S.1    Nagy, G.2
  • 35
    • 3042532020 scopus 로고    scopus 로고
    • The pickup and delivery problem with time windows and precendences
    • M. Sigurd, D. Pisinger, and M. Sig The pickup and delivery problem with time windows and precendences Transportation Science 38 2004 197 209
    • (2004) Transportation Science , vol.38 , pp. 197-209
    • Sigurd, M.1    Pisinger, D.2    Sig, M.3
  • 37
    • 11144355669 scopus 로고    scopus 로고
    • The single-vehicle routing problem with unrestricted backhauls
    • H. Süral, and J.H. Bookbinder The single-vehicle routing problem with unrestricted backhauls Networks 41 2003 127 136
    • (2003) Networks , vol.41 , pp. 127-136
    • Süral, H.1    Bookbinder, J.H.2
  • 38
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 1987 254 265
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 39
    • 0030283791 scopus 로고    scopus 로고
    • Heuristic approaches to vehicle routing with backhauls and time windows
    • S.R. Thangiah, J.-Y. Potvin, and T. Sun Heuristic approaches to vehicle routing with backhauls and time windows Computers & Operations Research 23 1996 1043 1057
    • (1996) Computers & Operations Research , vol.23 , pp. 1043-1057
    • Thangiah, S.R.1    Potvin, J.-Y.2    Sun, T.3
  • 40
    • 0039780233 scopus 로고
    • An upper bound algorithm for the single and multiple terminal delivery problem
    • F.A. Tillman, and T.M. Cain An upper bound algorithm for the single and multiple terminal delivery problem Management Science 18 1972 664 682
    • (1972) Management Science , vol.18 , pp. 664-682
    • Tillman, F.A.1    Cain, T.M.2
  • 41
    • 0033102430 scopus 로고    scopus 로고
    • A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
    • P. Toth, and D. Vigo A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls European Journal of Operational Research 113 1999 528 543
    • (1999) European Journal of Operational Research , vol.113 , pp. 528-543
    • Toth, P.1    Vigo, D.2
  • 42
    • 0031273028 scopus 로고    scopus 로고
    • An exact algorithm for the vehicle routing problem with backhauls
    • P. Toth, and D. Vigo An exact algorithm for the vehicle routing problem with backhauls Transportation Science 31 1997 372 385
    • (1997) Transportation Science , vol.31 , pp. 372-385
    • Toth, P.1    Vigo, D.2
  • 45
    • 0036889131 scopus 로고    scopus 로고
    • An investigation into a new class of vehicle routing problem with backhauls
    • A.C. Wade, and S. Salhi An investigation into a new class of vehicle routing problem with backhauls Omega 30 2002 487 497
    • (2002) Omega , vol.30 , pp. 487-497
    • Wade, A.C.1    Salhi, S.2
  • 46
    • 31144473997 scopus 로고    scopus 로고
    • Web page: www.diku.dk/~sropke.
  • 47
    • 31144455802 scopus 로고    scopus 로고
    • A simple approach to linehaul-backhaul problems: A guided local search approach for the vehicle routing problem
    • in press
    • Y. Zhong, M.H. Cole, A simple approach to linehaul-backhaul problems: A guided local search approach for the vehicle routing problem, Transportation Research Part E, in press.
    • Transportation Research Part E
    • Zhong, Y.1    Cole, M.H.2


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