loading
Documents

Research.Publish.Connect.

Paper

Authors: Gustavo Macedo-Barragán 1 ; Samuel Nucamendi-Guillén 1 ; Elías Olivares-Benitez 1 and Omar Rojas 2

Affiliations: 1 Universidad Panamericana, Facultad de Ingeniería, Prolongación Calzada Circunvalación Poniente 49, Zapopan, Jalisco, Mexico ; 2 Universidad Panamericana, Escuela de Ciencias Económicas y Empresariales, Prolongación Calzada Circunvalación Poniente 49, Zapopan, Jalisco, 45010, Mexico

ISBN: 978-989-758-352-0

Keyword(s): Batch Ordering, Heuristic, Mixed Integer Linear Programming, Lot Sizing, Multiple-product, Retail, Single Level.

Abstract: This article presents a mixed integer linear programming method and a heuristic algorithm to deal with the problem of multi-period, multiple-product batch purchases, with a finite time horizon, considering delivery times, order placement costs and independent batch size for each product. The objective of this problem is to minimize the costs of placing purchase orders and inventory. This problem is motivated by its application in a marketing company that handles the sale of fashion products (footwear and accessories) through catalogs and for which excess inventory represents a major problem given the short life cycle of its products. Experimental results show that the heuristic algorithm is able to obtain feasible solutions that improve in cost by up to 37% the best integer solutions reported by the model when it reaches the time limit. To validate the efficiency of the algorithm, a real scenario was solved for a trading company, obtaining results that improve by 28% compared to the c urrent company’s situation. These results show that the heuristic approach is promising in terms of the quality of the solution and the computational time required. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.162.151.77

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Macedo-Barragán, G.; Nucamendi-Guillén, S.; Olivares-Benitez, Elias and Rojas, O. (2019). The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach.In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-352-0, pages 229-236. DOI: 10.5220/0007297402290236

@conference{icores19,
author={Gustavo Macedo{-}Barragán. and Nucamendi{-}Guillén, S. and Olivares{-}Benitez, Elias and Omar G. Rojas.},
title={The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2019},
pages={229-236},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007297402290236},
isbn={978-989-758-352-0},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach
SN - 978-989-758-352-0
AU - Macedo-Barragán, G.
AU - Nucamendi-Guillén, S.
AU - Olivares-Benitez, Elias
AU - Rojas, O.
PY - 2019
SP - 229
EP - 236
DO - 10.5220/0007297402290236

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.