Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm

© IEOM Society International. Activity-based costing (ABC) system more precisely allocates the overhead costs to cost objects (products, services or customers) than traditional costing systems. In ABC, resources are consumed by the activities, and multiple cost drivers are used to allocate the costs...

Full description

Saved in:
Bibliographic Details
Main Authors: Rungchat Chompu-Inwai, Trasapong Thaiupathump
Format: Conference Proceeding
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018951833&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/46509
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-46509
record_format dspace
spelling th-cmuir.6653943832-465092018-04-25T07:29:53Z Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm Rungchat Chompu-Inwai Trasapong Thaiupathump Decision Sciences Engineering Agricultural and Biological Sciences © IEOM Society International. Activity-based costing (ABC) system more precisely allocates the overhead costs to cost objects (products, services or customers) than traditional costing systems. In ABC, resources are consumed by the activities, and multiple cost drivers are used to allocate the costs of activities to the products. The selection of activity and cost drivers is then highly significant. Using too few cost drivers may result in low level of accuracy in allocating the overhead costs. On the other hands, a high accuracy normally requires a large number of cost drivers which would be very time-consuming and expensive in data collection, processing, and reporting. Therefore, the trade-off between the product cost accuracy and the ABC complexity is crucial. Using appropriate number of cost drivers is required to achieve a satisfactory level of information cost and accuracy, as well as to make the ABC system simpler to implement. The cost-drivers optimization (CDO) problem focuses on selecting the representative cost drivers by considering the trade-off between the information-gathering costs and the benefits of precise costing. Recently, many approaches have been applied to solve the CDO problem. In this paper, Shuffled Frog Leaping Algorithm (SFLA), a meta-heuristic method for finding optimal solutions, is applied in selecting optimal representative cost drivers. The objective function of the algorithm is the cost saving from the information gathering cost of eliminated cost drivers minus the loss of accuracy cost. With computational results, SFLA can effectively find the optimal cost driver combination that has the optimal objective function value. Convergence performances of the best and average objective function value are presented. 2018-04-25T06:55:53Z 2018-04-25T06:55:53Z 2017-01-01 Conference Proceeding 21698767 2-s2.0-85018951833 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018951833&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/46509
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Decision Sciences
Engineering
Agricultural and Biological Sciences
spellingShingle Decision Sciences
Engineering
Agricultural and Biological Sciences
Rungchat Chompu-Inwai
Trasapong Thaiupathump
Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm
description © IEOM Society International. Activity-based costing (ABC) system more precisely allocates the overhead costs to cost objects (products, services or customers) than traditional costing systems. In ABC, resources are consumed by the activities, and multiple cost drivers are used to allocate the costs of activities to the products. The selection of activity and cost drivers is then highly significant. Using too few cost drivers may result in low level of accuracy in allocating the overhead costs. On the other hands, a high accuracy normally requires a large number of cost drivers which would be very time-consuming and expensive in data collection, processing, and reporting. Therefore, the trade-off between the product cost accuracy and the ABC complexity is crucial. Using appropriate number of cost drivers is required to achieve a satisfactory level of information cost and accuracy, as well as to make the ABC system simpler to implement. The cost-drivers optimization (CDO) problem focuses on selecting the representative cost drivers by considering the trade-off between the information-gathering costs and the benefits of precise costing. Recently, many approaches have been applied to solve the CDO problem. In this paper, Shuffled Frog Leaping Algorithm (SFLA), a meta-heuristic method for finding optimal solutions, is applied in selecting optimal representative cost drivers. The objective function of the algorithm is the cost saving from the information gathering cost of eliminated cost drivers minus the loss of accuracy cost. With computational results, SFLA can effectively find the optimal cost driver combination that has the optimal objective function value. Convergence performances of the best and average objective function value are presented.
format Conference Proceeding
author Rungchat Chompu-Inwai
Trasapong Thaiupathump
author_facet Rungchat Chompu-Inwai
Trasapong Thaiupathump
author_sort Rungchat Chompu-Inwai
title Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm
title_short Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm
title_full Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm
title_fullStr Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm
title_full_unstemmed Optimal cost driver selection in activity-based costing using Shuffled frog leaping algorithm
title_sort optimal cost driver selection in activity-based costing using shuffled frog leaping algorithm
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018951833&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/46509
_version_ 1681422887793197056