Skip to main content
SpringerLink
Log in

Matheuristics for Waiting Time Minimization for Trailers with Uncertain Arrival Times

Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We present a new loading/unloading trailer scheduling problem for a logistics company. There is a building with several warehouses. Each warehouse stores pallets of different types of products in rooms for loading into trailers. Each warehouse has two gates. One gate is for the trailers, and the other one is for two forklifts from the central zone (production line). It produces some products which must be placed in warehouses according to the no wait rule. We assume that the arrival time for each trailer is uncertain. Our goal is to assign all trailers to warehouses and find a schedule for servicing all the trailers with the maximum stability radius under the total waiting time constraint. For this NP-hard problem, we design a two-stage matheuristic. First, we solve the simplified model using the Gurobi solver. Then the VNS algorithm is used to return the solution into the feasible domain taking into account the detailed information about pallets in each warehouse. We generate some test instances using real data from a Dutch logistics company. Computational results for 6 warehouses, 18 types of products, and 90 trailers are discussed.

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

Access this article

Log in via an institution

Price includes VAT (Canada)

Instant access to the full article PDF.

Institutional subscriptions

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

REFERENCES

  1. E. Carrizosa and S. Nickel, “Robust facility location,” Math. Methods Oper. Res. 58, 331–349 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Carrizosa, A. Ushakov, and I. Vasilyev, “Threshold robustness in discrete facility location problems: A bi-objective approach,” Optim. Lett. 9, 1297–1314 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Borisovsky and O. Battaia, “MIP-based heuristics for a robust transfer lines balancing problem,” in Optimization and Applications. Proc. Int. Conf. OPTIMA 2021 (Petrovac, Montenegro, September 27–October 1, 2021), vol. 13078 of Lect. Notes Comput. Sci. (Springer, Heidelberg, 2021), pp. 123–135.

  4. T. Andersen, J. H. Hove, K. Fagerholt, and F. Meisel, “Scheduling ships with uncertain arrival times through the Kiel Canal,” Maritime Transp. Res. 2, 100008 (2021).

    Article  Google Scholar 

  5. A. Ben-Tal and A. Nemirovski, “Robust optimization—methodology and applications,” Math. Program. 92, 453–480 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  6. J. Garc´ıa and A. Peña, “Robust optimization: Concepts and applications,” in Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization (IntechOpen, London, 2018), pp. 7–22.

  7. Eh. N. Gordeev and V. K. Leont’ev, “A general approach to the study of the stability of solutions in discrete optimization problems,” Zh. Vychisl. Mat. Mat. Fiz. 36 (1), 66–72 (1996) [Comput. Math. Math. Phys. 36 (1), 53–58 (1996)].

    MathSciNet  MATH  Google Scholar 

  8. E. Gurevsky, O. Battaia, and A. Dolgui, “Stability measure for a generalized assembly line balancing problem,” Discrete Appl. Math. 161 (3), 377–394 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  9. A. Rossi, E. Gurevsky, O. Battaia, and A. Dolgui, “Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations,” Discrete Appl. Math. 208, 123–136 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  10. Gurobi Optimizer Reference Manual (Gurobi Opt., Beaverton, 2021). www.gurobi.com/documentation/9.5/refman/index.html . Accessed May 16, 2022.

  11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).

    MATH  Google Scholar 

  12. I. N. Kulachenko and P. A. Kononova, “A hybrid local search algorithm for consistent periodic vehicle routing problem,” Diskretn. Anal. Issled. Oper. 27 (2), 43–64 (2020) [J. Appl. Ind. Math. 14 (2), 339–351 (2020)].

    Article  Google Scholar 

  13. I. N. Kulachenko and P. A. Kononova, “A hybrid algorithm for the drilling rig routing problem,” Diskretn. Anal. Issled. Oper. 28 (2), 35–59 (2021) [J. Appl. Ind. Math. 15 (2), 261–276 (2021)].

    Article  MathSciNet  MATH  Google Scholar 

  14. N. Mladenović and P. Hansen, “Variable neighborhood search,” Comput. Oper. Res. 24 (11), 1097–1100 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  15. A. E. Smith and D. W. Coit, “Penalty functions,” in Handbook of Evolutionary Computation (Oxford Univ. Press, New York, 1997), pp. C5.2:1–C5.2:6.

Download references

Funding

This work was supported by the Russian Science Foundation, project no. 21–41–09017.

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, 630090, Russia

    A. V. Ratushnyi

  2. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090, Russia

    Yu. A. Kochetov

Authors
  1. A. V. Ratushnyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. A. Kochetov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. V. Ratushnyi or Yu. A. Kochetov.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ratushnyi, A.V., Kochetov, Y.A. Matheuristics for Waiting Time Minimization for Trailers with Uncertain Arrival Times. J. Appl. Ind. Math. 16, 540–549 (2022). https://doi.org/10.1134/S1990478922030176

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478922030176

Keywords

search

Navigation