IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v229y2015i1p475-50010.1007-s10479-015-1795-7.html
   My bibliography  Save this article

Successive smoothing algorithm for solving large-scale optimization models with fixed cost

Author

Listed:
  • Mashor Housh
  • Ximing Cai

Abstract

This study addresses the solution of large-scale, non-convex optimization problems with fixed and linear variable costs in the objective function and a set of linear constraints. A successive smoothing algorithm (SSA) is developed to solve a non-convex optimization problem by solving a sequence of approximated convex problems. The performance of the SSA is tested on a series of randomly generated problems. The computation time and the solution quality obtained by the SSA are compared to a mixed integer linear programming (MILP) solver (CPLEX) over a wide variety of randomly generated problems. The results indicate that the SSA performs consistently well and produces high-quality near optimal solutions using substantially shorter time than the MILP solver. The SSA is also applied to solving a real-world problem related to regional biofuel development. The model is developed for a “system of systems” that consists of refineries, transportation, agriculture, water resources and crops and energy market systems, resulting in a large-scale optimization problem. Based on both the hypothetical problems and the real-world application, it is found that the SSA has considerable advantage over the MILP solver in terms of computation time and accuracy, especially when solving large-scale optimization problems. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Mashor Housh & Ximing Cai, 2015. "Successive smoothing algorithm for solving large-scale optimization models with fixed cost," Annals of Operations Research, Springer, vol. 229(1), pages 475-500, June.
    • Handle: RePEc:spr:annopr:v:229:y:2015:i:1:p:475-500:10.1007/s10479-015-1795-7
    DOI: 10.1007/s10479-015-1795-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-1795-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-1795-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Baumgartner, Kerstin & Fuetterer, André & Thonemann, Ulrich W., 2012. "Supply chain design considering economies of scale and transport frequencies," European Journal of Operational Research, Elsevier, vol. 218(3), pages 789-800.
    2. O'Kelly, M. E. & Bryan, D. L., 1998. "Hub location with flow economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 605-616, November.
    3. Melkote, Sanjay & Daskin, Mark S., 2001. "An integrated model of facility location and transportation network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(6), pages 515-538, July.
    4. Jenn-Rong Lin & Linda Nozick & Mark Turnquist, 2006. "Strategic design of distribution systems with economies of scale in transportation," Annals of Operations Research, Springer, vol. 144(1), pages 161-180, April.
    5. John Klincewicz, 2002. "Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale," Annals of Operations Research, Springer, vol. 110(1), pages 107-122, February.
    6. Miguel Lobo & Maryam Fazel & Stephen Boyd, 2007. "Portfolio optimization with linear and fixed transaction costs," Annals of Operations Research, Springer, vol. 152(1), pages 341-365, July.
    7. Hans Kellerer & Renata Mansini & M. Speranza, 2000. "Selecting Portfolios with Fixed Costs and Minimum Transaction Lots," Annals of Operations Research, Springer, vol. 99(1), pages 287-304, December.
    8. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    9. H. Tuy & T. V. Thieu & Ng. Q. Thai, 1985. "A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set," Mathematics of Operations Research, INFORMS, vol. 10(3), pages 498-514, August.
    Full references (including those not matched with items on IDEAS)

    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. Baumgartner, Kerstin & Fuetterer, André & Thonemann, Ulrich W., 2012. "Supply chain design considering economies of scale and transport frequencies," European Journal of Operational Research, Elsevier, vol. 218(3), pages 789-800.
    2. Peterson, Steven, 2005. "Factors Influencing Inter-Modal Facility Location Decisions: Comparison of Different Empirical Estimation Procedures," 46th Annual Transportation Research Forum, Washington, D.C., March 6-8, 2005 208177, Transportation Research Forum.
    3. He, Yan & Wu, Tao & Zhang, Canrong & Liang, Zhe, 2015. "An improved MIP heuristic for the intermodal hub location problem," Omega, Elsevier, vol. 57(PB), pages 203-211.
    4. Hüseyin Güden, 2021. "New complexity results for the p-hub median problem," Annals of Operations Research, Springer, vol. 298(1), pages 229-247, March.
    5. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    6. Sarid, A. & Tzur, M., 2018. "The multi-scale generation and transmission expansion model," Energy, Elsevier, vol. 148(C), pages 977-991.
    7. Contreras, Ivan & Fernández, Elena & Reinelt, Gerhard, 2012. "Minimizing the maximum travel time in a combined model of facility location and network design," Omega, Elsevier, vol. 40(6), pages 847-860.
    8. Yuichi Takano & Keisuke Nanjo & Noriyoshi Sukegawa & Shinji Mizuno, 2015. "Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs," Computational Management Science, Springer, vol. 12(2), pages 319-340, April.
    9. Hewitt, Mike & Crainic, Teodor Gabriel & Nowak, Maciek & Rei, Walter, 2019. "Scheduled service network design with resource acquisition and management under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 324-343.
    10. Leal, Marina & Ponce, Diego & Puerto, Justo, 2020. "Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 712-727.
    11. Bigotte, João F. & Krass, Dmitry & Antunes, António P. & Berman, Oded, 2010. "Integrated modeling of urban hierarchy and transportation network planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(7), pages 506-522, August.
    12. Eduardo Bered Fernandes Vieira & Tiago Pascoal Filomena, 2020. "Liquidity Constraints for Portfolio Selection Based on Financial Volume," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 1055-1077, December.
    13. Takano, Yuichi & Gotoh, Jun-ya, 2023. "Dynamic portfolio selection with linear control policies for coherent risk minimization," Operations Research Perspectives, Elsevier, vol. 10(C).
    14. AL Athamneh, Raed & Tanash, Moayad & Bani Hani, Dania & Rawshdeh, Mustafa & Alawin, Abdallah & Albataineh, Zaid, 2023. "Variable Neighborhood Search Algorithm for the Single Assignment Incomplete Hub Location Problem with Modular Capacities and Direct Connections," Operations Research Perspectives, Elsevier, vol. 11(C).
    15. Nowak, Maciek & Hewitt, Mike & Bachour, Hussam, 2019. "Mileage bands in freight transportation," European Journal of Operational Research, Elsevier, vol. 272(2), pages 549-564.
    16. Mehmet R. Taner & Bahar Y. Kara, 2016. "Endogenous Effects of Hubbing on Flow Intensities," Networks and Spatial Economics, Springer, vol. 16(4), pages 1151-1181, December.
    17. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    18. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    19. Tiago P. Filomena & Miguel A. Lejeune, 2014. "Warm-Start Heuristic for Stochastic Portfolio Optimization with Fixed and Proportional Transaction Costs," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 308-329, April.
    20. Zura Kakushadze, 2015. "Combining Alphas via Bounded Regression," Risks, MDPI, vol. 3(4), pages 1-17, November.

    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:spr:annopr:v:229:y:2015:i:1:p:475-500:10.1007/s10479-015-1795-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.