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

A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints

Author

Listed:
  • Suxia Ma

    (School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China
    Ningxia Province Cooperative Innovation Center of Scientific Computing and Intelligent Information Processing, North Minzu University, Yinchuan 750021, China)

  • Yuelin Gao

    (Ningxia Province Cooperative Innovation Center of Scientific Computing and Intelligent Information Processing, North Minzu University, Yinchuan 750021, China
    Ningxia Province Key Laboratory of Intelligent Information and Data Processing, North Minzu University, Yinchuan 750021, China)

  • Bo Zhang

    (School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, China)

  • Wenlu Zuo

    (School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China)

Abstract

In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.

Suggested Citation

  • Suxia Ma & Yuelin Gao & Bo Zhang & Wenlu Zuo, 2022. "A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints," Mathematics, MDPI, vol. 10(5), pages 1-16, February.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:5:p:734-:d:758880
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/5/734/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/5/734/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qian Liu & Yuqing Xu & Yang Zhou, 2020. "A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems," Journal of Global Optimization, Springer, vol. 76(4), pages 745-768, April.
    2. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    3. Shang, You-lin & Zhang, Lian-sheng, 2008. "Finding discrete global minima with a filled function for integer programming," European Journal of Operational Research, Elsevier, vol. 189(1), pages 31-40, 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. Kraus, Ursula G. & Yano, Candace Arai, 2003. "Product line selection and pricing under a share-of-surplus choice model," European Journal of Operational Research, Elsevier, vol. 150(3), pages 653-671, November.
    2. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    3. Tsoukias, Alexis, 2008. "From decision theory to decision aiding methodology," European Journal of Operational Research, Elsevier, vol. 187(1), pages 138-161, May.
    4. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," LIDAM Discussion Papers CORE 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    6. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    7. Charon, Irene & Hudry, Olivier, 2001. "The noising methods: A generalization of some metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 86-101, November.
    8. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    9. Cantarella, G.E. & Pavone, G. & Vitetta, A., 2006. "Heuristics for urban road network design: Lane layout and signal settings," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1682-1695, December.
    10. Alizadeh, Somayeh & Ghazanfari, Mehdi, 2009. "Learning FCM by chaotic simulated annealing," Chaos, Solitons & Fractals, Elsevier, vol. 41(3), pages 1182-1190.
    11. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    12. Rosing, K. E. & ReVelle, C. S. & Rolland, E. & Schilling, D. A. & Current, J. R., 1998. "Heuristic concentration and Tabu search: A head to head comparison," European Journal of Operational Research, Elsevier, vol. 104(1), pages 93-99, January.
    13. LECLUYSE, C. & VAN WOENSEL, Tom & PEREMANS, Herbert, 2007. "Vehicle routing with stochastic time-dependent travel times," Working Papers 2007018, University of Antwerp, Faculty of Business and Economics.
    14. Guillermo Cabrera-Guerrero & Carolina Lagos & Carolina Castañeda & Franklin Johnson & Fernando Paredes & Enrique Cabrera, 2017. "Parameter Tuning for Local-Search-Based Matheuristic Methods," Complexity, Hindawi, vol. 2017, pages 1-15, December.
    15. Csondes, Tibor & Kotnyek, Balazs & Zoltan Szabo, Janos, 2002. "Application of heuristic methods for conformance test selection," European Journal of Operational Research, Elsevier, vol. 142(1), pages 203-218, October.
    16. Allet, Samir, 2003. "Handling flexibility in a "generalised job shop" with a fuzzy approach," European Journal of Operational Research, Elsevier, vol. 147(2), pages 312-333, June.
    17. K.E. Rosing & C.S. ReVelle, 1997. "Heuristic Concentration and Tabu Search: A Nose to Nose Comparison," Tinbergen Institute Discussion Papers 97-058/3, Tinbergen Institute.
    18. Hongwei Zhang & Wei Ji & Bo Xu & Xiaowei Yu, 2024. "Optimizing Contact Force on an Apple Picking Robot End-Effector," Agriculture, MDPI, vol. 14(7), pages 1-16, June.
    19. Ferretti, Valentina & Liu, Jun & Mousseau, V & Ouerdane, W, 2017. "Reference-based ranking procedure for environmental decision making: insights from an ex-post analysis," LSE Research Online Documents on Economics 85933, London School of Economics and Political Science, LSE Library.
    20. Ross, Anthony D., 2000. "A two-phased approach to the supply network reconfiguration problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 18-30, April.

    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:10:y:2022:i:5:p:734-:d:758880. 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.