Robust Partitioning for Stochastic Multivehicle Routing

References

• Applegate D, Cook W, Johnson DS, Sloane NJA. Using large-scale computation to estimate the Beardwood-Halton-Hammersley TSP constant. (2010) Presentation, Symposium on Operations Research42 SBPOGoogle Scholar
• Applegate DL, Bixby RE, Chvatal V, Cook WJ. The Traveling Salesman Problem: A Computational Study (2007) (Princeton University Press, Princeton, NJ) Princeton Series in Applied MathematicsGoogle Scholar
• Aurenhammer F, Hoffmann F, Aronov B. Minkowski-type theorems and least-squares clustering. Algorithmica (1998) 20:61–76Crossref, Google Scholar
• Beardwood J, Halton JH, Hammersley JM. The shortest path through many points. Math. Proc. Cambridge Philos. Soc. (1959) 55(4):299–327Crossref, Google Scholar
• Ben-Tal A, Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23(4):769–805Link, Google Scholar
• Benson SJ, Ye Y. DSDP5 user guide—Software for semidefinite programming. (2005) . Technical Report ANL/MCS-TM-277, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL. Accessed April 2, 2013, http://www.mcs.anl.gov/hs/software/DSDPGoogle Scholar
• Bertsimas D. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40(3):574–585Link, Google Scholar
• Bertsimas D, Farias VF, Trichakis N. The price of fairness. Oper. Res. (2011) 59(1):17–31Link, Google Scholar
• Bertsimas D, Doan XV, Natarajan K, Teo CP. Models for minimax stochastic linear optimization problems with risk aversion. Math. Oper. Res. (2010) 35(3):580–602Link, Google Scholar
• Carlsson JG. Dividing a territory among several vehicles. INFORMS J. Comput. (2012) 24(4):565–577Link, Google Scholar
• Carlsson JG, Devulapalli R. Dividing a territory among several facilities. INFORMS J. Comput. (2012) . ePub ahead of print December 20, http://dx.doi.org/10.1287/ijoc.1120.0536Link, Google Scholar
• Carlsson JG, Ge D, Subramaniam A, Ye Y. Solving the min-max multi-depot vehicle routing problem. Proc. 2007 Fields Inst. Workshop on Global Optim. (2007) (American Mathematical Society, Providence, RI) Google Scholar
• Delage E, Ye Y. Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. (2010) 58(3):595–612Link, Google Scholar
• Golden BL. A statistical approach to the TSP. Networks (1977) 7(3):209–225Crossref, Google Scholar
• Grant M, Boyd S. CVX: Matlab software for disciplined convex programming, version 1.2.1. (2011) . CVX Research Inc., http://cvxr.com/cvxGoogle Scholar
• Haugland D, Ho SC, Laporte G. Designing delivery districts for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. (2007) 180(3):997–1010Crossref, Google Scholar
• Kwon O, Golden B, Wasil E. Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks. Comput. Oper. Res. (1995) 22(10):1039–1046Crossref, Google Scholar
• Pavone M, Bisnik N, Frazzoli E, Isler V. Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience. Proc. 1st Internat. Conf. Robot Comm. Coordination, RoboComm '07 (2007) (IEEE Press, Piscataway, NJ) 24:1–24:8Crossref, Google Scholar
• Sapkota S, Kohl HW, Gilchrist J, McAuliffe J, Parks B, England B, Flood T, et al. Unauthorized border crossings and migrant deaths: Arizona, New Mexico, and El Paso, Texas, 2002–2003. Amer. J. Public Health (2006) 96(7):1282–1287Crossref, Google Scholar
• Snyder TL, Steele JM. Equidistribution in all dimensions of worst-case point sets for the traveling salesman problem. SIAM J. Discrete Math. (1995) 8(4):678–683Crossref, Google Scholar
• Steele JM. Subadditive Euclidean functionals and nonlinear growth in geometric probability. Ann. Probab. (1981) 9:365–376Crossref, Google Scholar
• Sungur I, Ordez F, Dessouky M. A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans. (2008) 40(5):509–523Crossref, Google Scholar
• Taillard É. Parallel iterative search methods for vehicle routing problems. Networks (1993) 23(8):661–673Crossref, Google Scholar
• Tütüncü RH, Toh KC, Todd MJ. Solving semidefinite-quadratic-linear programs using SDPT3. Math. Programming (2003) 95:189–217Crossref, Google Scholar