Advertisement

Locating Self-Collection Points for Last-Mile Logistics Using Public Transport Data

  • Huayu WuEmail author
  • Dongxu Shao
  • Wee Siong Ng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9077)

Abstract

Delivery failure and re-scheduling cause the delay of services and increase the operation costs for logistics companies. Setting up self-collection points is an effective solution that is attracting attentions from many companies. One challenge for this model is how to choose the locations for self-collection points. In this work, we design a methodology for locating self-collection points. We consider both the distribution of a company’s potential customers and the people’s gathering pattern in the city. We leverage on citizens’ public transport riding records to simulate how the crowds emerge for particular hours. We reasonably assume that a place near to a people crowd is more convenient for customers than a place far away for self parcel collection. Based on this, we propose a kernel transformation method to re-evaluate the pairwise positions of customers, and then do a clustering.

Keywords

Kernel Function Public Transport Gaussian Mixture Model Gaussian Component Facility Location Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biernacki, C., Celeux, G., Govaert, G.: Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(7), 719–725 (2000)CrossRefGoogle Scholar
  2. 2.
    Biernacki, C., Celeux, G., Govaert, G., Langrognet, F., Noulin, G., Vernaz, Y.: Mixmod-statistical documentation (2008)Google Scholar
  3. 3.
    Celeux, G., Soromenho, G.: An entropy criterion for assessing the number of clusters in a mixture model. Journal of Classification 13(2), 195–212 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 1–38 (1977)Google Scholar
  5. 5.
    Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.: Covering problems in facility location: A review. Computers & Industrial Engineering 62(1), 368–407 (2012)CrossRefGoogle Scholar
  6. 6.
    Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 293–306 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Goodman, R.W.: Whatever you calll it, just don’t think of last-mile logistics, last. Glabal Logistics & Supply Chain Strategies (2005)Google Scholar
  8. 8.
    Hwang, C., Masud, A.: Multiple objective decision making, methods and applications: a state-of-the-art survey. Lecture notes in economics and mathematical systems. Springer-Verlag (1979)Google Scholar
  9. 9.
    MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, California, USA, vol. 1, pp. 281–297 (1967)Google Scholar
  10. 10.
    McLachlan, G., Peel, D.: Finite mixture models. John Wiley & Sons (2004)Google Scholar
  11. 11.
    Melnykov, V., Melnykov, I.: Initializing the em algorithm in gaussian mixture models with an unknown number of components. Computational Statistics & Data Analysis 56(6), 1381–1395 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Morganti, E., Dablanc, L., Fortin, F.: Final deliveries for online shopping: The deployment of pickup point networks in urban and suburban areas. Research in Transportation Business & Management (2014)Google Scholar
  13. 13.
    Pollard, D.: Quantization and the method of k-means. IEEE Transactions on Information theory 28(2), 199–204 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Schwarz, G., et al.: Estimating the dimension of a model. The Annals of Statistics 6(2), 461–464 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Wolfe, J.H.: Normix: Computational methods for estimating the parameters of multivariate normal mixtures of distributions. Technical report, DTIC Document (1967)Google Scholar
  16. 16.
    Yang, M.-S., Lai, C.-Y., Lin, C.-Y.: A robust em clustering algorithm for gaussian mixture models. Pattern Recognition 45(11), 3950–3961 (2012)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute for Infocomm ResearchA*STARSingaporeSingapore

Personalised recommendations