IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v191y2008i3p753-770.html
   My bibliography  Save this article

General variable neighborhood search for the continuous optimization

Author

Listed:
  • Mladenovic, Nenad
  • Drazic, Milan
  • Kovacevic-Vujcic, Vera
  • Cangalovic, Mirjana

Abstract

We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results.

Suggested Citation

  • Mladenovic, Nenad & Drazic, Milan & Kovacevic-Vujcic, Vera & Cangalovic, Mirjana, 2008. "General variable neighborhood search for the continuous optimization," European Journal of Operational Research, Elsevier, vol. 191(3), pages 753-770, December.
    • Handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:753-770
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00129-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    2. Brimberg, J. & Urosevic, D. & Mladenovic, N., 2006. "Variable neighborhood search for the vertex weighted k-cardinality tree problem," European Journal of Operational Research, Elsevier, vol. 171(1), pages 74-84, May.
    3. Charles Audet & Jack Brimberg & Pierre Hansen & Sébastien Le Digabel & Nenad Mladenovi'{c}, 2004. "Pooling Problem: Alternate Formulations and Solution Methods," Management Science, INFORMS, vol. 50(6), pages 761-776, June.
    4. Mladenovic, N. & Petrovic, J. & Kovacevic-Vujcic, V. & Cangalovic, M., 2003. "Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search," European Journal of Operational Research, Elsevier, vol. 151(2), pages 389-399, December.
    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. Nevena Čolić & Pavle Milošević & Ivana Dragović & Miljan S. Ćeranić, 2024. "IBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    2. J Euchi & H Chabchoub, 2011. "Hybrid metaheuristics for the profitable arc tour problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 2013-2022, November.
    3. Marco Locatelli & Fabio Schoen, 2016. "Global optimization based on local searches," Annals of Operations Research, Springer, vol. 240(1), pages 251-270, May.
    4. Massimo Spadoni & Luciano Stefanini, 2012. "A Differential Evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization," Journal of Global Optimization, Springer, vol. 52(1), pages 171-192, January.
    5. Carrizosa, Emilio & Olivares-Nadal, Alba V. & Ramírez-Cobo, Pepa, 2013. "Time series interpolation via global optimization of moments fitting," European Journal of Operational Research, Elsevier, vol. 230(1), pages 97-112.
    6. Souza, M.J.F. & Coelho, I.M. & Ribas, S. & Santos, H.G. & Merschmann, L.H.C., 2010. "A hybrid heuristic algorithm for the open-pit-mining operational planning problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1041-1051, December.
    7. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    8. Yusuf Yilmaz & Can B. Kalayci, 2022. "Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery," Mathematics, MDPI, vol. 10(17), pages 1-22, August.

    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. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    2. Mladenovic, Nenad & Urosevic, Dragan & Pérez-Brito, Dionisio & García-González, Carlos G., 2010. "Variable neighbourhood search for bandwidth reduction," European Journal of Operational Research, Elsevier, vol. 200(1), pages 14-27, January.
    3. VÁZQUEZ-ALCOCER, Alan & GOOS, Peter & SCHOEN, Eric D., 2016. "Two-level designs constructed by concatenating orthogonal arrays of strenght three," Working Papers 2016011, University of Antwerp, Faculty of Business and Economics.
    4. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    5. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2018. "Minimizing Piecewise-Concave Functions Over Polyhedra," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 580-597, May.
    6. Amina Lamghari & Roussos Dimitrakopoulos & Jacques Ferland, 2015. "A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines," Journal of Global Optimization, Springer, vol. 63(3), pages 555-582, November.
    7. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    8. Ali Shahabi & Sadigh Raissi & Kaveh Khalili-Damghani & Meysam Rafei, 2021. "Designing a resilient skip-stop schedule in rapid rail transit using a simulation-based optimization methodology," Operational Research, Springer, vol. 21(3), pages 1691-1721, September.
    9. Wilson, Duncan T. & Hawe, Glenn I. & Coates, Graham & Crouch, Roger S., 2013. "A multi-objective combinatorial model of casualty processing in major incident response," European Journal of Operational Research, Elsevier, vol. 230(3), pages 643-655.
    10. Felipe, Ángel & Ortuño, M. Teresa & Righini, Giovanni & Tirado, Gregorio, 2014. "A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 111-128.
    11. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    12. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    13. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2014. "The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 140006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    14. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    15. Olcay Polat & Can B. Kalayci & Özcan Mutlu & Surendra M. Gupta, 2016. "A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 722-741, February.
    16. Janssens, Jochen & Van den Bergh, Joos & Sörensen, Kenneth & Cattrysse, Dirk, 2015. "Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning," European Journal of Operational Research, Elsevier, vol. 242(1), pages 222-231.
    17. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    18. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    19. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    20. Roe, R.A. & Smeelen, M. & Hoefeld, C., 2005. "Outsourcing and organizational change : an employee perspective," Research Memorandum 045, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:191:y:2008:i:3:p:753-770. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.