Route selection for best distances in road databases based on drivers' and customers' preferences

Canadian Journal of Forest Research

Volumn 42, Issue 6, 2012, Pages 1126-1140

  Flisberg, P ^a   Liden B ^a   Ronnqvist M ^b   Selander, J ^c  

^a THE FORESTRY RESEARCH INSTITUTE OF SWEDEN   (Sweden)

^b UNIVERSITÉ LAVAL   (Canada)

^c SDC   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DAILY USE; DISTANCE CALCULATION; MIXED INTEGER PROGRAMMING MODEL; NATIONAL ROADS; OPTIMIZATION MODELS; ROUTE SELECTION; SHORTEST PATH; SHORTEST PATH PROBLEM; SPEED LIMIT;

COMPUTER PROGRAMMING; DATABASE SYSTEMS; FORESTRY; GRAPH THEORY; TIMBER;

ROADS AND STREETS;

DATABASE; FORESTRY MODELING; OPTIMIZATION; ROAD; TRANSPORTATION SYSTEM;

COMPUTER PROGRAMING; FORESTRY; FORESTS; ROADS;

SWEDEN;

EID: 84862139452     PISSN: 00455067     EISSN: 12086037     Source Type: Journal    
DOI: 10.1139/X2012-063     Document Type: Article

References (22)

1. Ahuja, R.K., and Orlin, J.B. 2001. Inverse optimization. Oper. Res. 49(5): 771-783. doi:10.1287/opre.49.5.771.10607.
2. Ahuja, R.K., Mehlhorn, K., Orlin, J.B., and Tarjan, R.E. 1990. Faster algorithms for the shortest path problem. J. ACM, 37(2): 213-223. doi:10.1145/77600.77615.
3. Akay, A.E., Wing, M.G., Sivrikaya, F., and Sakar, D. 2012. A GISbased decision support system for determining the shortest and safest route to forest fires: a case study in Mediterranean Region of Turkey. Environ. Monit. Assess. 184(3): 1391-1407. doi:10.1007/s10661-011-2049-z. PMID:21509512.
4. Andersson, G., Flisberg, P., Liden, B., and Rönnqvist, M. 2008. RuttOpt - a decision support system for routing of logging trucks. Can. J. For. Res. 38(7): 1784-1796. doi:10.1139/X08-017.
5. Apaydin, O., and Gonullu, M.T. 2008. Emission control with route optimization in solid waste collection process: a case study. Sadhana Acad. Proc. Eng. Sci. 33(2): 71-82.
6. Bertsekas, D.P. 1998. Shortest path problems, network optimization: continuous and discrete models. Chapter 2. In Network optimization: continuous and discrete models. Athena Scientific, Belmont, Massachusetts.
7. Bley, A. 2007. Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks, 50(1): 29-36. doi:10.1002/net.20163.
8. Broström, P., and Holmberg, K. 2008. Valid cycles: a source of infeasibility in open shortest path first routing. Networks, 52(4): 206-215. doi:10.1002/net.20232.
9. Burton, D., Pulleyblank, W.R., and Toint, P.L. 1997. The inverse shortest paths problem with upper bounds on shortest paths costs. In Network optimization - lecture notes in economics and mathematical systems. Edited by P.M. Pardalos, D.W. Hearn, and W.W. Hager. Springer. pp. 156-171.
10. Carlsson, D., and Rönnqvist, M. 2007. Backhauling in forest transportation: models, methods and practical usage. Can. J. For. Res. 37(12): 2612-2623. doi:10.1139/X07-106.
11. Cherkassky, B.V., Goldberg, A.V., and Silverstein, C. 1999. Buckets, heaps, lists, and monotone priority queues. SIAM J. Comput. 28(4): 1326-1346. doi:10.1137/S0097539796313490.
12. D'Amours, S., Rönnqvist, M., and Weintraub, A. 2008. Using operational research for supply chain planning in the forest product industry. INFOR, 46(4): 47-64.
13. Denardo, E.V., and Fox, B.L. 1979. Shortest-route methods: 1. Reaching, pruning, and buckets. Oper. Res. 27(1): 161-186. doi:10.1287/opre.27.1.161.
14. Devlin, G.J., McDonnell, K., and Ward, S. 2008. Timber haulage routing in Ireland: an analysis using GIS and GPS. J. Transp. Geogr. 16(1): 63-72. doi:10.1016/j.jtrangeo.2007.01.008.
15. Eppstein, D. 2003. Setting parameters by example. SIAM J. Comput. 32(3): 643-653. doi:10.1137/S0097539700370084.
16. Gódor, I., Harmatos, J., and Juttner, A. 2005. Inverse shortest path algorithms in protected UMTS access networks. Comput. Commun. 28(7): 765-772. doi:10.1016/j.comcom.2004.10.011.
17. Heuberger, C. 2004. Inverse combinatorial optimization: a survey on problems, methods, and results. J. Comb. Optim. 8(3): 329-361.doi:10.1023/B:JOCO.0000038914.26975.9b.
18. Martin, A.M., Owende, P.M.O., Holden, N.M., Ward, S.M., and O'Mahony, M.J. 2001. Designation of timber extraction routes in a GIS using road maintenance cost data. For. Prod. J. 51(10): 32-38.
19. Rönnqvist, M. 2012. OR challenges and experiences from solving industrial applications. Int. Trans. Oper. Res. 19(1-2): 227-251. doi:10.1111/j.1475-3995.2011.00801.x.
20. Su, J.G., Winters, M., Nunes, M., and Brauer, M. 2010. Designing a route planner to facilitate and promote cycling in Metro Vancouver, Canada. Transp. Res. Part A Policy Pract. 44(7): 495-505. doi:10.1016/j.tra.2010.03.015.
21. Verter, V., and Kara, B.Y. 2008. A path-based approach for hazmat transport network design. Manage. Sci. 54(1): 29-40. doi:10.1287/mnsc.1070.0763.
22. Zeng, W., and Church, R.L. 2009. Finding shortest paths on real road networks: the case for A*. Int. J. Geogr. Inf. Sci. 23(4): 531-543. doi:10.1080/13658810801949850.