Published

2021-10-29

An Efficient Algorithm Applied to Optimized Billing Sequencing

Un algoritmo eficiente aplicado a la secuencia de facturación optimizada

DOI:

https://doi.org/10.15446/ing.investig.v42n2.83394

Keywords:

Iterative Greedy Algorithm, Genetic Algorithm, Maximize Billing, Distribution Center. (en)
Algoritmo Guloso Iterativo, Algoritmo Genético, Maximizar Facturación, Centro de Distribución. (es)

Downloads

Authors

This paper addresses the Optimized Billing Sequencing (OBS) problem to maximize billing of the order portfolio of a typical Distribution Center (DC). This is a new problem in the literature, and the search for the best billing mix has generated demands for better optimization methods for DCs. Therefore, the objective of this paper is to provide an effective algorithm that presents quick and optimized solutions for higher-complexity OBS levels. This algorithm is called Iterative Greedy Algorithm (IGA-OBS), and its performance is compared to the genetic algorithm (GA-OBS) by Pinto and Nagano. Performance evaluations were carried out after intense computational experiments for problems with different complexity levels. The results demonstrate that the GA-OBS is limited to medium-size instances, whereas the IGA-OBS is better adapted to reality, providing OBS with solutions with satisfactory time and quality. The IGA-OBS enables managers to make decisions in a more agile and consistent way in terms of the trade-off between the level of customer service and the maximization of the financial result of DCs. This paper fills a gap in the literature, makes innovative contributions, and provides suggestions for further research aimed at developing more suitable optimization methods for OBS.

Este documento aborda el problema de la Secuenciación Optimizada de Facturación (OBS) para maximizar la facturación de la cartera de pedidos de un centro de distribución (CD) típico. Este es un nuevo problema en la literatura, y la búsqueda de la mejor combinación de facturación ha exigido mejores métodos para optimizar los CD. Por lo tanto, el objetivo de este artículo es proporcionar un algoritmo eficaz que presente soluciones rápidas y optimizadas para niveles más altos de complejidad OBS. Este algoritmo se denomina Algoritmo Voraz Iterativo (IGA-OBS) y su rendimiento se compara con el del algoritmo genético (GA-OBS) de Pinto y Nagano. Se llevaron a cabo evaluaciones de desempeño después de intensos experimentos computacionales para problemas con diferentes niveles de complejidad. Los resultados demuestran que el GA-OBS se limita a instancias de tamaño medio, mientras que el IGA-OBS se adapta mejor a la realidad brindando soluciones en tiempo y calidad satisfactorios a OBS. El IGA-OBS permite a los gerentes tomar decisiones de una manera mas ágil y consistente frente al trade-off entre el nivel de servicio al cliente y la maximización del resultado financiero de los CD. Este artículo llena un vacío en la literatura, aporta contribuciones innovadoras y proporciona sugerencias para futuras investigaciones destinadas a desarrollar métodos de optimización más adecuados para OBS.

References

Bandyopadhyay, S. and Bhattacharya, R. (2014). Solving a tri-objective supply chain problem with modified NSGA-II algorithm. Journal of Manufacturing Systems, 33(1), 41-50. https://doi.org/10.1016/j.jmsy.2013.12.001

Baud-Lavigne, B., Bassetto, S., and Agard, B. (2014). A method for robust optimization of joint product and supply chain design. Journal of Intelligent Manufacturing, 27(4), 741-749. https://doi.org/10.1007/s10845-014-0908-5

Bottani, E., Cecconi, M., Vignali, G., and Montanari, R. (2012). Optimization of storage allocation in order picking operations through a genetic algorithm. International Journal of Logistics Research and Applications, 15(2), 127-146. https://doi.org/10.1080/13675567.2012.694860

Boysen, N., De Koster, R., and Weidinger, F. (2019). Warehousing in the e-commerce era: A survey. European Journal of Operational Research. 277(2), 396-411. https://doi.org/10.1016/j.ejor.2018.08.023

Chien, C., Kim, K. H., Liu, B., and Gen, M. (2012). Advanced decision and intelligence technologies for manufacturing and logistics. Journal of Intelligent Manufacturing, 23(6), 2133-2135. https://doi.org/10.1007/s10845-011-0559-8

De Jong, K. (1988). Learning with genetic algorithms: An overview. Machine Learning, 3(2-3), 121-138. https://doi.org/10.1007/BF00113894

Diabat, A. (2014). Hybrid algorithm for a vendor-managed inventory system in a two-echelon supply chain. European Journal of Operational Research, 238(1), 114-121. https://doi.org/10.1016/j.ejor.2014.02.061

Diabat, A. and Deskoores, R. M. (2016). A hybrid genetic algorithm-based heuristic for an integrated supply chain problem. Journal of Manufacturing Systems, 38, 172-180. https://doi.org/10.1016/j.jmsy.2015.04.011

Gen, M., Cheng, R., and Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithms approach. Springer. https://doi.org/10.1007/978-1-84800-181-7

Ghiami, Y., Williams, T., and Wu, Y. (2013). A two-echelon inventory model for a deteriorating item with stock-dependent demand, partial backlogging, and capacity constraints. Euro-pean Journal of Operational Research, 231(3), 587-597. https://doi.org/10.1016/j.ejor.2013.06.015

Haq, A. N., and Boddu, V. (2014). Analysis of enablers for the implementation of leagile supply chain management using an integrated fuzzy QFD approach. Journal of Intelligent Manufacturing, 28(1), 1-12. https://doi.org/10.1007/s10845-014-0957-9

Haupt, R. L. and Haupt, S. E. (2004). Practical genetic algorithms (2nd ed.). Wiley. DOI: https://doi.org/10.1002/0471671746

Holland, J. H. (1975). Adaptation in natural and artificial systems. University of Michigan Press.

Huang, H. and Ke, H. (2017). Pricing decision problem for substitutable products based on uncertainty theory. Journal of Intelligent Manufacturing, 28(3), 503-514. https://doi.org/10.1007/s10845-014-0991-7

İnkaya, T. and Akansel, M. (2017). Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach. Journal of Intelligent Manufacturing, 28(4), 1005-1015. https://doi.org/10.1007/s10845-015-1041-9

Kumar, R. S., Tiwari, M., and Goswami, A. (2016). Two-echelon fuzzy stochastic supply chain for the manufacturer-buyer integrated production-inventory system. Journal of Intelligent Manufacturing, 27(4), 875-888. https://doi.org/10.1007/s10845-014-0921-8

Ledari, A. M., Pasandideh, S. H. R., and Koupaei, M. N. (2018). A new newsvendor policy model for dual-sourcing supply chains by considering disruption risk and special order. Journal of Intelligent Manufacturing, 25(6), 1367-1376. https://doi.org/10.1007/s10845-015-1104-y

Leung, K., Choy, K., Siu, P. K., Ho, G., Lam, H., and Lee, C. K. (2018). A B2C e-commerce intelligent system for re-engineering the e-order fulfillment process. Expert Systems with Applications, 91, 386-401. https://doi.org/10.1016/j.eswa.2017.09.026

Man, K. F., Tang, K. S., and Kwong, S. (1996). Genetic Algorithms: Concepts and Applications. IEEE Transactions on Industrial Electronics, 43(5), 519-534. https://doi.org/10.1109/41.538609

Matthews, J. and Visagie, S. (2013). Order sequencing on a unidirectional cyclical picking line. European Journal of Operational Research, 231(1), 79-87. https://doi.org/10.1016/j.ejor.2013.05.011

Marchet, G., Melacini, M., and Perotti, S. (2015). Investigating order picking system adoption: a case-study-based approach. International Journal of Logistics Research and Applications, 18(1), 82-98. https://doi.org/10.1080/13675567.2014.945400

Mousavi, S. M., Bahreininejad, A., Musa, S. N., and Yusof, F. (2017). A modified particle swarm optimization for solving the integrated location and inventory control problems in a two-echelon supply chain network. Journal of Intelligent Manufacturing, 28(1), 191-206. https://doi.org/10.1007/s10845-014-0970-z

Mousavi, S. M., Hajipour, V., Niaki, S. T. A., and Alikar, N. (2013). Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: two calibrated me-ta-heuristic algorithms. Applied Mathematical Modelling, 37(4), 2241-2256. https://doi.org/10.1016/j.apm.2012.05.019

Park, K. and Kyung, G. (2014). Optimization of total inventory cost and order fill rate in a supply chain using PSO. The International Journal of Advanced Manufacturing Technology, 70(9-12), 1533-1541. https://doi.org/10.1007/s00170-013-5399-6

Pinto, A. R. F., Crepaldi, A. F., and Nagano, M. S. (2018). A Genetic Algorithm applied to pick sequencing for billing. Journal of Intelligent Manufacturing, 29(2), 405-422. https://doi.org/10.1007/s10845-015-1116-7

Pinto, A. R. F. and Nagano, M. S. (2019). An approach for the solution to order batching and sequencing in picking systems. Production Engineering Research and Development, 13(3-4), 325-341. https://doi.org/10.1007/s11740-019-00904-4

Pinto, A. R. F., and Nagano, M. S. (2020). Genetic algorithms applied to integration and optimization of billing and picking processes. Journal of Intelligent Manufacturing, 31(3), 641-659. https://doi.org/10.1007/s10845-019-01470-3

Richards, G. (2011). Warehouse Management: A complete guide to improving efficiency and minimizing costs in the modern warehouse. Kogan Page.

Rim, S. C. and Park, I. S. (2008). Order picking plan to maximize the order fill rate. Computers and Industrial Engineering, 55(3), 557-566. https://doi.org/10.1016/j.cie.2008.01.012

Sereshti, N. and Bijari, M. (2013). Profit maximization in simultaneous lot-sizing and scheduling problems. Applied Mathematical Modelling, 37(23), 9516-9523. https://doi.org/10.1016/j.apm.2013.05.004

Seyedrezaei, M., Najafi, S. E., Aghajani, A., and Valami, H. B. (2012). Designing a Genetic Algorithm to Optimize Fulfilled Orders in Order Picking Planning Problem with Probabilistic Demand. International Journal, 1(2), 40-57. http://www.riejournal.com/article_47673_0bc47688fe20f8368d8d6f2752146e3e.pdf

Slotnick, S. A. (2011). Order acceptance and scheduling: a taxonomy and review. European Journal of Operational Research, 212(1), 1-11. https://doi.org/10.1016/j.ejor.2010.09.042

van den Berg, J. P., and Zijm, W. H. M. (1999). Models for warehouse management: Classification and examples. International Journal of Production Economics, 59(1), 519-528. https://doi.org/10.1016/S0925-5273(98)00114-5

How to Cite

APA

Pinto, A. R. F. & Nagano, M. S. (2022). An Efficient Algorithm Applied to Optimized Billing Sequencing. Ingeniería e Investigación, 42(2), e83394. https://doi.org/10.15446/ing.investig.v42n2.83394

ACM

[1]
Pinto, A.R.F. and Nagano, M.S. 2022. An Efficient Algorithm Applied to Optimized Billing Sequencing. Ingeniería e Investigación. 42, 2 (Apr. 2022), e83394. DOI:https://doi.org/10.15446/ing.investig.v42n2.83394.

ACS

(1)
Pinto, A. R. F.; Nagano, M. S. An Efficient Algorithm Applied to Optimized Billing Sequencing. Ing. Inv. 2022, 42, e83394.

ABNT

PINTO, A. R. F.; NAGANO, M. S. An Efficient Algorithm Applied to Optimized Billing Sequencing. Ingeniería e Investigación, [S. l.], v. 42, n. 2, p. e83394, 2022. DOI: 10.15446/ing.investig.v42n2.83394. Disponível em: https://revistas.unal.edu.co/index.php/ingeinv/article/view/83394. Acesso em: 13 mar. 2026.

Chicago

Pinto, Anderson Rogério Faia, and Marcelo Seido Nagano. 2022. “An Efficient Algorithm Applied to Optimized Billing Sequencing”. Ingeniería E Investigación 42 (2):e83394. https://doi.org/10.15446/ing.investig.v42n2.83394.

Harvard

Pinto, A. R. F. and Nagano, M. S. (2022) “An Efficient Algorithm Applied to Optimized Billing Sequencing”, Ingeniería e Investigación, 42(2), p. e83394. doi: 10.15446/ing.investig.v42n2.83394.

IEEE

[1]
A. R. F. Pinto and M. S. Nagano, “An Efficient Algorithm Applied to Optimized Billing Sequencing”, Ing. Inv., vol. 42, no. 2, p. e83394, Apr. 2022.

MLA

Pinto, A. R. F., and M. S. Nagano. “An Efficient Algorithm Applied to Optimized Billing Sequencing”. Ingeniería e Investigación, vol. 42, no. 2, Apr. 2022, p. e83394, doi:10.15446/ing.investig.v42n2.83394.

Turabian

Pinto, Anderson Rogério Faia, and Marcelo Seido Nagano. “An Efficient Algorithm Applied to Optimized Billing Sequencing”. Ingeniería e Investigación 42, no. 2 (April 1, 2022): e83394. Accessed March 13, 2026. https://revistas.unal.edu.co/index.php/ingeinv/article/view/83394.

Vancouver

1.
Pinto ARF, Nagano MS. An Efficient Algorithm Applied to Optimized Billing Sequencing. Ing. Inv. [Internet]. 2022 Apr. 1 [cited 2026 Mar. 13];42(2):e83394. Available from: https://revistas.unal.edu.co/index.php/ingeinv/article/view/83394

Download Citation

CrossRef Cited-by

CrossRef citations3

1. Leandro Gumieri, Anderson Rogério Faia Pinto, Jorge Alberto Achcar, José Luís Garcia Hermosilla, Rafael Henrique Faia Pinto. (2025). Análise dos fatores gerenciais associados ao desempenho financeiro de Micro e Pequenas Empresas de Barretos (SP). International Journal of Innovation, 13(2), p.e26464. https://doi.org/10.5585/2025.26464.

2. Fatemeh Nikkhoo, Ali Husseinzadeh Kashan, Ehsan Nikbakhsh, Bakhtiar Ostadi. (2025). A bi-objective multi-warehouse multi-period order picking system under uncertainty: a benders decomposition approach. Soft Computing, 29(4), p.2047. https://doi.org/10.1007/s00500-025-10495-1.

3. Anderson Rogério Faia Pinto, Marcelo Seido Nagano. (2024). Warehousing and Material Handling Systems for the Digital Industry. , p.73. https://doi.org/10.1007/978-3-031-50273-6_4.

Dimensions

PlumX

Article abstract page views

1164

Downloads

Download data is not yet available.