Skip to main content
SpringerLink
Log in

Optimization of a city logistics transportation system with mixed passengers and goods

  • Research Paper
  • Published:
EURO Journal on Transportation and Logistics

Abstract

In this paper, we propose a mathematical model and an adaptive large neighborhood search to solve a two-tiered transportation problem. This problem arises in a prospective study that aims at designing an innovative distribution system for goods in congested city cores. In the first tier, goods are transported in city buses from a consolidation and distribution center to a set of bus stops. The main idea is to use the buses spare capacity to drive the goods to the city core. In the second tier, final customers are distributed by a fleet of near-zero emissions city freighters. This system requires transferring the goods from buses to city freighters at the bus stops. We model the corresponding optimization problem as a variant of the pickup and delivery problem with transfers and solve it with an adaptive large neighborhood search. To evaluate its results, lower bounds are calculated with a column generation approach. The algorithm is assessed on data sets derived from a field study in the medium-sized city of La Rochelle in France.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Baldacci R, Bartolini E, Mingozzi A (2011) An exact algorithm for the pickup and delivery problem with time windows. Operations Research 59(2):414–426

    Article  Google Scholar 

  • Cattaruzza, D., Absi, N., Feillet, D., Guyon, O., Libeaut, X., August 2013. The multi trip vehicle routing problem with time windows and release dates. In: Proceedings of the 10th Metaheuristics International Conference (MIC 2013). pp. 1–10

  • Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F., 2002. VRP with time windows. In: Toth, P., Vigo, D. (Eds.), The Vehicle Routing Problem. Society Industrial and Applied Mathematics, pp. 157–193

  • Cortés CE, Jayakrishnan R (2002) Design and operational concepts of high-coverage point-to-point transit system. Transportation Research Record 1783:178–187

    Article  Google Scholar 

  • Cortés CE, Matamala M, Contardo C (2010) The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research 200(3):711–724

    Article  Google Scholar 

  • Crainic TG (2000) Service network design in freight transportation. European Journal of Operational Research 122(2):272–288

    Article  Google Scholar 

  • Crainic, T. G., Errico, F., Rei, W., Ricciardi, N., 2012a. Modeling demand uncertainty in two-tiered city logistics planning. Les cahiers du CIRRELT (CIRRELT-2012-65)

  • Crainic, T. G., Gajpal, Y., Gendreau, M., 2012b. Multi-zone multi-trip vehicle routing problem with time windows. Les cahiers du CIRRELT (CIRRELT-2012-36)

  • Crainic TG, Mancini S, Perboli G, Tadei R (2011) Multi-start heuristics for the two-echelon vehicle routing problem. In: Merz P, Hao J-K (eds) Evolutionary Computation in Combinatorial Optimization, vol 6622., Lecture Notes in Computer ScienceSpringer, Berlin Heidelberg, pp 179–190

  • Crainic TG, N., R., Storchi, G. (2009) Models for evaluation and planning city logistics systems. Transportation Science 43(4):432–454

  • Crainic TG, Perboli G, Mancini S, Tadei R (2010) Two-echelon vehicle routing problem: A satellite location analysis. Procedia - Social and Behavioral Sciences 2(3):5944–5955

    Article  Google Scholar 

  • Crainic TG, Sgalambro A (2014) Service network design models for two-tier city logistics. Optimization Letters 8(4):1375–1387

    Article  Google Scholar 

  • Dueck G (1993) New optimization heuristics: The great deluge algorithm and the record-to-record travel. Journal of Computational Physics 104:86–92

    Article  Google Scholar 

  • European Commission, Directorate-General for Energy and Transport (2007) Towards a New Culture for Urban Mobility. Office for Official Publications of the European Communities

  • Feillet, D., 2010. A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8 (4), 407–424

  • Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229

    Article  Google Scholar 

  • Fugenschuh A (2009) Solving a school bus scheduling problem with integer programming. European Journal of Operational Research 193(3):867–884

    Article  Google Scholar 

  • Gonguet S, Charpentier S, Jeannenot M, Lehuédé F, Bostel N, Péton O, Delahaie B (2014) A mixed passengers-goods transportation network for territories with a low population density. Transport Research Arena, Paris, France

    Google Scholar 

  • Gørtz, I. L., Nagarajan, V., Ravi, R., 2009. Minimum makespan multi-vehicle dial-a-ride. In: Proceedings of the 17th ESA, Copenhagen, Denmark. Lecture Notes in CS. Vol. 5757. pp. 540–552

  • Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.-M., 2014. An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Les cahiers du CIRRELT (CIRRELT-2014-33)

  • Hemmelmayr VC, Cordeau J-F, Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research 39(12):3215–3228

    Article  Google Scholar 

  • Jepsen M, Spoorendonk S, Ropke S (2012) A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem. Transportation Science 47(1):23–37

    Article  Google Scholar 

  • Kerivin HLM, Lacroix M, Mahjoub AR, Quilliot A (2008) The splittable pickup and delivery problem with reloads. European Journal of Industrial Engineering 2(2):112–133

    Article  Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  Google Scholar 

  • Li B, Krushinsky D, Reijers HA, Woensel TV (2014) The share-a-ride problem: People and parcels sharing taxis. European Journal of Operational Research 238(1):31–40

    Article  Google Scholar 

  • Masson, R., Lehuédé, F., Péton, O., 2012a. An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science articles in advance, 1–12

  • Masson, R., Lehuédé, F., Péton, O., 2012b. The dial-a-ride problem with transfers. Computers and Operations Research submitted

  • Masson, R., Lehuédé, F., Péton, O., 2012c. Simple temporal problems in route scheduling for the dial-a-ride problem with transfers. In: Beldiceanu, N., Jussien, N., Pinson, E. (Eds.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Vol. 7298 of LNCS. Springer, pp. 275–291

  • Masson R, Lehuédé F, Péton O (2013a) Efficient feasibility testing for request insertion in the Pickup and Delivery Problem with Transfers. Operations Research Letters 41(3):211–215

    Article  Google Scholar 

  • Masson, R., Ropke, S., Lehuédé, F., Péton, O., 2013b. A branch-and-cut-and-price for the pickup and delivery problem with shuttles routes. European Journal of Operational Research submitted

  • Mendoza, J. E., 2011. Solving real-world vehicle routing problems in uncertain environments. 4OR 9 (3), 321–324

  • Mitrović-Minić S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44(3):217–228

    Google Scholar 

  • Nguyen P, Crainic T, Toulouse M (2013) A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. European Journal of Operational Research 231(1):43–56

    Article  Google Scholar 

  • Perboli G, Tadei R (2010) New families of valid inequalities for the two-echelon vehicle routing problem. Electronic Notes in Discrete Mathematics 36:639–646

    Article  Google Scholar 

  • Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Science 45(3):364–380

    Article  Google Scholar 

  • Petersen, H. L., Ropke, S., 2011. The pickup and delivery problem with cross-docking opportunity. In: Proceedings of the Second international conference on Computational logistics. ICCL’11. Springer-Verlag, Berlin, Heidelberg, pp. 101–113

  • Pisinger D, Ropke S (2007a) A general heuristic for vehicle routing problems. Computers and Operations Research 34(8):2403–2435

    Article  Google Scholar 

  • Pisinger D, Ropke S (2007b) A general heuristic for vehicle routing problems. Computers & Operations Research 34(8):2403–2435

    Article  Google Scholar 

  • Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin J-Y (eds) Handbook of Metaheuristics, vol 146., International Series in Operations Research & Management ScienceSpringer, US, pp 399–419

  • Qu Y, Bard JF (2012) A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Computers & Operations Research 39(10):2439–2456

    Article  Google Scholar 

  • Roberti, R., Jun. 2012. Exact algorithms for different classes of vehicle routing problems. Ph.D. thesis, University of Bologna

  • Ropke S, Cordeau J-F (2009) Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows. Transportation Science 43(3):267–286

    Article  Google Scholar 

  • Ropke S, Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40:455–472

    Article  Google Scholar 

  • Ropke S, Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research 171(3):750–775

    Article  Google Scholar 

  • Savelsbergh MWP (1992) The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing 4(2):146–154

    Article  Google Scholar 

  • Schrimpf G, Schneider J, Stamm-Wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics 159:139–171

    Article  Google Scholar 

  • Shaefer, C., Dalkmann, H., October 2003. Multibus - a new and innovative approach for bus systems in rural areas. European Transport Conference, Strasbourg, France

  • Shang JS, Cuff CK (1996) Multicriteria pickup and delivery problem with transfer opportunity. Computers & Industrial Engineering 30(4):631–645

    Article  Google Scholar 

  • Shaw, P., 1998. Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming. pp. 417–431

  • Stein D (1978) Scheduling dial-a-ride transportation systems. Transportation Science 12:232–249

    Article  Google Scholar 

  • Trentini A, Campi A, Malhéné N, Boscacci F (2011) Shared passengers & goods urban transport solutions: new ideas for milan through en international comparison. Territorio 59:38–44

    Google Scholar 

  • Trentini A, Malhéné N (2010) Toward a shared urban transport system ensuring passengers & goods cohabitation. TeMA 3(2):

  • Wieberneit N (2008) Service network design for freight transportation: a review. OR Spectrum 30(1):77–112

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LUNAM Université, Ecole des Mines de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communications et Cybernétique de Nantes), Nantes, France

    Renaud Masson, Fabien Lehuédé & Olivier Péton

  2. EIGSI, 26 Rue François de Vaux de Foletier, La Rochelle, France

    Anna Trentini, Nicolas Malhéné & Houda Tlahig

Authors
  1. Renaud Masson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna Trentini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabien Lehuédé
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nicolas Malhéné
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Olivier Péton
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Houda Tlahig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabien Lehuédé.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Masson, R., Trentini, A., Lehuédé, F. et al. Optimization of a city logistics transportation system with mixed passengers and goods. EURO J Transp Logist 6, 81–109 (2017). https://doi.org/10.1007/s13676-015-0085-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13676-015-0085-5

Keywords

Search

Navigation