Improving the efficiency of stochastic vehicle routing: A partial lagrange multiplier method

IEEE Transactions on Vehicular Technology

Volumn 65, Issue 6, 2016, Pages 3993-4005

  Cao, Zhiguang ^a   Guo, Hongliang ^b   Zhang, Jie ^b   Niyato, Dusit ^b   Fastenrath, Ulrich ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c BMW GROUP   (Germany)

Author keywords

mixed integer linear programming; partial Lagrange multiplier; stochastic vehicle routing; total unimodularity

Indexed keywords

BRANCH AND BOUND METHOD; COMPLEX NETWORKS; EFFICIENCY; GRAPH THEORY; INTEGER PROGRAMMING; MATRIX ALGEBRA; MOTOR TRANSPORTATION; NAVIGATION SYSTEMS; NETWORK ROUTING; OPTIMIZATION; ROADS AND STREETS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TRANSPORTATION; VEHICLES;

COMPUTATION INEFFICIENCY; EXPONENTIAL COMPUTATION; LAGRANGE MULTIPLIER METHOD; MIXED INTEGER LINEAR PROGRAMMING; OPTIMAL INTEGER SOLUTION; STOCHASTIC SHORTEST PATH PROBLEM; STOCHASTIC VEHICLE ROUTING; TOTAL UNIMODULARITY;

LAGRANGE MULTIPLIERS;

EID: 84976467136     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2015.2480964     Document Type: Article

References (45)

1. 1.7 Billion Cars on the Road by 2035, LeBeau Phil, 2012. [Online]. Available: Http://www.cnbc.com/id/49796736
2. D. Schrank, B. Eisele, and T. Lomax, "Ttis 2012 urban mobility report," in Proc. Annu. Urban Mobility Rep. Texas A&M Transp. Inst., College Station, TX, USA, 2012, pp. 18-20.
3. Yahoo News, "Where are the busiest roads in Singapore?" 2012. [Online]. Available: Https://sg.news.yahoo.com/blogs/fit-to-post-autos/where-busiest-roads-singapore-005656369.html
4. Y. Fan and Y. Nie, "Optimal routing for maximizing the travel time reliability," Netw. Spatial Econ., vol. 6, no. 3, pp. 333-344, Sep. 2006.
5. S. Lim, C. Sommer, E. Nikolova, and D. Rus, "Practical route planning under delay uncertainty: Stochastic shortest path queries," Robotics, pp. 249-251, 2013.
6. J. Pan, I. S. Popa, K. Zeitouni, and C. Borcea, "Proactive vehicular traffic rerouting for lower travel time," IEEE Trans. Veh. Technol., vol. 62, no. 8, pp. 3551-3568, Oct. 2013.
7. G. Isaac and T. Lange, "Split routing as a part of the urban navigation," in Proc. 19th Intell. Transp. Syst. World Congr., 2012, pp. 1-8.
8. Y. Pan, L. Sun, and M. Ge, "Finding reliable shortest path in stochastic time-dependent network," Procedia-Social Behavioral Sci., vol. 96, pp. 451-460, Nov. 2013.
9. H. Guo, Z. Cao, J. Zhang, D. Niyato, and U. Fastenrath, "Routing multiple cars in large scale networks: Minimizing road network breakdown probability," in Proc. IEEE 17th Int. Conf. ITSC, 2014, pp. 2180-2187.
10. Z. Cao, H. Guo, J. Zhang, D. Niyato, and U. Fastenrath, "A data-driven method for stochastic shortest path problem," in Proc. 17th IEEE Int. Conf. ITSC, 2014, pp. 1045-1052.
11. E. D. Miller-Hooks and H. S. Mahmassani, "Least expected time paths in stochastic, time-varying transportation networks," Transp. Sci., vol. 34, no. 2, pp. 198-215, 2000.
12. R. W. Hall, "The fastest path through a network with random timedependent travel times," Transp. Sci., vol. 20, no. 3, pp. 182-188, Aug. 1986.
13. E. Nikolova, M. Brand, and D. R. Karger, "Optimal route planning under uncertainty," in Proc ICAPS, vol. 6, 2006, pp. 131-141.
14. Y. Fan, R. Kalaba, and J. Moore II, "Arriving on time," J. Optim. Theory Appl., vol. 127, no. 3, pp. 497-513, Dec. 2005.
15. E. Nikolova, J. A. Kelner, M. Brand, and M. Mitzenmacher, "Stochastic shortest paths via quasi-convex maximization," in Proc. ESA, 2006, pp. 552-563.
16. S. Lim, H. Balakrishnan, D. Gifford, S. Madden, and D. Rus, "Stochastic motion planning and applications to traffic," in Algorithmic Foundation of Robotics VIII. New York, NY, USA: Springer-Verlag, 2009, pp. 483-500.
17. J. Cheng, S. Kosuch, and A. Lisser, "Stochastic shortest path problem with uncertain delays," in Proc. ICORES, 2012, pp. 256-264.
18. R. E. Korf, "Research challenges in combinatorial search.," in Proc. 26th AAAI Conf. Artif. Intell., 2012, pp. 2129-2133.
19. D. C. Parkes and L. H. Ungar, "Iterative combinatorial auctions: Theory and practice," in Proc. 17th AAAI Conf. Artif. Intell., 2000, pp. 74-81.
20. T. Sandholm, A. Gilpin, and V. Conitzer, "Mixed-integer programming methods for finding nash equilibria," in Proc. 28th AAAI Conf. Artif. Intell., 2005, pp. 495-501.
21. E. Santos, Jr., and E. S. Santos, "Polynomial solvability of cost-based abduction," Artif. Intell., vol. 86, no. 1, pp. 157-170, Sep. 1996.
22. I. J. Lustig, R. E. Marsten, and D. F. Shanno, "Computational experience with a primal-dual interior point method for linear programming," Linear Algebra Appl., vol. 152, pp. 191-222, Jul. 1991.
23. A. Faye and F. Roupin, "Partial lagrangian relaxation for general quadratic programming," 4OR, vol. 5, no. 1, pp. 75-88, Apr. 2007.
24. S. Boyd, "l1-norm methods for convex cardinality problems," in Lecture Notes for EE364b. Stanford, CA, USA: Stanford Univ., 2007. [Online]. Available: Http://www.stanford.edu/class/ee364b
25. B. Bonet, "An admissible heuristic for sas+ planning obtained from the state equation," in Proc. 23rd IJCAI, 2013, pp. 2268-2274.
26. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2009.
27. D. Schuurmans, F. Southey, and R. C. Holte, "The exponentiated subgradient algorithm for heuristic boolean programming," in Proc. 17th IJCAI, 2001, pp. 334-341.
28. R. Naz, F. Mahomed, and D. Mason, "Conservation laws via the partial lagrangian and group invariant solutions for radial and two-dimensional free jets," Nonlinear Anal.: Real World Appl., vol. 10, no. 6, pp. 3457-3465, Dec. 2009.
29. C. P. Gomes, "Structure, duality, and randomization: Common themes in AI and OR," in Proc. 17th AAAI Conf. Artif. Intell., 2000, pp. 1152-1158.
30. O. Sumer, U. A. Acar, A. T. Ihler, and R. R. Mettu, "Fast parallel and adaptive updates for dual-decomposition solvers," in Proc. 25th AAAI Conf. Artif. Intell., 2011, pp. 1076-1082.
31. F. Barahona and R. Anbil, "The volume algorithm: Producing primal solutions with a subgradient method," Math. Program., vol. 87, no. 3, pp. 385-399, May 2000.
32. J.-L. Goffin and K. C. Kiwiel, "Convergence of a simple subgradient level method," Math. Program., vol. 85, no. 1, pp. 207-211, May 1999.
33. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis, II, "An analysis of several heuristics for the traveling salesman problem," SIAM J. Comput., vol. 6, no. 3, pp. 563-581, 1977.
34. K. R. Rebman, "Total unimodularity and the transportation problem: A generalization," Linear Algebra Appl., vol. 8, no. 1, pp. 11-24, Feb. 1974.
35. M. Grant, S. Boyd, and Y. Ye, Disciplined convex programming. New York, NY, USA: Springer-Verlag, 2006.
36. T. S. Kumar, "Fast (incremental) algorithms for useful classes of simple temporal problems with preferences," in Proc. 20th IJCAI, 2007, pp. 1954-1959.
37. J. Yuan et al., "T-drive: Driving directions based on taxi trajectories," in Proc. 18th SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2010, pp. 99-108.
38. B. Yang, C. Guo, C. S. Jensen, M. Kaul, and S. Shang, "Stochastic skyline route planning under time-varying uncertainty," in Proc. 30th IEEE ICDE, 2014, pp. 136-147.
39. M. Haklay and P. Weber, "Openstreetmap: User-generated street maps," IEEE Pervasive Comput., vol. 7, no. 4, pp. 12-18, Oct.-Dec. 2008.
40. J. Yuan, Y. Zheng, X. Xie, and G. Sun, "Driving with knowledge from the physical world," in Proc. 17th ACM SIGKDD, 2011, pp. 316-324.
41. J. Yuan, Y. Zheng, X. Xie, and G. Sun, "T-drive: Enhancing driving directions with taxi drivers' intelligence," IEEE Trans. Knowledge Data Eng., vol. 25, no. 1, pp. 220-232, Jan. 2013.
42. Y. Wang, Y. Zheng, and Y. Xue, "Travel time estimation of a path using sparse trajectories," in Proc. 20th ACM SIGKDD, 2014, pp. 25-34.
43. R. Geisberger, P. Sanders, D. Schultes, and D. Delling, "Contraction hierarchies: Faster and simpler hierarchical routing in road networks," in Experimental Algorithms. Berlin, Germany: Springer-Verlag, 2008, pp. 319-333.
44. I. Abraham, D. Delling, A. V. Goldberg, and R. F.Werneck, "Hierarchical hub labelings for shortest paths," in Proc. ESA, 2012, pp. 24-35.
45. M. Hua and J. Pei, "Probabilistic path queries in road networks: Traffic uncertainty aware path selection," in Proc. 13th Int. Conf. Extending Database Technol., 2010, pp. 347-358.