Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations

Timothy Curtois, Wasakorn Laesanklang, Dario Landa-Silva, Mohammad Mesgarpour, Yi Qu

Abstract

This paper gives an overview of research work in progress within the COSLE (Collaborative Optimisation in a Shared Logistics Environment) project between the University of Nottingham and Microlise Ltd. This is an R&D project that seeks to develop optimisation technology to enable more efficient collaboration in transportation, particularly real-world operational environments involving pickup and delivery problems. The overall aim of the project is to integrate various optimisation techniques into a framework that facilitates collaboration in a shared freight transport logistics environment with the overall goal of reducing empty mileage.

References

  1. Andersson, H., Christiansen, M., and Fagerholt, K. (2011). The maritime pickup and delivery problem with time windows and split loads. INFOR: Information Systems and Operational Research, 49(2):79-91.
  2. Archetti, C. and Speranza, M. G. (2012). Vehicle routing problems with split deliveries. International transactions in operational research, 19(1-2):3-22.
  3. Archetti, C., Speranza, M. G., and Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1):64-73.
  4. Bent, R. and Van Hentenryck, P. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4):875-893.
  5. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., and Laporte, G. (2007). Static pickup and delivery problems: a classification scheme and survey. Top, 15(1):1-31.
  6. Berbotto, L., García, S., and Nogales, F. J. (2014). A randomized granular tabu search heuristic for the split delivery vehicle routing problem. Annals of Operations Research, 222(1):153-173.
  7. Burke, E. K. and Bykov, Y. (2012). The late acceptance hill-climbing heuristic. University of Stirling, Tech. Rep.
  8. Cherkesly, M., Desaulniers, G., and Laporte, G. (2015). A population-based metaheuristic for the pickup and delivery problem with time windows and lifo loading. Computers & Operations Research, 62:23-35.
  9. Cruijssen, F., Bräysy, O., Dullaert, W., Fleuren, H., and Salomon, M. (2007a). Joint route planning under varying market conditions. International Journal of Physical Distribution & Logistics Management, 37(4):287-304.
  10. Cruijssen, F., Dullaert, W., and Fleuren, H. (2007b). Horizontal cooperation in transport and logistics: a literature review. Transportation journal, pages 22-39.
  11. Dror, M. and Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2):141-145.
  12. Dumas, Y., Desrosiers, J., and Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1):7-22.
  13. Ergun, O., Kuyzu, G., and Savelsbergh, M. (2007). Reducing truckload transportation costs through collaboration. Transportation Science, 41(2):206-221.
  14. M., Göthe-Lundgren, M., Jörnsten, K., and Rönnqvist, M. (2010). Cost allocation in collaborative forest transportation. European Journal of Operational Research, 205(2):448-458.
  15. Hall, R. and Partyka, J. (2016). Vehicle routing software survey: Higher expectations drive transformation. ORMS-Today, 43(1).
  16. Kammarti, R., Hammadi, S., Borne, P., and Ksouri, M. (2004). A new hybrid evolutionary approach for the pickup and delivery problem with time windows. In Systems, Man and Cybernetics, 2004 IEEE International Conference on, volume 2, pages 1498-1503. IEEE.
  17. Li, H. and Lim, A. (2003). A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools , 12(02):173-186.
  18. Li, J., Chu, F., and Chen, H. (2011). Coordination of split deliveries in one-warehouse multi-retailer distribution systems. Computers & Industrial Engineering, 60(2):291-301.
  19. Lu, Q. and Dessouky, M. (2004). An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science, 38(4):503-514.
  20. Masson, R., Lehuédé, F., and Péton, O. (2013). An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science, 47(3):344-355.
  21. Nagata, Y. and Kobayashi, S. (2010). Guided ejection search for the pickup and delivery problem with time windows. In European Conference on Evolutionary Computation in Combinatorial Optimization, pages 202-213. Springer.
  22. Nanry, W. P. and Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2):107-121.
  23. Nowak, M., Ergun, O., and White, C. C. (2009). An empirical study on the benefit of split loads with the pickup and delivery problem. European Journal of Operational Research, 198(3):734-740.
  24. Nowak, M., Ergun, O., and White III, C. C. (2008). Pickup and delivery with split loads. Transportation Science, 42(1):32-43.
  25. Oldham, P. (2016). UK Freight: in for the long haul. Institution of Mechanical Engineers.
  26. Parragh, S. N., Doerner, K. F., and Hartl, R. F. (2008). A survey on pickup and delivery problems. Journal für Betriebswirtschaft, 58(1):21-51.
  27. Pérez-Bernabeu, E., Juan, A. A., Faulin, J., and Barrios, B. B. (2015). Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions. International Transactions in Operational Research, 22(3):585-606.
  28. Ropke, S. and Cordeau, J.-F. (2009). Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science, 43(3):267-286.
  29. Ropke, S. and Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4):455-472.
  30. Ruland, K. and Rodin, E. (1997). The pickup and delivery problem: Faces and branch-and-cut algorithm. Computers & mathematics with applications, 33(12):1-13.
  31. Savelsbergh, M. and Sol, M. (1998). Drive: Dynamic routing of independent vehicles. Operations Research, 46(4):474-490.
  32. Savelsbergh, M. W. and Sol, M. (1995). The general pickup and delivery problem. Transportation science, 29(1):17-29.
  33. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In International Conference on Principles and Practice of Constraint Programming, pages 417-431. Springer.
  34. Tang, G., Ning, A., Wang, K., and Qi, X. (2009). A practical split vehicle routing problem with simultaneous pickup and delivery. In Industrial Engineering and Engineering Management, 2009. IE&EM'09. 16th International Conference on, pages 26-30. IEEE.
  35. Venkateshan, P. and Mathur, K. (2011). An efficient column-generation-based algorithm for solving a pickup-and-delivery problem. Computers & Operations Research, 38(12):1647-1655.
  36. Wang, H., Du, L., and Ma, S. (2014). Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Transportation Research Part E: Logistics and Transportation Review, 69:160-179.
  37. Wang, X. and Kopfer, H. (2014). Collaborative transportation planning of less-than-truckload freight. OR spectrum, 36(2):357-380.
  38. Xu, H., Chen, Z.-L., Rajagopal, S., and Arunapuram, S. (2003). Solving a Practical Pickup and Delivery Problem. Transportation Science, 37(3):347-364.
Download


Paper Citation


in Harvard Style

Curtois T., Laesanklang W., Landa-Silva D., Mesgarpour M. and Qu Y. (2017). Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 477-482. DOI: 10.5220/0006291004770482


in Bibtex Style

@conference{icores17,
author={Timothy Curtois and Wasakorn Laesanklang and Dario Landa-Silva and Mohammad Mesgarpour and Yi Qu},
title={Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={477-482},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006291004770482},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations
SN - 978-989-758-218-9
AU - Curtois T.
AU - Laesanklang W.
AU - Landa-Silva D.
AU - Mesgarpour M.
AU - Qu Y.
PY - 2017
SP - 477
EP - 482
DO - 10.5220/0006291004770482