Differential Return on Investment Optimization: Pricing, Lotsizing, and Shipment Considerations in a Two-Echelon Supply Chain

Differential Return on Investment Optimization: Pricing, Lotsizing, and Shipment Considerations in a Two-Echelon Supply Chain

Reza Ghasemy Yaghin, Hadi Mosadegh, S. M. T. Fatemi Ghomi
ISBN13: 9781522529446|ISBN10: 1522529446|EISBN13: 9781522529453
DOI: 10.4018/978-1-5225-2944-6.ch009
Cite Chapter Cite Chapter

MLA

Yaghin, Reza Ghasemy, et al. "Differential Return on Investment Optimization: Pricing, Lotsizing, and Shipment Considerations in a Two-Echelon Supply Chain." Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, edited by Ömer Faruk Yılmaz and Süleyman Tüfekçí, IGI Global, 2018, pp. 189-211. https://doi.org/10.4018/978-1-5225-2944-6.ch009

APA

Yaghin, R. G., Mosadegh, H., & Ghomi, S. M. (2018). Differential Return on Investment Optimization: Pricing, Lotsizing, and Shipment Considerations in a Two-Echelon Supply Chain. In Ö. Faruk Yılmaz & S. Tüfekçí (Eds.), Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems (pp. 189-211). IGI Global. https://doi.org/10.4018/978-1-5225-2944-6.ch009

Chicago

Yaghin, Reza Ghasemy, Hadi Mosadegh, and S. M. T. Fatemi Ghomi. "Differential Return on Investment Optimization: Pricing, Lotsizing, and Shipment Considerations in a Two-Echelon Supply Chain." In Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, edited by Ömer Faruk Yılmaz and Süleyman Tüfekçí, 189-211. Hershey, PA: IGI Global, 2018. https://doi.org/10.4018/978-1-5225-2944-6.ch009

Export Reference

Mendeley
Favorite

Abstract

A two-echelon supply chain is studied that involves a retailer who faces demand from two or more market segments and enable to set different prices and marketing expenditures and a supplier who desires to find optimal number of shipments through an integrated system. A new mixed-integer non-linear fractional programming (MINLFP) model is developed. In order to solve the resultant MINLFP model, the constrained non-linear programming model is reformulated as an unconstrained one using penalty terms. Two meta-heuristics, namely simulated annealing (SA) and imperialist competitive algorithm (ICA), are applied to solve the relaxed unconstrained model. Numerical results show that ICA can reach better solutions in comparison with SA. However, SA has the ability of providing more robust solutions which are converged to a good solution. The chapter concludes with superiority of SA.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.