IDEAS home Printed from https://ideas.repec.org/a/bla/istatr/v70y2002i3p315-349.html
   My bibliography  Save this article

Stochastic Optimization: a Review

Author

Listed:
  • Dimitris Fouskakis
  • David Draper

Abstract

No abstract is available for this item.

Suggested Citation

  • Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    • Handle: RePEc:bla:istatr:v:70:y:2002:i:3:p:315-349
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/j.1751-5823.2002.tb00174.x
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Taillard, E., 1990. "Some efficient heuristic methods for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 47(1), pages 65-74, July.
    2. Dowsland, Kathryn A., 1993. "Some experiments with simulated annealing techniques for packing problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 389-399, August.
    3. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    4. Brigitte Jaumard & Pierre Hansen & Marcus Poggi de Aragão, 1991. "Column Generation Methods for Probabilistic Logic," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 135-148, May.
    5. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    6. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    7. C.R. Reeves, 1999. "Landscapes, operators and heuristic search," Annals of Operations Research, Springer, vol. 86(0), pages 473-490, January.
    8. Kate A. Smith, 1999. "Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 15-34, February.
    9. Colin R. Reeves, 1997. "Feature Article---Genetic Algorithms for the Operations Researcher," INFORMS Journal on Computing, INFORMS, vol. 9(3), pages 231-250, August.
    10. Fred Glover, 1990. "Tabu Search: A Tutorial," Interfaces, INFORMS, vol. 20(4), pages 74-94, August.
    11. Ishibuchi, Hisao & Misaki, Shinta & Tanaka, Hideo, 1995. "Modified simulated annealing algorithms for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 81(2), pages 388-398, March.
    12. David Draper, 1995. "Inference and Hierarchical Modeling in the Social Sciences," Journal of Educational and Behavioral Statistics, , vol. 20(2), pages 115-147, June.
    13. Fu, Hsin-Pin & Su, Chao-Ton, 2000. "A comparison of search techniques for minimizing assembly time in printed wiring assembly," International Journal of Production Economics, Elsevier, vol. 63(1), pages 83-98, January.
    14. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    15. Jadranka Skorin-Kapov, 1990. "Tabu Search Applied to the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 33-45, February.
    16. Connolly, David T., 1990. "An improved annealing scheme for the QAP," European Journal of Operational Research, Elsevier, vol. 46(1), pages 93-100, May.
    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. Carapellucci, Roberto & Giordano, Lorena, 2013. "A methodology for the synthetic generation of hourly wind speed time series based on some known aggregate input data," Applied Energy, Elsevier, vol. 101(C), pages 541-550.
    2. Paolo Postiglione & M. Andreano & Roberto Benedetti, 2013. "Using Constrained Optimization for the Identification of Convergence Clubs," Computational Economics, Springer;Society for Computational Economics, vol. 42(2), pages 151-174, August.
    3. Antonio Pepiciello & Alfredo Vaccaro & Mario Mañana, 2019. "Robust Optimization of Energy Hubs Operation Based on Extended Affine Arithmetic," Energies, MDPI, vol. 12(12), pages 1-15, June.
    4. Nikmehr, Nima & Najafi-Ravadanegh, Sajad & Khodaei, Amin, 2017. "Probabilistic optimal scheduling of networked microgrids considering time-based demand response programs under uncertainty," Applied Energy, Elsevier, vol. 198(C), pages 267-279.
    5. Ajay Shrestha & Ausif Mahmood, 2016. "Improving Genetic Algorithm with Fine-Tuned Crossover and Scaled Architecture," Journal of Mathematics, Hindawi, vol. 2016, pages 1-10, April.
    6. Oussama Ouramdane & Elhoussin Elbouchikhi & Yassine Amirat & Ehsan Sedgh Gooya, 2021. "Optimal Sizing and Energy Management of Microgrids with Vehicle-to-Grid Technology: A Critical Review and Future Trends," Energies, MDPI, vol. 14(14), pages 1-45, July.
    7. Gamarra, Carlos & Guerrero, Josep M., 2015. "Computational optimization techniques applied to microgrids planning: A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 48(C), pages 413-424.
    8. Guan, Jinyu & Tang, Hao & Wang, Ke & Yao, Jianguo & Yang, Shengchun, 2020. "A parallel multi-scenario learning method for near-real-time power dispatch optimization," Energy, Elsevier, vol. 202(C).
    9. Huiru Zhao & Chao Zhang & Yihang Zhao & Xuejie Wang, 2022. "Low-Carbon Economic Dispatching of Multi-Energy Virtual Power Plant with Carbon Capture Unit Considering Uncertainty and Carbon Market," Energies, MDPI, vol. 15(19), pages 1-25, October.
    10. Khayyam, Hamid & Naebe, Minoo & Bab-Hadiashar, Alireza & Jamshidi, Farshid & Li, Quanxiang & Atkiss, Stephen & Buckmaster, Derek & Fox, Bronwyn, 2015. "Stochastic optimization models for energy management in carbonization process of carbon fiber production," Applied Energy, Elsevier, vol. 158(C), pages 643-655.
    11. Roberto Benedetti & Monica Pratesi & Nicola Salvati, 2013. "Local stationarity in small area estimation models," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 22(1), pages 81-95, March.
    12. Fouskakis, D., 2012. "Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods," European Journal of Operational Research, Elsevier, vol. 220(2), pages 414-422.
    13. Asghari, M. & Afshari, H. & Jaber, M.Y. & Searcy, C., 2023. "Credibility-based cascading approach to achieve net-zero emissions in energy symbiosis networks using an Organic Rankine Cycle," Applied Energy, Elsevier, vol. 340(C).
    14. Efrat Taig & Ohad Ben-Shahar, 2019. "Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 855-878, March.
    15. Ng, Kenyon & Turlach, Berwin A. & Murray, Kevin, 2019. "A flexible sequential Monte Carlo algorithm for parametric constrained regression," Computational Statistics & Data Analysis, Elsevier, vol. 138(C), pages 13-26.
    16. Wang, Fan & Zhang, Shengfan & Henderson, Louise M., 2018. "Adaptive decision-making of breast cancer mammography screening: A heuristic-based regression model," Omega, Elsevier, vol. 76(C), pages 70-84.
    17. Domenica Panzera & Paolo Postiglione, 2014. "Economic growth in Italian NUTS 3 provinces," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 53(1), pages 273-293, August.
    18. Paolo Postiglione & Maria Simona Andreano & Roberto Benedetti, 2017. "Spatial Clusters in EU Productivity Growth," Growth and Change, Wiley Blackwell, vol. 48(1), pages 40-60, March.
    19. David J. Spiegelhalter & Nicola G. Best & Bradley P. Carlin & Angelika Van Der Linde, 2002. "Bayesian measures of model complexity and fit," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 64(4), pages 583-639, October.
    20. Choulakian, V. & Allard, J. & Almhana, J., 2006. "Robust centroid method," Computational Statistics & Data Analysis, Elsevier, vol. 51(2), pages 737-746, November.
    21. Angun, M.E., 2004. "Black box simulation optimization : Generalized response surface methodology," Other publications TiSEM 2548e953-54ce-44e2-8c5b-7, Tilburg University, School of Economics and Management.

    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. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    2. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    3. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    4. Lin Xie & Marius Merschformann & Natalia Kliewer & Leena Suhl, 2017. "Metaheuristics approach for solving personalized crew rostering problem in public bus transit," Journal of Heuristics, Springer, vol. 23(5), pages 321-347, October.
    5. Shao, Saijun & Xu, Gangyan & Li, Ming & Huang, George Q., 2019. "Synchronizing e-commerce city logistics with sliding time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 17-28.
    6. R Logendran & Y Karim, 2003. "Design of manufacturing cells in the presence of alternative cell locations and material transporters," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1059-1075, October.
    7. Wen Sun & Jin-Kao Hao & Alexandre Caminada, 2019. "Iterated backtrack removal search for finding k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 25(4), pages 565-590, October.
    8. Drexl, Andreas & Juretzka, Jan & Salewski, Frank, 1993. "Academic course scheduling under workload and changeover constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 337, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Hai Wang, 2019. "Routing and Scheduling for a Last-Mile Transportation System," Service Science, INFORMS, vol. 53(1), pages 131-147, February.
    11. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    12. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    13. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    14. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    15. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    16. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    17. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    18. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    19. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    20. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.

    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:bla:istatr:v:70:y:2002:i:3:p:315-349. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/isiiinl.html .

    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.