메뉴 건너뛰기




Volumn 12, Issue 1, 2011, Pages 5-38

Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem

Author keywords

Elementary shortest path problem with resource constraints; Fleet planning; Transshipment; Vehicle routing

Indexed keywords


EID: 84859305600     PISSN: 1886516X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (46)

References (46)
  • 1
    • 0004115996 scopus 로고
    • Network Flows
    • Prentice-Hall, Upper Saddle River
    • R. Ahuja, T. Magnanti, and J. Orlin, "Network Flows", Prentice-Hall, Upper Saddle River, 1993.
    • (1993)
    • Ahuja, R.1    Magnanti, T.2    Orlin, J.3
  • 2
    • 77957088264 scopus 로고
    • Arc Routing Methods and Applications
    • Elsevier, M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (eds.), Amsterdam
    • A. Assad and B. Golden, "Arc Routing Methods and Applications", in: M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (eds.), Network Routing, Handbooks in Operations Research and Management Science, vol. 8, Elsevier, Amsterdam, 1995, pp. 375-483.
    • (1995) Network Routing, Handbooks in Operations Research and Management Science , vol.8 , pp. 375-483
    • Assad, A.1    Golden, B.2
  • 4
    • 51649085328 scopus 로고    scopus 로고
    • Scheduling of Local Delivery Carrier Routes for the United States Postal Service
    • M. Dror (ed.), Boston
    • L. Bodin and L. Levy, "Scheduling of Local Delivery Carrier Routes for the United States Postal Service", in: M. Dror (ed.), Arc Routing: Theory, Solutions, and Applications, Kluwer, Boston, 2000, pp. 419-442.
    • (2000) Arc Routing: Theory, Solutions, and Applications, Kluwer , pp. 419-442
    • Bodin, L.1    Levy, L.2
  • 5
    • 28044459377 scopus 로고    scopus 로고
    • Accelerated Label Setting Algorithms for the Elementary Resource Constrained Shortest Path Problem
    • N. Boland, J. Dethridge, and I. Dumitrescu, "Accelerated Label Setting Algorithms for the Elementary Resource Constrained Shortest Path Problem", Operations Research Letters, vol. 34, 2006, pp. 58-68.
    • (2006) Operations Research Letters , vol.34 , pp. 58-68
    • Boland, N.1    Dethridge, J.2    Dumitrescu, I.3
  • 6
    • 84859299938 scopus 로고
    • Optimale Standort- und Tourenplanung für die Rohmilcherfassung eines Molkereibetriebes
    • Münster
    • J. Brunswicker, "Optimale Standort- und Tourenplanung für die Rohmilcherfassung eines Molkereibetriebes", Lit, Münster, 1986.
    • (1986) Lit
    • Brunswicker, J.1
  • 7
    • 32044469861 scopus 로고    scopus 로고
    • Vehicle Routing Problem with Elementary Shortest Path Based Column Generation
    • A. Chabrier, "Vehicle Routing Problem with Elementary Shortest Path Based Column Generation", Computers & Operations Research, vol. 33, 2006, pp. 2972-2990.
    • (2006) Computers & Operations Research , vol.33 , pp. 2972-2990
    • Chabrier, A.1
  • 8
    • 0036028038 scopus 로고    scopus 로고
    • A Tabu Search Method for the Truck and Trailer Routing Problem
    • I. Chao, "A Tabu Search Method for the Truck and Trailer Routing Problem", Computers & Operations Research, vol. 29, 2002, pp. 33-51.
    • (2002) Computers & Operations Research , vol.29 , pp. 33-51
    • Chao, I.1
  • 9
    • 33845365435 scopus 로고    scopus 로고
    • A Column Generation Approach to the Heterogeneous Fleet Vehicle Routing Problem
    • E. Choi and D. Tcha, "A Column Generation Approach to the Heterogeneous Fleet Vehicle Routing Problem", Computers & Operations Research, vol. 34, 2007, pp. 2080-2095.
    • (2007) Computers & Operations Research , vol.34 , pp. 2080-2095
    • Choi, E.1    Tcha, D.2
  • 10
    • 0001953950 scopus 로고
    • The Truck Dispatching Problem
    • G. Dantzig and J. Ramser, "The Truck Dispatching Problem", Management Science, vol. 6, 1959, pp. 80-91.
    • (1959) Management Science , vol.6 , pp. 80-91
    • Dantzig, G.1    Ramser, J.2
  • 12
    • 0002127739 scopus 로고    scopus 로고
    • A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
    • T. Crainic and G. Laporte (eds.), Boston
    • G. Desaulniers, J. Desrosiers, I. Ioachim, M. Solomon, F. Soumis, and D. Villeneuve, "A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems", in: T. Crainic and G. Laporte (eds.), Fleet Management and Logistics, Kluwer, Boston, 1998, pp. 57-93.
    • (1998) Fleet Management and Logistics, Kluwer , pp. 57-93
    • Desaulniers, G.1    Desrosiers, J.2    Ioachim, I.3    Solomon, M.4    Soumis, F.5    Villeneuve, D.6
  • 13
    • 79251650202 scopus 로고    scopus 로고
    • Ph. D. Thesis, Faculty of Business and Economics, RWTH Aachen University
    • M. Drexl, "On Some Generalized Routing Problems", Ph. D. Thesis, Faculty of Business and Economics, RWTH Aachen University, 2007.
    • (2007) On Some Generalized Routing Problems
    • Drexl, M.1
  • 16
    • 4644250559 scopus 로고    scopus 로고
    • An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems
    • D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems", Networks, vol. 44, 2004, pp. 216-229.
    • (2004) Networks , vol.44 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 21
    • 84859303923 scopus 로고    scopus 로고
    • A Tabu Search Approach for Milk Collection in Western Norway Using Trucks and Trailers
    • A. Hoff and A. Løkketangen, "A Tabu Search Approach for Milk Collection in Western Norway Using Trucks and Trailers", Molde University College, 2006.
    • (2006) Molde University College
    • Hoff, A.1    Løkketangen, A.2
  • 22
    • 33749134449 scopus 로고    scopus 로고
    • A Lagrangian Relaxation-Based Heuristic for the Vehicle Routing with Full Container Load
    • A. Imai, E. Nishimura, and J. Current, "A Lagrangian Relaxation-Based Heuristic for the Vehicle Routing with Full Container Load", European Journal of Operational Research, vol. 176, 2007, pp. 87-105.
    • (2007) European Journal of Operational Research , vol.176 , pp. 87-105
    • Imai, A.1    Nishimura, E.2    Current, J.3
  • 23
    • 0003871857 scopus 로고    scopus 로고
    • A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs
    • I. Ioachim, S. Gélinas, F. Soumis, and J. Desrosiers, "A Dynamic Programming Algorithm for the Shortest Path Problem with Time Windows and Linear Node Costs", Networks, vol. 31, 1998, pp. 193-204.
    • (1998) Networks , vol.31 , pp. 193-204
    • Ioachim, I.1    Gélinas, S.2    Soumis, F.3    Desrosiers, J.4
  • 24
    • 84889973397 scopus 로고    scopus 로고
    • Shortest Path Problems with Resource Constraints
    • G. Desaulniers, J. Desrosiers, and M. Solomon (eds.), Springer, New York
    • S. Irnich and G. Desaulniers, "Shortest Path Problems with Resource Constraints", in: G. Desaulniers, J. Desrosiers, and M. Solomon (eds.), Column Generation, Springer, New York, 2005, pp. 33-65.
    • (2005) Column Generation , pp. 33-65
    • Irnich, S.1    Desaulniers, G.2
  • 25
    • 33748591592 scopus 로고    scopus 로고
    • The Shortest Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
    • S. Irnich and D. Villeneuve, "The Shortest Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3", INFORMS Journal on Computing, vol. 18, 2006, pp. 391-406.
    • (2006) INFORMS Journal on Computing , vol.18 , pp. 391-406
    • Irnich, S.1    Villeneuve, D.2
  • 28
    • 0001785441 scopus 로고
    • Location-Routing Problems
    • A. Assad and B. Golden (eds.), Elsevier, Amsterdam
    • G. Laporte, "Location-Routing Problems", in: A. Assad and B. Golden (eds.), Vehicle Routing: Methods and Studies, Elsevier, Amsterdam, 1988, pp. 163-197.
    • (1988) Vehicle Routing: Methods and Studies , pp. 163-197
    • Laporte, G.1
  • 29
    • 0024067262 scopus 로고
    • Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
    • G. Laporte, Y. Nobert, and S. Taillefer, "Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems", Transportation Science, vol. 22, 1988, pp. 161-172.
    • (1988) Transportation Science , vol.22 , pp. 161-172
    • Laporte, G.1    Nobert, Y.2    Taillefer, S.3
  • 30
    • 30344453380 scopus 로고    scopus 로고
    • Selected Topics in Column Generation
    • M. Lübbecke and J. Desrosiers, "Selected Topics in Column Generation", Operations Research, vol. 53, 2005, pp. 1007-1023.
    • (2005) Operations Research , vol.53 , pp. 1007-1023
    • Lübbecke, M.1    Desrosiers, J.2
  • 31
    • 56049084014 scopus 로고    scopus 로고
    • Solving the Truck and Trailer Routing Problem Based on a Simulated Annealing Heuristic
    • S. Lin, V. Yu, and S. Chou, "Solving the Truck and Trailer Routing Problem Based on a Simulated Annealing Heuristic", Computers & Operations Research, vol. 36, 2009, pp. 1683-1692.
    • (2009) Computers & Operations Research , vol.36 , pp. 1683-1692
    • Lin, S.1    Yu, V.2    Chou, S.3
  • 32
    • 70349562478 scopus 로고    scopus 로고
    • A Note on the Truck and Trailer Routing Problem
    • S. Lin, V. Yu, and S. Chou, "A Note on the Truck and Trailer Routing Problem", Expert Systems with Applications, vol. 37, 2010, pp. 899-903.
    • (2010) Expert Systems with Applications , vol.37 , pp. 899-903
    • Lin, S.1    Yu, V.2    Chou, S.3
  • 33
    • 0030244403 scopus 로고    scopus 로고
    • Nested Heuristic Methods for the Location-Routeing Problem
    • G. Nagy and S. Salhi, "Nested Heuristic Methods for the Location-Routeing Problem", Journal of the Operational Research Society, vol. 47, 1996, pp. 1166-1174.
    • (1996) Journal of the Operational Research Society , vol.47 , pp. 1166-1174
    • Nagy, G.1    Salhi, S.2
  • 34
  • 35
    • 71649099891 scopus 로고    scopus 로고
    • A Branch-and-Price-Based Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows
    • E. Prescott-Gagnon, G. Desaulniers, and L. Rousseau, "A Branch-and-Price-Based Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows", Networks, vol. 54, 2009, pp. 190-204.
    • (2009) Networks , vol.54 , pp. 190-204
    • Prescott-Gagnon, E.1    Desaulniers, G.2    Rousseau, L.3
  • 36
    • 33746329306 scopus 로고    scopus 로고
    • Symmetry Helps: Bounded Bi-Directional Dynamic Programming for the Elementary Shortest Path Problem with Resource Constraints
    • G. Righini and M. Salani, "Symmetry Helps: Bounded Bi-Directional Dynamic Programming for the Elementary Shortest Path Problem with Resource Constraints", Discrete Optimization, vol. 3, 2006, pp. 255-273.
    • (2006) Discrete Optimization , vol.3 , pp. 255-273
    • Righini, G.1    Salani, M.2
  • 38
    • 36149001810 scopus 로고    scopus 로고
    • Ph. D. Thesis, Faculty of Mathematical, Physical and Natural Sciences, University of Milan
    • M. Salani, "Branch-and-Price Algorithms for Vehicle Routing Problems", Ph. D. Thesis, Faculty of Mathematical, Physical and Natural Sciences, University of Milan, 2005.
    • (2005) Branch-and-Price Algorithms for Vehicle Routing Problems
    • Salani, M.1
  • 40
    • 27144559161 scopus 로고    scopus 로고
    • A Tabu Search Heuristic for the Truck and Trailer Routing Problem
    • S. Scheuerer, "A Tabu Search Heuristic for the Truck and Trailer Routing Problem", Computers & Operations Research, vol. 33, 2006, pp. 894-909.
    • (2006) Computers & Operations Research , vol.33 , pp. 894-909
    • Scheuerer, S.1
  • 41
    • 21844486308 scopus 로고
    • A Two-Phase Algorithm for the Partial Accessibility Constrained Vehicle Routing Problem
    • F. Semet, "A Two-Phase Algorithm for the Partial Accessibility Constrained Vehicle Routing Problem", Annals of Operations Research, vol. 61, 1995, pp. 45-65.
    • (1995) Annals of Operations Research , vol.61 , pp. 45-65
    • Semet, F.1
  • 42
    • 21144468823 scopus 로고
    • Solving Real-Life Vehicle Routing Problems Efficiently Using Tabu Search
    • F. Semet and E. Taillard, "Solving Real-Life Vehicle Routing Problems Efficiently Using Tabu Search", Annals of Operations Research, vol. 41, 1993, pp. 469-488.
    • (1993) Annals of Operations Research , vol.41 , pp. 469-488
    • Semet, F.1    Taillard, E.2
  • 45
    • 0033725783 scopus 로고    scopus 로고
    • On Dantzig-Wolfe-Decomposition in Integer Programming and Ways to Perform Branching in a Branch-and-Price Algorithm
    • F. Vanderbeck, "On Dantzig-Wolfe-Decomposition in Integer Programming and Ways to Perform Branching in a Branch-and-Price Algorithm", Operations Research, vol. 48, 2000, pp. 111-128.
    • (2000) Operations Research , vol.48 , pp. 111-128
    • Vanderbeck, F.1


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