IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v183y2011i1p47-7310.1007-s10479-009-0574-8.html
   My bibliography  Save this article

Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection

Author

Listed:
  • Fred Glover
  • Lawrence Cox
  • Rahul Patil
  • James Kelly

Abstract

A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentiality of critical components of this data. The challenge is to organize and disseminate data in a form that prevents such critical components from being inferred by groups bent on corporate espionage, to gain competitive advantages, or having a desire to penetrate the security of the information underlying the data. Controlled tabular adjustment is a recently developed approach for protecting sensitive information by imposing a special form of statistical disclosure limitation on tabular data. The underlying model gives rise to a mixed integer linear programming problem involving both continuous and discrete (zero-one) variables. We develop stratified ordered (s-ordered) heuristics and a new meta-heuristic learning approach for solving this model, and compare their performance to previous heuristics and to an exact algorithm embodied in the state-of-the-art ILOG- CPLEX software. Our new approaches are based on partitioning the problem into its discrete and continuous components, first creating an s-ordered heuristic that reduces the number of binary variables through a grouping procedure that combines an exact mathematical programming model with constructive heuristics. To gain further advantages we then replace the mathematical programming model with an evolutionary scatter search approach that makes it possible to extend the method to large problems with over 9000 entries. Finally, we introduce a new metaheuristic learning method that significantly improves the quality of solutions obtained. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Fred Glover & Lawrence Cox & Rahul Patil & James Kelly, 2011. "Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection," Annals of Operations Research, Springer, vol. 183(1), pages 47-73, March.
  • Handle: RePEc:spr:annopr:v:183:y:2011:i:1:p:47-73:10.1007/s10479-009-0574-8
    DOI: 10.1007/s10479-009-0574-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0574-8
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-009-0574-8?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. David R. Karger, 1999. "Random Sampling in Cut, Flow, and Network Design Problems," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 383-413, 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. Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover, 2019. "Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem," Journal of Heuristics, Springer, vol. 25(4), pages 629-642, October.
    2. An Pan & Tsan-Ming Choi, 2016. "An agent-based negotiation model on price and delivery date in a fashion supply chain," Annals of Operations Research, Springer, vol. 242(2), pages 529-557, July.

    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. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware, 2002. "Composite Variable Formulations for Express Shipment Service Network Design," Transportation Science, INFORMS, vol. 36(1), pages 1-20, February.
    2. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware & Alysia M. Wilson, 2004. "UPS Optimizes Its Air Network," Interfaces, INFORMS, vol. 34(1), pages 15-25, February.

    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:183:y:2011:i:1:p:47-73:10.1007/s10479-009-0574-8. 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.