Does the Locker Alliance Network Improve Last Mile Delivery Efficiency?
References
- (2006) The Traveling Salesman Problem: A Computational Study, vol. 17 (Princeton University Press, Princeton, NJ).Google Scholar
- (2006) Concorde TSP solver. Accessed August 31, 2024, https://www.math.uwaterloo.ca/tsp/concorde/index.html.Google Scholar
- (1989) The prize collecting traveling salesman problem. Networks 19(6):621–636.Crossref, Google Scholar
- (2011) An exact method for the capacitated location-routing problem. Oper. Res. 59(5):1284–1296.Link, Google Scholar
- (1959) The shortest path through many points. Math. Proc. Cambridge Philos. Soc., vol. 55 (Cambridge University Press, Cambridge, UK), 299–327.Google Scholar
- (2008) The mean distance to the nth neighbour in a uniform distribution of random points: An application of probability theory. Eur. J. Phys. 29(3):639.Crossref, Google Scholar
- (1993) A note on the prize collecting traveling salesman problem. Math. Programming 59(1–3):413–420.Crossref, Google Scholar
- (2018) Coordinated logistics with a truck and a drone. Management Sci. 64(9):4052–4069.Link, Google Scholar
- (2018) Wasserstein distance and the distributionally robust TSP. Oper. Res. 66(6):1603–1624.Link, Google Scholar
- (2005) Logistics Systems Analysis (Springer Science & Business Media, Berlin, Heidelberg).Google Scholar
- (2018) A parcel locker network as a solution to the logistics last mile problem. Internat. J. Production Res. 56(1–2):251–261.Crossref, Google Scholar
- (2009) The impact of failed home deliveries on carbon emissions: Are collection/delivery points environmentally-friendly alternatives. Beresford A, ed. Proc. 14th Annual Logist. Res. Network Conf. (University of Cardiff, Cardiff, Wales), 102–108.Google Scholar
- (2010) Carbon dioxide benefits of using collection–delivery points for failed home deliveries in the United Kingdom. Transportation Res. Record 2191(1):136–143.Crossref, Google Scholar
- (2019) Optimal retail location: Empirical methodology and application to practice. Manufacturing Service Oper. Management 21(1):86–102.Link, Google Scholar
- (2009) Combining approximation algorithms for the prize-collecting TSP. Preprint, submitted October 3, https://arxiv.org/abs/0910.0553.Google Scholar
- (2007) TSP-infrastructure for the traveling salesperson problem. J. Statist. Software 23(2):1–21.Crossref, Google Scholar
- (2020) Smart city operations: Modeling challenges and opportunities. Manufacturing Service Oper. Management 22(1):203–213.Link, Google Scholar
- (2016) Analysis of parcel lockers’ efficiency as the last mile delivery solution—The results of the research in Poland. Transportation Res. Procedia 12:644–655.Crossref, Google Scholar
- (2019) Integrating collection-and-delivery points in the strategic design of urban last-mile e-commerce distribution networks. Transportation Res. Part E Logist. Transportation Rev. 131:37–67.Crossref, Google Scholar
- (2016) Usability of the parcel lockers from the customer perspective—The research in Polish cities. Transportation Res. Procedia 16:272–287.Crossref, Google Scholar
- (2020) Last-mile delivery: Optimal locker location under multinomial logit choice model. Transportation Res. Part E Logist. Transportation Rev. 142:102059.Crossref, Google Scholar
- (2022) Profit-maximizing parcel locker location problem under threshold Luce model. Transportation Res. Part E Logist. Transportation Rev. 157:102541.Crossref, Google Scholar
- (2021) On-time last-mile delivery: Order assignment with travel-time predictors. Management Sci. 67(7):4095–4119.Link, Google Scholar
- (2022) Last mile innovation: The case of the locker alliance network. Manufacturing Service Oper. Management 24(5):2425–2443.Link, Google Scholar
- (2021) A parcel network flow approach for joint delivery networks using parcel lockers. Internat. J. Production Res. 59(7):2090–2115.Crossref, Google Scholar
- (2022) The impact of optimal parcel locker locations on costs and the environment. Internat. J. Physical Distribution Logist. Management 52(4):324–350.Crossref, Google Scholar
- (1998) Scaling universalities of kth-nearest neighbor distances on closed manifolds. Adv. Appl. Math. 21(3):424–436.Crossref, Google Scholar
- (2021) IMDA’s pick network not intended to stifle competition in parcel locker sector: Sim Ann. Accessed December 26, 2023, https://www.businesstimes.com.sg/international/imdas-pick-network-not-intended-stifle-competition-parcel-locker-sector-sim-ann.Google Scholar
- (2018) A review of last mile logistics innovations in an externalities cost reduction vision. Sustainability 10(3):782.Crossref, Google Scholar
- (2020) A Guide to Parcel Lockers in Last Mile Distribution: Highlighting Challenges and Opportunities from an OR Perspective (CIRRELT Montreal, Montreal).Google Scholar
- (2016) 50th anniversary invited article—City logistics: Challenges and opportunities. Transportation Sci. 50(2):579–590.Link, Google Scholar
- (2021) Sensitivity analysis of emission models of parcel lockers vs. home delivery based on HBEFA. Internat. J. Environ. Res. Public Health 18(12):6325.Crossref, Google Scholar
- (2015) New bounds for the traveling salesman constant. Adv. Appl. Probab. 47(1):27–36.Crossref, Google Scholar
- (2021) Tactical design of same-day delivery systems. Management Sci. 68(5):3444–3463.Google Scholar
- (2023) What moves the customers? Adoption of self-service technology in the last mile. Preprint, submitted April 26, https://doi.org/10.2139/ssrn.4417374.Google Scholar
- (1978) Minimizing a submodular function on a lattice. Oper. Res. 26(2):305–321.Link, Google Scholar
- (2018) What’s in the parcel locker? Exploring customer value in e-commerce last mile delivery. J. Bus. Res. 88:421–427.Crossref, Google Scholar
- Viniche DB, Nourinejad M, Baron O, Berman O (2023) Recipient-dependent last-mile delivery routing with autonomous vehicle applications. Preprint, submitted November 22, https://doi.org/10.2139/ssrn.3775721.Google Scholar
- Wu H, Shao D, Ng WS (2015) Locating self collection points for lastmile logistics using public transport data. Goebel R, Tanaka Y, Siekmann J, eds. Pacific Asia Conf. Knowledge Discovery Data Mining (Springer, Cham, Switzerland), 498–510.Google Scholar
- (2023) A new upper bound of the Euclidean TSP constant. Preprint, submitted June 17, https://optimization-online.org/?p=23315.Google Scholar

