An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines

Transportation Science

Volumn 50, Issue 3, 2016, Pages 1077-1091

  Van Anholt, Roel G ^a   Coelho, Leandro C ^b   Laporte, Gilbert ^c   Vis, Iris F A ^d  

^a VU University   (Netherlands)

^b UNIVERSITÉ LAVAL   (Canada)

^c HEC MONTRÉAL   (Canada)

^d UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Branch and cut; Clustering; Exact algorithm; Inventory management; Inventory routing; Pickup and delivery; Recirculation automated teller machines; Vehicle routing

Indexed keywords

AUTOMATION; CLUSTERING ALGORITHMS; INVENTORY CONTROL; PICKUPS; SALES; VEHICLE ROUTING;

AUTOMATED TELLER MACHINES; BRANCH AND CUT; CLUSTERING; EXACT ALGORITHMS; INVENTORY MANAGEMENT; INVENTORY ROUTING; PICKUP AND DELIVERY;

INTEGER PROGRAMMING;

EID: 84984903735     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2015.0637     Document Type: Article

References (57)

1. ABN ARMO Bank (2013) https://extra.abnamro.nl/maps/index-new.php.
2. Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37(9):1515-1536.
3. Angelelli E, Mansini R (2002) The vehicle routing problem with time windows and simultaneous pick-up and delivery. Klose A, Speranza MG, Van Wassenhove LN, eds. Quantitative Approaches to Distribution Logistics and Supply Chain Management, Lecture Notes Econom. Math. Systems, Vol. 519 (Springer-Verlag, Berlin Heidelberg), 249-267.
4. Anily S, Hassin R (1992) The swapping problem. Networks 22(4):419-433.
5. Anily S, Gendreau M, Laporte G (2011) The preemptive swapping problem on a tree. Networks 58(2):83-94.
6. Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24(1):101-116.
7. Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) Branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Sci. 41(3):382-391.
8. Baldacci R, Hadjiconstantinou E, Mingozzi A (2003) An exact algorithm for the traveling salesman problem with deliveries and collections. Networks 42(1):26-41.
9. Benchimol M, Benchimol P, Chappert B, De La Taille A, Laroche F, Meunier F, Robinet L (2011) Balancing the stations of a self-service bike hire system. RAIRO-Oper. Res. 45(1):37-61.
10. Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15(1):1-31.
11. Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. 34(2):578-594.
12. Chemla D, Meunier F, Wolfler Calvo R (2013) Bike sharing systems: Solving the static rebalancing problem. Discrete Optim. 10(2):120-146.
13. Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: Status and perspectives. Transportation Sci. 38(1):1-18.
14. Christiansen M, Fagerholt K, Nygreen B, Ronen D (2013) Ship routing and scheduling in the new millennium. Eur. J. Oper. Res. 228(3):467-483.
15. Christiansen M, Fagerholt K, Flatberg T, Haugen Ø, Kloster O, Lund EH (2011) Maritime inventory routing with multiple products: A case study from the cement industry. Eur. J. Oper. Res. 208(1):86-94.
16. Coelho LC, Laporte G (2013a) The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2):558-565.
17. Coelho LC, Laporte G (2013b) A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Internat. J. Production Res. 51(23-24):7156-7169.
18. Coelho LC, Laporte G (2014) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Internat. J. Production Econom. 155(1):391-397.
19. Coelho LC, Cordeau J-F, Laporte G (2012) The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11):2537-2548.
20. Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory-routing. Transportation Sci. 48(1):1-19.
21. Contardo C, Morency C, Rousseau L-M (2012) Balancing a dynamic public bike-sharing system. Technical report CIRRELT-2012-09, Montréal.
22. Cordeau J-F, Laporte G (2007) The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. 153(1):29-46.
23. Dantzig GB, Fulkerson DR, Johnson SM (1954) Solution of a large-scale traveling-salesman problem. Oper. Res. 2(4):393-410.
24. Dauzère-Pérès S, Nordli A, Olstad A, Haugen K, Koester U, Olav MP, Teistklub G, Reistad A (2007) Omya Hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 37(1):39-51.
25. Dell'Amico M, Righini G, Salani M (2006) A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Sci. 40(2):235-247.
26. Dell'Amico M, Hadjicostantinou E, Iori M, Novellani S (2014) The bike sharing rebalancing problem: Mathematical formulations and benchmark instances. Omega 45:7-19.
27. Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, Soumis F (2002) Vehicle routing problem with pickup and delivery. Toth P, Vigo D, eds. The Vehicle Routing Problem, Monographs Discrete Math. Appl., Vol. 9 (SIAM, Philadelphia), 225-242.
28. ECB (2013) ATM cash deposits at terminals located in the country with cards issued in the country. Technical report DA12, European Central Bank, http://sdw.ecb.europa.eu/.
29. Eilon S, Watson-Gandy CDT, Christofides N (1971) Distribution Management: Mathematical Modeling and Practical Analysis (Griffin, London).
30. Erdoǧan G, Laporte G, Cordeau J-F (2010) A branch-and-cut algorithm for the non-preemptive capacitated swapping problem. Discrete Appl. Math. 158(15):1599-1614.
31. Erdoǧan G, Laporte G, Wolfler Calvo R (2014) The static bicycle relocation problem with demand intervals. Eur. J. Oper. Res. 238(2):451-457.
32. Erdoǧan G, Battarra M, Laporte G, Vigo D (2012) Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. Comput. Oper. Res. 39(5):1074-1086.
33. Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper. Res. 45(4):568-576.
34. Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26(7):699-714.
35. Geofabrik GmbH, OpenStreetMap Contributors (2013) Openstreet-map Netherlands shapefile. http://download.geofabrik.de/europe/netherlands-latest.shp.zip.
36. Gribkovskaia I, Halskau Ø, Laporte G, Vlček M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 180(2):568-584.
37. Hernández-Pérez H, Salazar-González J-J (2003) The one-commodity pickup-and-delivery traveling salesman problem. Jünger M, Reinelt G, Rinaldi G, eds. Combinatorial Optimization - Eureka, You Shrink!, Lecture Notes Comput. Sci., Vol. 2570 (Springer-Verlag, Berlin Heidelberg), 89-104.
38. Hernández-Pérez H, Salazar-González J-J (2004a) A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 145(1):126-139.
39. Hernández-Pérez H, Salazar-González J-J (2004b) Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Sci. 38(2):245-255.
40. Hernández-Pérez H, Salazar-González J-J (2007) The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks 50(4):258-272.
41. Hoff A, Gribkovskaia I, Laporte G, Løkketangen A (2009) Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 192(3):755-766.
42. ING Bank (2013) https://www.ing.nl/particulier/klantenservice/bankzaken-beginnen-of-beeindigen/geldautomaat-of-kantoor-zoeken/index.html.
43. Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization.Aarts EHL, Lenstra JK, eds. Local Search in Combinatorial Optimization (Princeton University Press, Princeton, NJ), 215-310.
44. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. Assoc. Comput. Machinery 7(4):326-329.
45. Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Res. Part A: General 23(5):377-386.
46. Mosheiov G (1994) The travelling salesman problem with pick-up and delivery. Eur. J. Oper. Res. 79(2):299-310.
47. Rabobank (2013) https://www.rabobank.nl/particulieren/servicemenu/naaruwbank/.
48. Rakke JG, Stålhane M, Moe CR, Christiansen M, Andersson H, Fagerholt K, Norstad I (2011) A rolling horizon heuristic for creating a liquefied natural gas annual delivery program. Transportation Res. Part C: Emerging Tech. 19(5):896-911.
49. Raviv T, Tzur M, Forma IA (2013) Static repositioning in a bike-sharing system: Models and solution approaches. Eur. J. Transportation Logist. 2(3):187-229.
50. Retail Banking Research Ltd. (RBR) (2014) Deposit automation and recycling. Technical report, RBR, London. http://www.rbrlondon.com/about/DA14-Press-Release-221214.pdf.
51. Shu J, Chou MC, Liu Q, Teo C-P, Wang I-L (2013) Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems. Oper. Res. 61(6):1346-1359.
52. Subramanian A, Battarra M (2013) An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. J. Oper. Res. Soc. 64(3):402-409.
53. Subramanian A, Drummond LMA, Bentes C, Ochi LS, Farias R (2010) A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11):1899-1911.
54. Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4):333-346.
55. Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1):475-489.
56. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2010) An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. Eur. J. Oper. Res. 202(2):401-411.
57. Zhao F, Li S, Sun J, Mei D (2009) Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Indust. Engrg. 56(4):1642-1648.