The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach

European Journal of Operational Research

Volumn 220, Issue 2, 2012, Pages 295-304

  Zhang, Zizhen ^a   Qin, Hu ^b   Zhu, Wenbin ^c   Lim, Andrew ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Branch and bound; Toll by weight; Vehicle routing problem

Indexed keywords

BRANCH AND BOUND METHOD; VEHICLE ROUTING; VEHICLES;

BRANCH-AND-BOUND ALGORITHMS; BRANCH-AND-BOUND APPROACHES; JIANGXI PROVINCE; LOWER BOUNDS; TOLL-BY-WEIGHT; TRANSPORTATION SYSTEM; VEHICLE ROUTING PROBLEMS; WEIGHT SCHEMES;

PROBLEM SOLVING;

EID: 84862783010     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.01.035     Document Type: Article

References (26)

1. Applegate, D. L., Bixby, R. E., Chvátal, V., Cook, W. J., 2006. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, New Jersey.
2. Archer, A., Levin, A., Williamson, D. P., 2008. A faster, better approximation algorithm for the minimum latency problem. SIAM Journal on Computing 37(5), 1472-1498.
3. Arora, S., Karakostas, G., 2003. Approximation schemes for minimum latency problems. SIAM Journal on Computing 32(5), 1317-1337.
4. Azi, N., Gendreau, M., Potvin, J.-Y., 2010. An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research 202(3), 756-763.
5. Bianco, L., Mingozzi, A., Ricciardelli, S., 1993. The traveling salesman problem with cumulative costs. Networks 23(2), 81-91.
6. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M., 1994. The minimum latency problem. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC'94), Montréal, Québec, Canada, pp. 163-171.
7. Chen, X., Li, J., Yang, F., Wu, Y. H., Ding, L. B., 2007. Design and implementation of vehicle routing optimization system based on toll-by-weight. Manufacture Information Engineering of China 17, 69-72.
8. Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M. M., 1995. An optimal algorithm for the traveling salesman problem with time windows. Operations Research 43(2), 367-371.
9. Fischetti, M., Laporte, G., Martello, S., 1993. The delivery man problem and cumulative matroids. Operations Research 41(6), 1055-1064.
10. Fischetti, M., Toth, P., 1988. A new dominance procedure for combinatorial optimization problems. Operations Research Letters 7(4), 181-187.
11. Fliedner, M., Boysen, N., 2008. Solving the car sequencing problem via branch & bound. European Journal of Operational Research 191(3), 1023-1042. (Pubitemid 351778628)
12. García, A., Jodrá, P., Tejel, J., 2002. A note on the traveling repairman problem. Networks 40(1), 27-31. (Pubitemid 37218348)
13. Goemans, M., Kleinberg, J., 1998. An improved approximation ratio for the minimum latency problem. Mathematical Programming 82(1-2), 111-124. (Pubitemid 128401583)
14. Gross, J. L., Yellen, J. (Eds.), 2005. Graph Theory and Its Applications. Chapman and Hall/CRC.
15. Gutin, G., Punnen, A. P. (Eds.), 2002. The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht, Netherlands.
16. Hall, P., 1935. On representatives of subsets. Journal of the London Mathematical Society 10, 26-30.
17. Hardy, G., Littlewood, J., Pólya, G., 1988. Inequalities. Cambridge University Press, The Edinburgh Building, Cambridge, UK.
18. Méndez-Díaz, I., Zabala, P., Lucena, A., 2008. A new formulation for the traveling deliveryman problem. Discrete Applied Mathematics 156(17), 3223-3237.
19. Mingozzi, A., Bianco, L., Ricciardelli, S., 1997. Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints. Operations Research 45(3), 365-377. (Pubitemid 127684715)
20. Minieka, E., 1989. The delivery man problem on a tree network. Annals of Operations Research 18(1-4), 261-266.
21. Reinelt, G., 1991. TSPLIB - traveling salesman problem library. ORSA Journal of Computing 3(4), 376-384.
22. Salehipour, A., Sörensen, K., Goos, P., Bräysy, O., 2008. An efficient GRASP+VND metaheuristic for the traveling repairman problem. Working Papers, University of Antwerp, Faculty of Applied Economics. URL
23. Shen, C. H., Qin, H., Lim, A., 2009. A capacitated vehicle routing problem with toll-by-weight rule. In: Chien, B. C., Hong, T. P. (Eds.), Opportunities and Challenges for Next-Generation Applied Intelligence, Studies in Computational Intelligence, vol. 214. Springer, Berlin, Heidelberg, pp. 311-316.
24. Toth, P., Vigo, D. (Eds.), 2002. The Vehicle Routing Problem. SIAM, Philadelphia, PA.
25. Wikipedia, 2011. Expressways of China.
26. Wu, B. Y., Huang, Z. N., Zhan, F. J., 2004. Exact algorithms for the minimum latency problem. Information Processing Letters 92(6), 303-309.