메뉴 건너뛰기




Volumn 130, Issue 1-4, 2004, Pages 199-216

Solving VRPTWs with constraint programming based column generation

Author keywords

Column generation; Constraint programming; Hybrid method; Optimization constraints; Vehicle routing with time windows

Indexed keywords


EID: 3142773421     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000032576.73681.29     Document Type: Article
Times cited : (67)

References (20)
  • 3
    • 0001391104 scopus 로고
    • Decomposition principles for linear programs
    • Dantzig, G.B. and P. Wolfe. (1960). "Decomposition Principles for Linear Programs." Operations Research 8, 101-111.
    • (1960) Operations Research , vol.8 , pp. 101-111
    • Dantzig, G.B.1    Wolfe, P.2
  • 5
    • 85042163696 scopus 로고
    • A new optimisation algorithm for the vehicle routing problem with time windows
    • Desrochers, M., J. Desrosiers, and M.M. Solomon. (1992). "A New Optimisation Algorithm for the Vehicle Routing Problem with Time Windows." Operations Research 40, 342-354.
    • (1992) Operations Research , vol.40 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.M.3
  • 8
    • 0036437255 scopus 로고    scopus 로고
    • Constraint programming based column generation with knapsack subproblems
    • Fahle, T. and M. Sellmann. (2002). "Constraint Programming Based Column Generation with Knapsack Subproblems." Annals of Operations Research 115, 73-94.
    • (2002) Annals of Operations Research , vol.115 , pp. 73-94
    • Fahle, T.1    Sellmann, M.2
  • 12
    • 84873003811 scopus 로고    scopus 로고
    • ILOG S.A. (2002a). ILOG Cplex.
    • (2002) ILOG Cplex
  • 14
    • 84872987367 scopus 로고    scopus 로고
    • ILOG S.A. (2002c). ILOG Solver.
    • (2002) ILOG Solver
  • 15
  • 16
    • 0031140531 scopus 로고    scopus 로고
    • An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation
    • Kohl, N. and O.B.G. Madsen. (1997). "An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation." Operations Research 45(3), 395-407.
    • (1997) Operations Research , vol.45 , Issue.3 , pp. 395-407
    • Kohl, N.1    Madsen, O.B.G.2
  • 18
    • 0032000244 scopus 로고    scopus 로고
    • An exact constraint logic programming algorithm for the traveling salesman problem with time windows
    • Pesant, G., M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1998). "An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows." Transportation Science 32, 12-29.
    • (1998) Transportation Science , vol.32 , pp. 12-29
    • Pesant, G.1    Gendreau, M.2    Potvin, J.-Y.3    Rousseau, J.-M.4
  • 19
    • 0032650526 scopus 로고    scopus 로고
    • On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
    • Pesant, G., M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1999). "On the Flexibility of Constraint Programming Models: From Single to Multiple Time Windows for the Traveling Salesman Problem." European Journal of Operational Research 117, 253-263.
    • (1999) European Journal of Operational Research , vol.117 , pp. 253-263
    • Pesant, G.1    Gendreau, M.2    Potvin, J.-Y.3    Rousseau, J.-M.4


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