Advertisement

Demand Uncertainty for the Location-Routing Problem with Two-dimensional Loading Constraints

  • Thiago Alves de Queiroz
  • José Fernando Oliveira
  • Maria Antónia Carravilla
  • Flávio Keidi Miyazawa
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 682)

Abstract

In this work, we investigate the location-routing problem with two-dimensional loading constraints under uncertainty on customer’s demand. Uncertainty on the demand is modeled by a scenario approach in order to get a solution satisfying all the scenarios. An integer programming model concerning decisions on strategic (depot locations), tactical (what customers are served by each depot) and operational levels (routes from depots to customers including the two-dimensional arrangement of items) is proposed. A cut is inserted whenever an infeasible packing is found and the model is applied to solve one real case based example considering three different scenarios.

Keywords

Supply Chain Fixed Cost Valid Inequality Demand Uncertainty Integer Programming Model 
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.

Notes

Acknowledgements

This research was partially financed by CNPq, FAPESP and FAPEG.

References

  1. 1.
    Baldacci, R., Mingozzi, A., Calvo, R.W.: An exact method for the capacitated location-routing problem. Oper. Res. 59(5), 1284–1296 (2011)CrossRefGoogle Scholar
  2. 2.
    Belenguer, J.M., Benavent, E., Prins, C., Prodhon, C., Calvo, R.W.: A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38, 931–941 (2011)CrossRefGoogle Scholar
  3. 3.
    Cardoso, S., Barbosa-Póvoa, A.P., Relvas, S.: Design and planning of supply chains with integration of reverse logistics under demand uncertainty. Eur. J. Oper. Res. 226, 436–451 (2013)CrossRefGoogle Scholar
  4. 4.
    Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35, 944–959 (2008)CrossRefGoogle Scholar
  5. 5.
    Fekete, S.P., Schepers, J., van der Veen, J.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55(3), 569–587 (2007)CrossRefGoogle Scholar
  6. 6.
    Iori, M., Salazar-Gonzalez, J.J., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp. Sci. 41, 253–264 (2007)CrossRefGoogle Scholar
  7. 7.
    King, G.F., Mast, C.F.: Excess travel: causes extent and consequences. Transp. Sci. Rec. 1111, 126–134 (1997)Google Scholar
  8. 8.
    Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. Ser. A, B 100(2), 423–445 (2004)CrossRefGoogle Scholar
  9. 9.
    Queiroz, T.A., Miyazawa, F.K.: Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. Int. J. Prod. Econ. 145, 511–530 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Thiago Alves de Queiroz
    • 1
  • José Fernando Oliveira
    • 1
  • Maria Antónia Carravilla
    • 1
  • Flávio Keidi Miyazawa
    • 2
  1. 1.INESC TEC, Faculty of EngineeringUniversity of PortoPortoPortugal
  2. 2.Institute of ComputingState University of CampinasCampinasBrazil

Personalised recommendations