IDEAS home Printed from https://ideas.repec.org/a/wly/isacfm/v5y1996i3p129-145.html
   My bibliography  Save this article

Using Genetic Algorithms to Optimize the Selection of Cost Drivers in Activity‐based Costing

Author

Listed:
  • Alan Levitan
  • Mahesh Gupta

Abstract

In this paper, we address a cost‐drivers optimization (CDO) problem in which two separate but interrelated decisions (i.e. the number of cost drivers needed and which cost drivers to use) are considered. It is desirable to have (1) an optimal selection of cost drivers in order to provide better indication of product costs and (2) an optimal number of cost drivers in order to avoid excessive control costs and to minimize information costs associated with data collection, storage and processing. The objective of the CDO problem is to balance savings in information costs with loss of accuracy. We propose an heuristic procedure based on genetic algorithms as an alternative with the potential to address more generalized objective functions. Genetic algorithms represent an innovative and promising heuristic approach which does produce results superior to published alternatives. The development and implementation of the algorithm is supported with the literature review and comparative analysis. We also comment on the complexity and experimental design issues for addressing large and practical problems.

Suggested Citation

  • Alan Levitan & Mahesh Gupta, 1996. "Using Genetic Algorithms to Optimize the Selection of Cost Drivers in Activity‐based Costing," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 5(3), pages 129-145, September.
    • Handle: RePEc:wly:isacfm:v:5:y:1996:i:3:p:129-145
    DOI: 10.1002/(SICI)1099-1174(199609)5:33.0.CO;2-S
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1099-1174(199609)5:33.0.CO;2-S
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1099-1174(199609)5:33.0.CO;2-S?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
    ---><---

    References listed on IDEAS

    as
    1. Gupta, Mahesh C. & Gupta, Yash P. & Kumar, Anup, 1993. "Minimizing flow time variance in a single machine system using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 70(3), pages 289-303, November.
    2. Glover, Fred & Greenberg, Harvey J., 1989. "New approaches for heuristic search: A bilateral linkage with artificial intelligence," European Journal of Operational Research, Elsevier, vol. 39(2), pages 119-130, March.
    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. James R. Coakley & Carol E. Brown, 2000. "Artificial neural networks in accounting and finance: modeling issues," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 9(2), pages 119-144, June.

    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. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    2. Kumar, Akhilesh & Prakash & Tiwari, M.K. & Shankar, Ravi & Baveja, Alok, 2006. "Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1043-1069, December.
    3. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    4. Y. P. Aneja & S. N. Kabadi & A. Nagar, 1998. "Minimizing weighted mean absolute deviation of flow times in single machine systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 297-311, April.
    5. 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.
    6. Cai, X., 1995. "Minimization of agreeably weighted variance in single machine systems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 576-592, September.
    7. N. K. Jaiswal & Meena Kumari & B. S. Nagabhushana, 1995. "Optimal force mix in heterogeneous combat," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 873-887, September.
    8. 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.
    9. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    10. Otto, Alena & Scholl, Armin, 2011. "Incorporating ergonomic risks into assembly line balancing," European Journal of Operational Research, Elsevier, vol. 212(2), pages 277-286, July.
    11. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    12. Gowrishankar, K. & Rajendran, Chandrasekharan & Srinivasan, G., 2001. "Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date," European Journal of Operational Research, Elsevier, vol. 132(3), pages 643-665, August.
    13. Srivastava, Bharatendu & Chen, Wun-Hwa, 1996. "Batching in production planning for flexible manufacturing systems," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 127-137, June.
    14. Tiku T. Tanyimboh & Anna M. Czajkowska, 2018. "Joint Entropy Based Multi-Objective Evolutionary Optimization of Water Distribution Networks," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(8), pages 2569-2584, June.
    15. Lokketangen, Arne & Glover, Fred, 1998. "Solving zero-one mixed integer programming problems using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 624-658, April.
    16. Tiku T. Tanyimboh & Anna Czajkowska, 2018. "Self-Adaptive Solution-Space Reduction Algorithm for Multi-Objective Evolutionary Design Optimization of Water Distribution Networks," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(10), pages 3337-3352, August.
    17. Matthew J. Realff & George Stephanopoulos, 1998. "On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 56-71, February.

    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:wly:isacfm:v:5:y:1996:i:3:p:129-145. 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: http://www.interscience.wiley.com/jpages/1099-1174/ .

    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.