IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i11p2027-d444931.html
   My bibliography  Save this article

Stability of Solutions for Parametric Inverse Nonlinear Cost Transportation Problem

Author

Listed:
  • Abd Allah A. Mousa

    (Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
    Department of Basic Engineering Science, Faculty of Engineering, Menofia University, Shebin El-Kom 32511, Egypt)

  • Yousria Abo-Elnaga

    (Department of Basic Science, Higher Technological Institute, Tenth of Ramadan City 44629, Egypt)

Abstract

This paper investigates the solution for an inverse of a parametric nonlinear transportation problem, in which, for a certain values of the parameters, the cost of the unit transportation in the basic problem are adapted as little as possible so that the specific feasible alternative become an optimal solution. In addition, a solution stability set of these parameters was investigated to keep the new optimal solution (feasible one) is unchanged. The idea of this study based on using a tuning parameters λ ∈ R m in the function of the objective and input parameters υ ∈ R l in the set of constraint. The inverse parametric nonlinear cost transportation problem P ( λ , υ ) , where the tuning parameters λ ∈ R m in the objective function are tuned (adapted) as less as possible so that the specific feasible solution x ∘ has been became the optimal ones for a certain values of υ ∈ R l , then, a solution stability set of the parameters was investigated to keep the new optimal solution x ∘ unchanged. The proposed method consists of three phases. Firstly, based on the optimality conditions, the parameter λ ∈ R m are tuned as less as possible so that the initial feasible solution x ∘ has been became new optimal solution. Secondly, using input parameters υ ∈ R l resulting problem is reformulated in parametric form P ( υ ) . Finally, based on the stability notions, the availability domain of the input parameters was detected to keep its optimal solution unchanged. Finally, to clarify the effectiveness of the proposed algorithm not only for the inverse transportation problems but also, for the nonlinear programming problems; numerical examples treating the inverse nonlinear programming problem and the inverse transportation problem of minimizing the nonlinear cost functions are presented.

Suggested Citation

  • Abd Allah A. Mousa & Yousria Abo-Elnaga, 2020. "Stability of Solutions for Parametric Inverse Nonlinear Cost Transportation Problem," Mathematics, MDPI, vol. 8(11), pages 1-21, November.
  • Handle: RePEc:gam:jmathe:v:8:y:2020:i:11:p:2027-:d:444931
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/11/2027/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/8/11/2027/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Chow, Joseph Y.J. & Ritchie, Stephen G. & Jeong, Kyungsoo, 2014. "Nonlinear inverse optimization for parameter estimation of commodity-vehicle-decoupled freight assignment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 67(C), pages 71-91.
    2. Chan, Timothy C.Y. & Kaw, Neal, 2020. "Inverse optimization for the recovery of constraint parameters," European Journal of Operational Research, Elsevier, vol. 282(2), pages 415-427.
    3. Nirbhay Mathur & Pankaj Kumar Srivastava & Ajit Paul, 2018. "Algorithms for solving fuzzy transportation problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 12(2), pages 190-219.
    4. Susan Jia Xu & Mehdi Nourinejad & Xuebo Lai & Joseph Y. J. Chow, 2018. "Network Learning via Multiagent Inverse Transportation Problems," Service Science, INFORMS, vol. 52(6), pages 1347-1364, December.
    5. Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
    6. Jianzhong Zhang & Liwei Zhang & Xiantao Xiao, 2010. "A Perturbation approach for an inverse quadratic programming problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 379-404, December.
    7. Huang, Siming & Liu, Zhenhong, 1999. "On the inverse problem of linear programming and its application to minimum weight perfect k-matching," European Journal of Operational Research, Elsevier, vol. 112(2), pages 421-426, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Julian Vasilev & Rosen Nikolaev & Tanka Milkova, 2023. "Transport Task Models with Variable Supplier Availabilities," Logistics, MDPI, vol. 7(3), pages 1-12, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Merve Bodur & Timothy C. Y. Chan & Ian Yihang Zhu, 2022. "Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1471-1488, May.
    2. Chen, Lu & Chen, Yuyi & Langevin, André, 2021. "An inverse optimization approach for a capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1087-1098.
    3. Ren, Xiyuan & Chow, Joseph Y.J., 2022. "A random-utility-consistent machine learning method to estimate agents’ joint activity scheduling choice from a ubiquitous data set," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 396-418.
    4. Libura, Marek, 2007. "On the adjustment problem for linear programs," European Journal of Operational Research, Elsevier, vol. 183(1), pages 125-134, November.
    5. Bennet Gebken & Sebastian Peitz, 2021. "Inverse multiobjective optimization: Inferring decision criteria from data," Journal of Global Optimization, Springer, vol. 80(1), pages 3-29, May.
    6. Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
    7. Hong, Sung-Pil & Kim, Kyung min & Byeon, Geunyeong & Min, Yun-Hong, 2017. "A method to directly derive taste heterogeneity of travellers’ route choice in public transport from observed routes," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 41-52.
    8. Fernández-Blanco, Ricardo & Morales, Juan Miguel & Pineda, Salvador, 2021. "Forecasting the price-response of a pool of buildings via homothetic inverse optimization," Applied Energy, Elsevier, vol. 290(C).
    9. Lili Zhang & Wenhao Guo, 2023. "Inverse Optimization Method for Safety Resource Allocation and Inferring Cost Coefficient Based on a Benchmark," Mathematics, MDPI, vol. 11(14), pages 1-15, July.
    10. Roghayeh Yousefi & Nasser Talebbeydokhti & Seyyed Hosein Afzali & Maryam Dehghani & Ali Akbar Hekmatzadeh, 2023. "Understanding the effects of subsidence on unconfined aquifer parameters by integration of Lattice Boltzmann Method (LBM) and Genetic Algorithm (GA)," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 115(2), pages 1571-1600, January.
    11. Xiyuan Ren & Joseph Y. J. Chow, 2023. "Nonparametric estimation of k-modal taste heterogeneity for group level agent-based mixed logit," Papers 2309.13159, arXiv.org.
    12. Li, Xinyan & Xie, Chi & Bao, Zhaoyao, 2022. "A multimodal multicommodity network equilibrium model with service capacity and bottleneck congestion for China-Europe containerized freight flows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    13. Egri, Péter & Kis, Tamás & Kovács, András & Váncza, József, 2014. "An inverse economic lot-sizing approach to eliciting supplier cost parameters," International Journal of Production Economics, Elsevier, vol. 149(C), pages 80-88.
    14. Çiğdem Güler & Horst W. Hamacher, 2010. "Capacity inverse minimum cost flow problem," Journal of Combinatorial Optimization, Springer, vol. 19(1), pages 43-59, January.
    15. Yong He & Binwu Zhang & Enyu Yao, 2005. "Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 91-100, February.
    16. Zhao, Dongfang & Balusu, Suryaprasanna Kumar & Sheela, Parvathy Vinod & Li, Xiaopeng & Pinjari, Abdul Rawoof & Eluru, Naveen, 2020. "Weight-categorized truck flow estimation: A data-fusion approach and a Florida case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    17. Jean B. Lasserre, 2013. "Inverse Polynomial Optimization," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 418-436, August.
    18. Ghobadi, Kimia & Mahmoudzadeh, Houra, 2021. "Inferring linear feasible regions using inverse optimization," European Journal of Operational Research, Elsevier, vol. 290(3), pages 829-843.
    19. Shi Yu & Haoran Wang & Chaosheng Dong, 2020. "Learning Risk Preferences from Investment Portfolios Using Inverse Optimization," Papers 2010.01687, arXiv.org, revised Feb 2021.
    20. Susan Jia Xu & Mehdi Nourinejad & Xuebo Lai & Joseph Y. J. Chow, 2018. "Network Learning via Multiagent Inverse Transportation Problems," Service Science, INFORMS, vol. 52(6), pages 1347-1364, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:11:p:2027-:d:444931. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.