Selective multi-depot vehicle routing problem with pricing

Transportation Research Part C: Emerging Technologies

Volumn 19, Issue 5, 2011, Pages 866-884

  Aras, Necati ^a   Aksen, Deniz ^b   Tuǧrul Tekin, Mehmet ^a  

^a BOGAZICI UNIVERSITY   (Turkey)

^b KOÇ UNIVERSITY   (Turkey)

Author keywords

Collection; Pricing; Reverse logistics; Selective multi depot vehicle routing; Tabu Search

Indexed keywords

COSTS; FLEET OPERATIONS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROFITABILITY; REFUSE COLLECTION; TABU SEARCH; VEHICLES;

ACQUISITION PRICE; CAPACITATED VEHICLES; COMMERCIAL SOLVERS; MIXED INTEGER LINEAR PROGRAMMING MODEL; MULTI DEPOTS; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; RESERVATION PRICE; REVERSE LOGISTICS;

VEHICLE ROUTING;

LINEAR PROGRAMING; LOGISTICS; NUMERICAL MODEL; ROAD PRICING; ROUTING; TRANSPORT VEHICLE; TRANSPORTATION PLANNING; PRICE DYNAMICS; TRANSPORTATION DEVELOPMENT;

EID: 79955945367     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2010.08.003     Document Type: Article

References (27)

1. Akçali{dotless} E., Çetinkaya S., Üster H. Network design for reverse and closed-loop supply chains: an annotated bibliography of models and solution approaches. Networks 2009, 53(3):231-248.
2. Aksen D., Aras N., Karaarslan A.G. Design and analysis of government subsidized collection systems for incentive-dependent returns. International Journal Production Economics 2009, 119(2):308-322.
3. Al-Khayyal F.A., Falk J.E. Jointly constrained biconvex programming. Mathematics of Operations Research 1983, 8(2):273-286.
4. Aras N., Boyaci{dotless} T., Verter V. Designing the reverse logistics network. Closed Loop Supply Chains: New Developments to Improve the Sustainability of Business Practices 2010, 67-97. CRC Press. M.E. Ferguson, G.C. Souza (Eds.).
5. Aras N., Aksen D. Locating collection centers for distance and incentive-dependent returns. International Journal Production Economics 2008, 111(2):316-333.
6. Aras N., Aksen D., Tanuǧur A.G. Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles. European Journal of Operational Research 2008, 191(3):1223-1240.
7. Archetti C., Hertz A., Speranza M.G. Metaheuristics for the team orienteering problem. Journal of Heuristics 2007, 13(1):49-76.
8. Archetti C., Feillet D., Hertz A., Speranza M.G. The capacitated team orienteering and profitable tour problems. Journal of the Operational Research Society 2009, 60(6):831-842.
9. Beullens P., Oudheusden D.V., Van Wassenhove L.N. Collection and vehicle routing issues in reverse logistics. Reverse Logistics: Quantitative Models for Closed-loop Supply Chains 2004, 95-134. Springer Verlag, Berlin. R. Dekker, M. Fleischmann, K. Inderfurth, L.N. Van Wassenhove (Eds.).
10. Boussier S., Feillet D., Gendreau M. An exact algorithm for team orienteering problems. 4OR 2007, 5(3):211-230.
11. Boyaci, T., Verter, V., Toyasaki, F., Wojanowski, R., 2008. Collection System Design, Strategy Choice and Financial Incentives for Product Recovery. Working Paper. Desautels Faculty of Management, McGill University.
12. Butt S.E., Cavalier T. A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 1994, 21(1):101-111.
13. Butt S.E., Ryan D.M. An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers and Operations Research 1999, 26(4):427-441.
14. Chao I., Golden B., Wasil E. The team orienteering problem. European Journal of Operational Research 1996, 88(3):464-474.
15. Cordeau J.F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 1997, 30(2):105-119.
16. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 1991, 10:27-36.
17. Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits. Transportation Science 2005, 39(2):188-205.
18. Gavish, B., Graves, S.C., 1978. The Traveling Salesman Problem and Related Problems. Working Paper GR-078-78. Operations Research Center, Massachusetts Institute of Technology.
19. Gueguen, C., 1999. Méthodes de résolution exacte pour les problèmes de tournées de véhicules. Thése de doctorat, école Centrale Paris.
20. Guide V.D.R., Teunter R., van Wassenhove L.N. Matching demand and supply to maximize profits from remanufacturing. Manufacturing and Service Operations Management 2003, 5(4):303-316.
21. Kara I., Laporte G., Bektaş T. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research 2004, 158(3):793-795.
22. Ke L., Archetti C., Feng F. Ants can solve the team orienteering problem. Computers & Industrial Engineering 2008, 54(3):648-665.
23. Lenstra J.K., Rinnooy Kan A.H.G. Complexity of vehicle routing and scheduling problems. Networks 1981, 11(2):221-227.
24. Ray S., Boyaci{dotless} T., Aras N. Optimal prices and trade-in rebates for durable, remanufacturable products. Manufacturing and Service Operations Management 2005, 7(3):208-228.
25. Renaud J., Laporte G., Boctor F.F. A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research 1996, 23(3):229-235.
26. Tang H., Miller-Hooks E. A tabu search heuristic for the team orienteering problem. Computers & Operations Research 2005, 32(6):1379-1407.
27. Vansteenwegen P., Souffriau W., Berghe G.V., Van Oudheusden D. A guided local search metaheuristic for the team orienteering problem. European Journal of Operational Research 2009, 196(1):118-127.