메뉴 건너뛰기




Volumn 211, Issue 2, 2011, Pages 318-332

A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery

Author keywords

Branch and cut; Location routing problem; Logistics; Simulated annealing; Simultaneous pickup and delivery

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATION TIME; COMPUTATIONAL RESULTS; LOCAL SEARCH; LOCATION-ROUTING PROBLEM; OVERALL COSTS; PICKUP AND DELIVERY; SIMULATED ANNEALING ALGORITHMS; SIMULTANEOUS PICKUP AND DELIVERY; UPPER BOUND; VALID INEQUALITY;

EID: 79951678318     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.01.003     Document Type: Article
Times cited : (84)

References (47)
  • 1
    • 0041704620 scopus 로고    scopus 로고
    • An improved branch-and-cut algorithm for the capacitated vehicle routing problem
    • N.R. Achuthan, L. Caccetta, and S.P. Hill An improved branch-and-cut algorithm for the capacitated vehicle routing problem Transportation Science 37 2 2003 153 169
    • (2003) Transportation Science , vol.37 , Issue.2 , pp. 153-169
    • Achuthan, N.R.1    Caccetta, L.2    Hill, S.P.3
  • 3
    • 13444252546 scopus 로고    scopus 로고
    • Distribution network design: New problems and related models
    • DOI 10.1016/j.ejor.2003.04.009, PII S0377221704000967
    • D. Ambrosino, and M. Grazia ScutellaI Distribution network design: New problems and related models European Journal of Operational Research 165 3 2005 610 624 (Pubitemid 40206345)
    • (2005) European Journal of Operational Research , vol.165 , Issue.3 , pp. 610-624
    • Ambrosino, D.1    Grazia Scutella, M.2
  • 4
    • 14844341132 scopus 로고    scopus 로고
    • The vehicle routing problem with time windows and simultaneous pick-up and delivery
    • Springer Germany
    • E. Angelelli, and R. Mansini The vehicle routing problem with time windows and simultaneous pick-up and delivery Lecture Notes in Economics and Mathematical Systems 2002 Springer Germany 249 267
    • (2002) Lecture Notes in Economics and Mathematical Systems , pp. 249-267
    • Angelelli, E.1    Mansini, R.2
  • 5
    • 8344229228 scopus 로고    scopus 로고
    • An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
    • R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation Operations Research 52 5 2004 723 738
    • (2004) Operations Research , vol.52 , Issue.5 , pp. 723-738
    • Baldacci, R.1    Hadjiconstantinou, E.2    Mingozzi, A.3
  • 6
    • 79951677209 scopus 로고    scopus 로고
    • Barreto, S.S., 2003. Available from: < http://sweet.us.pt/∼iscf143 >.
    • (2003)
    • Barreto, S.S.1
  • 7
    • 33845918053 scopus 로고    scopus 로고
    • Using clustering analysis in a capacitated location-routing problem
    • DOI 10.1016/j.ejor.2005.06.074, PII S0377221706000786
    • S.S. Barreto, C. Ferreira, J. Paixao, and B.S. Santos Using clustering analysis in a capacitated location-routing problem European Journal of Operational Research 179 2007 968 977 (Pubitemid 46038597)
    • (2007) European Journal of Operational Research , vol.179 , Issue.3 , pp. 968-977
    • Barreto, S.1    Ferreira, C.2    Paixao, J.3    Santos, B.S.4
  • 9
    • 85132117646 scopus 로고    scopus 로고
    • Static pickup and delivery problems: A classification scheme and survey
    • G. Berbeglia, J.F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey TOP 15 2007 1 31
    • (2007) TOP , vol.15 , pp. 1-31
    • Berbeglia, G.1    Cordeau, J.F.2    Gribkovskaia, I.3    Laporte, G.4
  • 10
    • 34247476119 scopus 로고    scopus 로고
    • Location-routing problems with distance constraints
    • DOI 10.1287/trsc.1060.0156
    • R.T. Berger, C.R. Coullard, and M. Daskin Location-routing problems with distance constraints Transportation Science 41 1 2007 29 43 (Pubitemid 46652902)
    • (2007) Transportation Science , vol.41 , Issue.1 , pp. 29-43
    • Berger, R.T.1    Coullard, C.R.2    Daskin, M.S.3
  • 11
    • 68349097433 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
    • 10.1002/net
    • J.F. Berube, M. Gendreau, and J.Y. Potvin A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem Networks 2009 10.1002/net
    • (2009) Networks
    • Berube, J.F.1    Gendreau, M.2    Potvin, J.Y.3
  • 12
    • 0001549833 scopus 로고
    • An algorithm for the vehicle dispatching problem
    • N. Christofides, and S. Eilon An algorithm for the vehicle dispatching problem Operational Research Quarterly 20 3 1969 309 318
    • (1969) Operational Research Quarterly , vol.20 , Issue.3 , pp. 309-318
    • Christofides, N.1    Eilon, S.2
  • 13
    • 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
  • 14
    • 70449108144 scopus 로고    scopus 로고
    • Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
    • 10.1016/j.cor.2009.08.003
    • J.F. Cordeau, M. Dell'Amico, and M. Iori Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading Computers and Operations Research 2009 10.1016/j.cor.2009.08.003
    • (2009) Computers and Operations Research
    • Cordeau, J.F.1    Dell'Amico, M.2    Iori, M.3
  • 15
  • 16
    • 58149318797 scopus 로고
    • A result on projection for the vehicle routing problem
    • L. Gouveia A result on projection for the vehicle routing problem European Journal of Operational Research 85 1995 610 624
    • (1995) European Journal of Operational Research , vol.85 , pp. 610-624
    • Gouveia, L.1
  • 21
    • 0019527621 scopus 로고
    • An exact algorithm for minimizing routing and operating costs in depot location
    • DOI 10.1016/0377-2217(81)90212-5
    • G. Laporte, and Y. Nobert An exact algorithm for minimizing routing and operating costs in depot location European Journal of Operational Research 6 1981 224 226 (Pubitemid 11466204)
    • (1981) European Journal of Operational Research , vol.6 , Issue.2 , pp. 224-226
    • Laporte Gilbert1    Nobert Yves2
  • 23
    • 0006234051 scopus 로고
    • An exact algorithm for solving a capacitated location-routing problem
    • G. Laporte, Y. Nobert, and D. Arpin An exact algorithm for solving a capacitated location-routing problem Annals of Operations Research 6 1986 293 310
    • (1986) Annals of Operations Research , vol.6 , pp. 293-310
    • Laporte, G.1    Nobert, Y.2    Arpin, D.3
  • 24
    • 0001785441 scopus 로고
    • Location-routing problems
    • G. Laporte Location-routing problems B.L. Golden, A.A. Assad, Vehicle Routing: Methods and Studies 1988 North-Holland Amsterdam 163 198
    • (1988) Vehicle Routing: Methods and Studies , pp. 163-198
    • Laporte, G.1
  • 25
    • 0024067262 scopus 로고
    • Solving a family of multi-depot vehicle routing and location-routing problems
    • G. Laporte, and Y. Nobert Solving a family of multi-depot vehicle routing and location-routing problems Transportation Science 22 3 1988 161 172 (Pubitemid 18654114)
    • (1988) Transportation Science , vol.22 , Issue.3 , pp. 161-172
    • Laporte Gilbert1    Nobert Yves2    Taillefer Serge3
  • 26
    • 29044438268 scopus 로고    scopus 로고
    • Projection results for vehicle routing
    • DOI 10.1007/s10107-005-0652-x
    • A.N. Letchford, and J.J. Salazar-Gonzalez Projection results for vehicle routing Mathematical Programming 105 2-3 2006 251 274 (Pubitemid 41788320)
    • (2006) Mathematical Programming , vol.105 , Issue.2-3 , pp. 251-274
    • Letchford, A.N.1    Salazar-Gonzalez, J.-J.2
  • 27
    • 39449125640 scopus 로고    scopus 로고
    • A particle swarm optimization algorithm with path relinking for the location routing problem
    • Y. Marinakis, and M. Marinaki A particle swarm optimization algorithm with path relinking for the location routing problem Journal of Mathematical Modelling and Algorithms 7 2008 59 78
    • (2008) Journal of Mathematical Modelling and Algorithms , vol.7 , pp. 59-78
    • Marinakis, Y.1    Marinaki, M.2
  • 28
    • 26644438136 scopus 로고    scopus 로고
    • A metaheuristic to solve a location-routing problem with non-linear costs
    • DOI 10.1007/s10732-005-3601-1, Supply Chain and Distribution Management
    • J. Melechovsky, and C. Prins A metaheuristic to solve a location routing problem with non-linear costs Journal of Heuristics 11 2005 375 391 (Pubitemid 41442659)
    • (2005) Journal of Heuristics , vol.11 , pp. 375-391
    • Melechovsky, J.1    Prins, C.2    Calvo, R.W.3
  • 29
    • 0032121681 scopus 로고    scopus 로고
    • Combined location-routing problems: A synthesis and future research directions
    • PII S0377221797001720
    • H. Min, V. Jayaraman, and R. Srivastava Combined location-routing problems: A synthesis and future research directions European Journal of Operational Research 108 1 1998 1 15 (Pubitemid 128372582)
    • (1998) European Journal of Operational Research , vol.108 , Issue.1 , pp. 1-15
    • Min, H.1    Jayaraman, V.2    Srivastava, R.3
  • 30
    • 85015869693 scopus 로고
    • The pickup delivery location problem on networks
    • G. Mosheiov The pickup delivery location problem on networks Networks 26 1995 243 251
    • (1995) Networks , vol.26 , pp. 243-251
    • Mosheiov, G.1
  • 31
    • 0347811396 scopus 로고    scopus 로고
    • The many-to-many location-routing problem
    • G. Nagy, and S. Salhi The many-to-many location-routing problem TOP 6 1998 261 275
    • (1998) TOP , vol.6 , pp. 261-275
    • Nagy, G.1    Salhi, S.2
  • 32
    • 33750442870 scopus 로고    scopus 로고
    • Location-routing: Issues, models and methods
    • DOI 10.1016/j.ejor.2006.04.004, PII S0377221706002670
    • G. Nagy, and S. Salhi Location-routing: Issues, models and methods European Journal of Operational Research 177 2 2007 649 672 (Pubitemid 44647670)
    • (2006) European Journal of Operational Research , vol.177 , Issue.2 , pp. 649-672
    • Nagy, G.1    Salhi, S.2
  • 33
    • 41349095406 scopus 로고    scopus 로고
    • A survey on pickup and delivery problems. Part I: Transportation between customers and depot
    • S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems. Part I: Transportation between customers and depot Journal für Betriebswirtschaft 58 1 2008 21 51
    • (2008) Journal für Betriebswirtschaft , vol.58 , Issue.1 , pp. 21-51
    • Parragh, S.N.1    Doerner, K.F.2    Hartl, R.F.3
  • 34
    • 0040420273 scopus 로고
    • A unified warehouse location-routing methodology
    • J. Perl, and M.S. Daskin A unified warehouse location-routing methodology Journal of Business Logistics 5 1 1984 92 111
    • (1984) Journal of Business Logistics , vol.5 , Issue.1 , pp. 92-111
    • Perl, J.1    Daskin, M.S.2
  • 35
    • 0022267384 scopus 로고
    • A warehouse location-routing problem
    • J. Perl, and M.S. Daskin A warehouse location-routing problem Transportation Research 19 5 1985 381 396
    • (1985) Transportation Research , vol.19 , Issue.5 , pp. 381-396
    • Perl, J.1    Daskin, M.S.2
  • 36
    • 33748549934 scopus 로고    scopus 로고
    • Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
    • C. Prins, C. Prodhon, and R. Wolfler Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR 4 2006 221 238
    • (2006) 4OR , vol.4 , pp. 221-238
    • Prins, C.1    Prodhon, C.2    Wolfler Calvo, R.3
  • 40
    • 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 (Pubitemid 129596355)
    • (1999) Journal of the Operational Research Society , vol.50 , Issue.10 , pp. 1034-1042
    • Salhi, S.1    Nagy, G.2
  • 41
    • 0025548968 scopus 로고
    • The location-routing problem: Consideration in physical distribution system design
    • R. Srivastava, and W.C. Benton The location-routing problem: Consideration in physical distribution system design Computers and Operations Research 6 1990 427 435
    • (1990) Computers and Operations Research , vol.6 , pp. 427-435
    • Srivastava, R.1    Benton, W.C.2
  • 42
    • 0006081878 scopus 로고
    • Alternate solution procedures for the location-routing problem
    • R. Srivastava Alternate solution procedures for the location-routing problem Omega 21 4 1993 497 506
    • (1993) Omega , vol.21 , Issue.4 , pp. 497-506
    • Srivastava, R.1
  • 43
    • 33748636920 scopus 로고    scopus 로고
    • A survey of simulated annealing as a tool for single and multiobjective optimization
    • DOI 10.1057/palgrave.jors.2602068, PII 2602068
    • B. Suman, and P. Kumar A survey of simulated annealing as a tool for single and multiobjective optimization Journal of the Operational Research Society 57 10 2006 1143 1160 (Pubitemid 44386382)
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.10 , pp. 1143-1160
    • Suman, B.1    Kumar, P.2
  • 44
    • 0032689016 scopus 로고    scopus 로고
    • A Two-phase tabu search approach to the location routing problem
    • D. Tuzun, and L.I. Burke A Two-phase tabu search approach to the location routing problem European Journal of Operational Research 116 1 1999 87 99
    • (1999) European Journal of Operational Research , vol.116 , Issue.1 , pp. 87-99
    • Tuzun, D.1    Burke, L.I.2
  • 45
    • 0006218834 scopus 로고
    • Cost functions in the location of depots for multiple delivery journeys
    • M.H.J. Webb Cost functions in the location of depots for multiple delivery journeys Operational Research Quarterly 19 3 1968 311 320
    • (1968) Operational Research Quarterly , vol.19 , Issue.3 , pp. 311-320
    • Webb, M.H.J.1
  • 46
    • 0036722144 scopus 로고    scopus 로고
    • Heuristic solutions to multi-depot location-routing problems
    • DOI 10.1016/S0305-0548(01)00038-7, PII S0305054801000387
    • T.H. Wu, C. Low, and J.W. Bai Heuristic solutions to multi-depot location-routing problems Computers and Operations Research 29 10 2002 1393 1415 (Pubitemid 34409654)
    • (2002) Computers and Operations Research , vol.29 , Issue.10 , pp. 1393-1415
    • Wu, T.-H.1    Low, C.2    Bai, J.-W.3
  • 47
    • 76349125786 scopus 로고    scopus 로고
    • A Simulated Annealing Heuristic for the Capacitated Location Routing Problme
    • V.F. Yu, S.W. Lin, W. Lee, and C.J. Ting A Simulated Annealing Heuristic for the Capacitated Location Routing Problme Computers and Industrial Engineering 58 2 2010 288 299
    • (2010) Computers and Industrial Engineering , vol.58 , Issue.2 , pp. 288-299
    • Yu, V.F.1    Lin, S.W.2    Lee, W.3    Ting, C.J.4


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