IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v143y2006i1p237-25010.1007-s10479-006-7385-y.html
   My bibliography  Save this article

A new approach based on the surrogating method in the project time compression problems

Author

Listed:
  • Hadi Bidhandi

Abstract

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach. Copyright Springer Science + Business Media, Inc. 2006

Suggested Citation

  • Hadi Bidhandi, 2006. "A new approach based on the surrogating method in the project time compression problems," Annals of Operations Research, Springer, vol. 143(1), pages 237-250, March.
    • Handle: RePEc:spr:annopr:v:143:y:2006:i:1:p:237-250:10.1007/s10479-006-7385-y
    DOI: 10.1007/s10479-006-7385-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-7385-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-7385-y?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. Holmberg, Kaj, 1999. "Exact solution methods for uncapacitated location problems with convex transportation costs," European Journal of Operational Research, Elsevier, vol. 114(1), pages 127-140, April.
    2. Krishan Rana & R. G. Vickson, 1988. "A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership," Transportation Science, INFORMS, vol. 22(2), pages 83-95, May.
    3. Moustapha Diaby, 1993. "Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem," Operations Research, INFORMS, vol. 41(6), pages 1172-1176, December.
    4. Cote, Gilles & Laughton, Michael A., 1984. "Large-scale mixed integer programming: Benders-type heuristics," European Journal of Operational Research, Elsevier, vol. 16(3), pages 327-333, June.
    5. Holmberg, Kaj, 1994. "On using approximations of the Benders master problem," European Journal of Operational Research, Elsevier, vol. 77(1), pages 111-125, August.
    6. Fred Glover, 1975. "Surrogate Constraint Duality in Mathematical Programming," Operations Research, INFORMS, vol. 23(3), pages 434-451, June.
    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. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    2. Walter Rei & Jean-François Cordeau & Michel Gendreau & Patrick Soriano, 2009. "Accelerating Benders Decomposition by Local Branching," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 333-345, May.
    3. Munoz, F.D. & Hobbs, B.F. & Watson, J.-P., 2016. "New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints," European Journal of Operational Research, Elsevier, vol. 248(3), pages 888-898.
    4. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    5. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    6. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    7. Pourbabai, B. & Ashayeri, J. & Van Wassenhove, L.N., 1992. "Strategic marketing, production, and distribution planning of an integrated manufacturing system," Other publications TiSEM 16c2bacb-2c2b-427e-b429-c, Tilburg University, School of Economics and Management.
    8. Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi, 2013. "A novel differential evolution algorithm for binary optimization," Computational Optimization and Applications, Springer, vol. 55(2), pages 481-513, June.
    9. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    10. Siddhartha Syam & Bala Shetty, 1998. "Coordinated replenishments from multiple suppliers with price discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 579-598, September.
    11. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    12. Alidaee, Bahram, 2014. "Zero duality gap in surrogate constraint optimization: A concise review of models," European Journal of Operational Research, Elsevier, vol. 232(2), pages 241-248.
    13. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    14. M. Jenabi & S. Fatemi Ghomi & S. Torabi & S. Hosseinian, 2015. "Acceleration strategies of Benders decomposition for the security constraints power system expansion planning," Annals of Operations Research, Springer, vol. 235(1), pages 337-369, December.
    15. Saïd Hanafi & Christophe Wilbaut, 2011. "Improved convergent heuristics for the 0-1 multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 183(1), pages 125-142, March.
    16. Rodriguez-Martin, Inmaculada & Salazar-Gonzalez, Juan Jose, 2008. "Solving a capacitated hub location problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 468-479, January.
    17. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    18. Mustafa C. Camur & Thomas Sharkey & Chrysafis Vogiatzis, 2022. "The Star Degree Centrality Problem: A Decomposition Approach," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 93-112, January.
    19. Nader Azad & Georgios Saharidis & Hamid Davoudpour & Hooman Malekly & Seyed Yektamaram, 2013. "Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach," Annals of Operations Research, Springer, vol. 210(1), pages 125-163, November.
    20. Qiang Meng & Shuaian Wang & Henrik Andersson & Kristian Thun, 2014. "Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions," Transportation Science, INFORMS, vol. 48(2), pages 265-280, May.

    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:143:y:2006:i:1:p:237-250:10.1007/s10479-006-7385-y. 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.