메뉴 건너뛰기




Volumn 44, Issue 2, 1996, Pages 286-304

A new generation of vehicle routing research: Robust algorithms, addressing uncertainty

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); STATISTICAL METHODS; TRANSPORTATION ROUTES;

EID: 0030092384     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.2.286     Document Type: Article
Times cited : (224)

References (25)
  • 1
    • 0023416424 scopus 로고
    • Heuristics for unequal weight delivery problems with a fixed error guarantee
    • ALTINKEMER, K., AND B. GAVISH. 1987. Heuristics for Unequal Weight Delivery Problems with a Fixed Error Guarantee. O. R. Letts. 6, 149-158.
    • (1987) O. R. Letts. , vol.6 , pp. 149-158
    • Altinkemer, K.1    Gavish, B.2
  • 2
    • 0025513165 scopus 로고
    • Heuristics for equal weight delivery problems with constant error guarantees
    • ALTINKEMER, K., AND B. GAVISH. 1990. Heuristics for Equal Weight Delivery Problems With Constant Error Guarantees. Trans. Sci. 24, 294-297.
    • (1990) Trans. Sci. , vol.24 , pp. 294-297
    • Altinkemer, K.1    Gavish, B.2
  • 3
    • 0002211552 scopus 로고
    • One warehouse multiple retailer systems with vehicle routing costs
    • ANILY, S., AND A. FEDERGRUEN. 1990. One Warehouse Multiple Retailer Systems With Vehicle Routing Costs. Mgmt. Sci. 36, 92-114.
    • (1990) Mgmt. Sci. , vol.36 , pp. 92-114
    • Anily, S.1    Federgruen, A.2
  • 4
    • 0003181676 scopus 로고
    • Two-echelon distribution systems with vehicle routing costs and central inventories
    • ANILY, S., AND A. FEDERGRUEN. 1993. Two-Echelon Distribution Systems With Vehicle Routing Costs and Central Inventories. Opus. Res. 41, 37-47.
    • (1993) Opus. Res. , vol.41 , pp. 37-47
    • Anily, S.1    Federgruen, A.2
  • 5
    • 0000495533 scopus 로고
    • On an integer program for a delivery problem
    • BALINSKI, M. L., AND R. E. QUANDT. 1964. On an Integer Program for a Delivery Problem. Opns. Res. 12, 300-304.
    • (1964) Opns. Res. , vol.12 , pp. 300-304
    • Balinski, M.L.1    Quandt, R.E.2
  • 7
    • 0021034477 scopus 로고
    • Route first-cluster second method for vehicle routing
    • BEASLEY, J. 1983. Route First-Cluster Second Method for Vehicle Routing. Omega 11, 403-408.
    • (1983) Omega , vol.11 , pp. 403-408
    • Beasley, J.1
  • 9
    • 0001305305 scopus 로고
    • A vehicle routing problem with stochastic demand
    • BERTSIMAS, D. 1992. A Vehicle Routing Problem With Stochastic Demand. Opns. Res. 40, 574-585.
    • (1992) Opns. Res. , vol.40 , pp. 574-585
    • Bertsimas, D.1
  • 10
    • 0003040355 scopus 로고
    • A stochastic and dynamic vehicle routing problem in the euclidean plane
    • BERTSIMAS, D., AND G. VAN RYZIN. 1990. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Opns. Res. 39, 601-615.
    • (1990) Opns. Res. , vol.39 , pp. 601-615
    • Bertsimas, D.1    Van Ryzin, G.2
  • 11
    • 0005805838 scopus 로고
    • Stochastic and dynamic vehicle routing with general demand and inter-arrival time distributions
    • BERTSIMAS, D., AND G. VAN RYZIN. 1992. Stochastic and Dynamic Vehicle Routing With General Demand and Inter-arrival Time Distributions. Adv. Appl. Prob. 25, 947-978.
    • (1992) Adv. Appl. Prob. , vol.25 , pp. 947-978
    • Bertsimas, D.1    Van Ryzin, G.2
  • 12
    • 0002194173 scopus 로고
    • Stochastic and dynamic vehicle routing in the euclidean plane with multiple capacitated vehicles
    • BERTSIMAS, D., AND G. VAN RYZIN. 1993. Stochastic and Dynamic Vehicle Routing in the Euclidean Plane With Multiple Capacitated Vehicles. Opns. Res. 41, 60-76.
    • (1993) Opns. Res. , vol.41 , pp. 60-76
    • Bertsimas, D.1    Van Ryzin, G.2
  • 13
    • 17144423253 scopus 로고
    • On the dynamic traveling repairman problem
    • Purdue University, West Lafayette, Ind.
    • PAPASTAVROU, J., AND V. CHANDRU. 1992. On the Dynamic Traveling Repairman Problem. Technical Report, Purdue University, West Lafayette, Ind.
    • (1992) Technical Report
    • Papastavrou, J.1    Chandru, V.2
  • 14
    • 0023246782 scopus 로고
    • Efficient algorithms for the capacitated concentrator location problem
    • PIRKUL, H. 1987. Efficient Algorithms for the Capacitated Concentrator Location Problem. Comp. in Opus. Res. 14, 197-208.
    • (1987) Comp. in Opus. Res. , vol.14 , pp. 197-208
    • Pirkul, H.1
  • 15
    • 0024750851 scopus 로고
    • Spacefilling curves and the planar traveling salesman problem
    • PLATZMAN, L. K., AND J. J. BARTHOLDI, III. 1989. Spacefilling Curves and the Planar Traveling Salesman Problem. J. Assoc. Comp. Mach. 36, 719-737.
    • (1989) J. Assoc. Comp. Mach. , vol.36 , pp. 719-737
    • Platzman, L.K.1    Bartholdi III, J.J.2
  • 16
    • 0022723355 scopus 로고
    • A stochastic model for the dynamic vehicle allocation problem
    • POWELL, W. 1986. A Stochastic Model for the Dynamic Vehicle Allocation Problem. Trans. Sci. 20, 117-129.
    • (1986) Trans. Sci. , vol.20 , pp. 117-129
    • Powell, W.1
  • 17
    • 77957806193 scopus 로고
    • Stochastic and dynamic networks and routing
    • the volume on Network Routing, M. Ball, T. Magnanti, C. Monma and G. Nemhauser (eds.)
    • POWELL, W., P. JAILLET AND A. ODONI. 1995. Stochastic and Dynamic Networks and Routing. In Handbooks in Operations Research and Management Science, the volume on Network Routing, M. Ball, T. Magnanti, C. Monma and G. Nemhauser (eds.).
    • (1995) Handbooks in Operations Research and Management Science
    • Powell, W.1    Jaillet, P.2    Odoni, A.3
  • 18
    • 0001959645 scopus 로고
    • Dynamic vehicle routing problems
    • B. Golden and A. Assad (eds.). North-Holland, Amsterdam
    • PSARAFTIS, H. 1988. Dynamic Vehicle Routing Problems. In Vehicle Routing: Methods and Studies, B. Golden and A. Assad (eds.). North-Holland, Amsterdam.
    • (1988) Vehicle Routing: Methods and Studies
    • Psaraftis, H.1
  • 19
    • 0001850846 scopus 로고
    • Dynamic shortest paths in acyclic networks with markovian arc costs
    • PSARAFTIS, H., AND J. TSITSIKLIS. 1993. Dynamic Shortest Paths in Acyclic Networks With Markovian Arc Costs. Opns. Res. 41, 91-101.
    • (1993) Opns. Res. , vol.41 , pp. 91-101
    • Psaraftis, H.1    Tsitsiklis, J.2
  • 21
    • 0001231127 scopus 로고
    • Martingale inequalities and NP-complete problems
    • RHEE, W. T., AND M. TALAGRAND. 1987. Martingale Inequalities and NP-Complete Problems. Math O. R. 12, 177-181.
    • (1987) Math O. R. , vol.12 , pp. 177-181
    • Rhee, W.T.1    Talagrand, M.2
  • 22
    • 0242706462 scopus 로고
    • Hierarchical planning for probabilistic distribution systems in euclidean spaces
    • SIMCHI-LEVI, D. 1992. Hierarchical Planning for Probabilistic Distribution Systems in Euclidean Spaces. Mgmt. Sci. 38, 198-211.
    • (1992) Mgmt. Sci. , vol.38 , pp. 198-211
    • Simchi-Levi, D.1
  • 23
    • 0023964259 scopus 로고
    • Time window constrained routing and scheduling problems
    • SOLOMON, M. M., AND J. DESROSIERS. 1988. Time Window Constrained Routing and Scheduling Problems. Trans. Sci. 22, 1-13.
    • (1988) Trans. Sci. , vol.22 , pp. 1-13
    • Solomon, M.M.1    Desrosiers, J.2
  • 24
    • 0020941699 scopus 로고
    • Stochastic vehicle routing: A comprehensive approach
    • STEWART, W., AND B. GOLDEN. 1983. Stochastic Vehicle Routing: A Comprehensive Approach. Eur. J. Opnl. Res. 14, 371-385.
    • (1983) Eur. J. Opnl. Res. , vol.14 , pp. 371-385
    • Stewart, W.1    Golden, B.2
  • 25
    • 85033012779 scopus 로고
    • Dynamic ground holding policies for a network of airports
    • to appear
    • VRANAS, P., D. BERTSIMAS AND A. ODONI. 1993. Dynamic Ground Holding Policies for a Network of Airports. Trans. Sci. (to appear).
    • (1993) Trans. Sci.
    • Vranas, P.1    Bertsimas, D.2    Odoni, A.3


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