Arc-Routing Models for Small-Package Local Routing

References

• Assad A. A., Golden B. L., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Arc routing methods and applications. Handbooks in Operations Research and Management Science (1995) 8(Elsevier, Amsterdam) 375–483Google Scholar
• Bertsimas D., Howell L. Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. (1993) 65:68–95Crossref, Google Scholar
• Bertsimas D., Jaillet P., Odoni A. A priori optimization. Oper. Res. (1990) 38:1019–1033Link, Google Scholar
• Bianchi L., Knowles J., Bowler N. Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms. Eur. J. Oper. Res. (2005) 162:206–219Crossref, Google Scholar
• Campbell A. Aggregation for the probabilistic traveling salesman problem. Comput. Oper. Res. (2006) 33:2703–2724Crossref, Google Scholar
• Campbell A., Thomas B., Golden B., Raghavan R., Wasil E. Challenges and advance in a priori routing. The Vehicle Routing Problem: Latest Advances and Challenges (2007) (Springer, New York) Google Scholar
• Campbell A., Thomas B. Probabilistic traveling salesman problem with deadlines. Transportation Sci. (2008) 42:1–21Link, Google Scholar
• Corberan A., Mart R., Romero A. Heuristics for the mixed rural postman problem. Comput. Oper. Res. (2000) 27:183–203Crossref, Google Scholar
• Eiselt H. A., Gendreau M., Laporte G. Arc routing problems, part II: The rural postman problem. Oper. Res. (1995) 43:399–414Link, Google Scholar
• Helsgaun K. An effective implementation of the Lin-Kernighan travelling salesman heuristic. Eur. J. Oper. Res. (2000) 126:106–130Crossref, Google Scholar
• Jaillet P. The probabilistic travelling salesman problem. (1985) . Technical Report 185, Operation Research Center, MIT, Cambridge, MAGoogle Scholar
• Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. (1988) 36:929–936Link, Google Scholar
• Kleywegt A. J., Shapiro A., Homem-de-Mello T. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. (2002) 12:479–502Crossref, Google Scholar
• Laporte G. Modeling and solving several classes of arc routing problems as traveling salesman problems. Comput. Oper. Res. (1997) 24:1057–1061Crossref, Google Scholar
• Laporte G., Louveaux F. V., Mercure H. A priori optimization of the probabilistic traveling salesman problem. Oper. Res. (1994) 42:543–549Link, Google Scholar
• Linderoth J., Shapiro A., Wright S. The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. (2006) 142:215–241Crossref, Google Scholar
• Liu Y. A hybrid scatter search for the probablistic traveling salesman problem. Comput. Oper. Res. (2007) 34:2949–2963Crossref, Google Scholar
• Mak W. K., Morton D. P., Wood R. K. Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. (1999) 24:47–56Crossref, Google Scholar
• Mohan S., Gendreau M., Rousseau J. Heuristics for the stochastic Eulerian tour problem. (2007) . Working paper, CIRRELT, University of Montréal, CanadaGoogle Scholar
• Mohan S., Gendreau M., Rousseau J. The stochastic Eulerian tour problem. Transportation Sci. (2008) 42:166–174Link, Google Scholar
• Shapiro A., Philpott A. A tutorial on stochastic programming. (2007) . Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, AtlantaGoogle Scholar
• Verweij B., Ahmed S., Kleywegt A. J., Nemhauser G., Shapiro A. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. (2003) 24:289–333Crossref, Google Scholar
• Wong R., Golden B., Raghavan R., Wasil E. Vehicle routing for small package delivery and pickup services. The Vehicle Routing Problem: Latest Advances and Challenges (2008) (Springer, New York) Crossref, Google Scholar