Advanced search
1 file | 1.01 MB Add to list

Benders' decomposition for robust travel time-constrained inventory routing problem

Author
Organization
Abstract
The time-constrained inventory routing problem (TCIRP) is a variant of the standard inventory routing problem (IRP), in which each vehicle's trip duration must not exceed a predefined maximum duration limit. In this paper, we consider the TCIRP on a network in which arc travel times are uncertain. In particular, we investigate the case where the only available information on the arc travel times is that they take values in symmetric and bounded intervals around their mean values. To solve this problem, a robust optimisation approach that generates solutions with a controlled level of conservatism is implemented. To cope with the complexity of the resulting robust counterpart, we develop a Benders' decomposition-based heuristic. Furthermore, we describe how the valid inequalities developed for the IRP can be strengthened so that the Benders' decomposition master problem can be solved effectively. We compare the proposed approach with two standard approaches for finding robust solutions. The analysis of the results show that the proposed method is able to find robust solutions that are not too conservative in reasonable time.
Keywords
Management Science and Operations Research, Strategy and Management, Industrial and Manufacturing Engineering, inventory routing problem, robust optimisation, Benders' decomposition, valid inequalities, CUT ALGORITHM, SUPPLY CHAIN, OPTIMIZATION, NETWORK, POLICIES, REPLENISHMENT, RELIABILITY, VENDOR, PRICE

Downloads

  • (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.01 MB

Citation

Please use this url to cite or link to this publication:

MLA
Lefever, Wouter, et al. “Benders’ Decomposition for Robust Travel Time-Constrained Inventory Routing Problem.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020, doi:10.1080/00207543.2019.1695167.
APA
Lefever, W., Touzout, F. A., Hadj-Hamou, K., & Aghezzaf, E.-H. (2020). Benders’ decomposition for robust travel time-constrained inventory routing problem. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. https://doi.org/10.1080/00207543.2019.1695167
Chicago author-date
Lefever, Wouter, Faycal A. Touzout, Khaled Hadj-Hamou, and El-Houssaine Aghezzaf. 2020. “Benders’ Decomposition for Robust Travel Time-Constrained Inventory Routing Problem.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. https://doi.org/10.1080/00207543.2019.1695167.
Chicago author-date (all authors)
Lefever, Wouter, Faycal A. Touzout, Khaled Hadj-Hamou, and El-Houssaine Aghezzaf. 2020. “Benders’ Decomposition for Robust Travel Time-Constrained Inventory Routing Problem.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. doi:10.1080/00207543.2019.1695167.
Vancouver
1.
Lefever W, Touzout FA, Hadj-Hamou K, Aghezzaf E-H. Benders’ decomposition for robust travel time-constrained inventory routing problem. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. 2020;
IEEE
[1]
W. Lefever, F. A. Touzout, K. Hadj-Hamou, and E.-H. Aghezzaf, “Benders’ decomposition for robust travel time-constrained inventory routing problem,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020.
@article{8637144,
  abstract     = {The time-constrained inventory routing problem (TCIRP) is a variant of the standard inventory routing problem (IRP), in which each vehicle's trip duration must not exceed a predefined maximum duration limit. In this paper, we consider the TCIRP on a network in which arc travel times are uncertain. In particular, we investigate the case where the only available information on the arc travel times is that they take values in symmetric and bounded intervals around their mean values. To solve this problem, a robust optimisation approach that generates solutions with a controlled level of conservatism is implemented. To cope with the complexity of the resulting robust counterpart, we develop a Benders' decomposition-based heuristic. Furthermore, we describe how the valid inequalities developed for the IRP can be strengthened so that the Benders' decomposition master problem can be solved effectively. We compare the proposed approach with two standard approaches for finding robust solutions. The analysis of the results show that the proposed method is able to find robust solutions that are not too conservative in reasonable time.},
  author       = {Lefever, Wouter and Touzout, Faycal A. and Hadj-Hamou, Khaled and Aghezzaf, El-Houssaine},
  issn         = {0020-7543},
  journal      = {INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH},
  keywords     = {Management Science and Operations Research,Strategy and Management,Industrial and Manufacturing Engineering,inventory routing problem,robust optimisation,Benders' decomposition,valid inequalities,CUT ALGORITHM,SUPPLY CHAIN,OPTIMIZATION,NETWORK,POLICIES,REPLENISHMENT,RELIABILITY,VENDOR,PRICE},
  language     = {eng},
  pages        = {25},
  title        = {Benders' decomposition for robust travel time-constrained inventory routing problem},
  url          = {http://dx.doi.org/10.1080/00207543.2019.1695167},
  year         = {2020},
}

Altmetric
View in Altmetric
Web of Science
Times cited: