A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study

Ridha Erromdhani; Abdelwaheb Rebaï

doi:doi:10.11648/j.ijmfs.20210701.11

| Peer-Reviewed

A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study

Ridha Erromdhani, Abdelwaheb Rebaï

Published in International Journal of Management and Fuzzy Systems (Volume 7, Issue 1)

Received: 20 February 2021 Accepted: 17 March 2021 Published: 30 March 2021

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Our research focuses on the development of two algorithms based on the mathematical programming and local search procedures for resolution the Multi-Item Capacitated Lot Sizing Problem and Vehicle Routing Problem (MICLSP-VRP). It concerns so a particularly important and difficult problem in the strong sense for solving. In particular, our study is motivated by a real case study in a butcher’s shop firm whose meat processing. Several production lines are considered of (turkey and chicken) items and a fleet of vehicles that is used to deliver. In this study, an effective approach based on the local search and accurate mixed integer programming model is presented to solve multi-item capacitated lot sizing problem and vehicle routing problem with delivery time windows. This consists of determining the production quantities at each site by minimizing the cost of transport and solving the sub problem. By considering an integrated approach, the computational results of a case study show a 25.33% percent decrease in the total cost production.

Published in	International Journal of Management and Fuzzy Systems (Volume 7, Issue 1)
DOI	10.11648/j.ijmfs.20210701.11
Page(s)	1-10
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2021. Published by Science Publishing Group

Keywords

Production Routing Problem, Lot Sizing Problem, Agro Alimentary Industry, Local Search

References

[1]	Amorim, P., Gunther, H. O. and Almada-Lobo, B. Multi-objective integrated production and distribution planning of perishable products. International Journal Production Economics, (2012).138, 89-101.
[2]	Bard, J. F. and Nananukul, N. The integrated production-inventory-distribution- routing problem. Journal of Scheduling, (2009). 3, 257–280.
[3]	Boudia, M., Louly, M. A. O. and Prins, C. A reactive GRASP and path relinking for a combined production-distribution problem. Computers & Operations Research, (2007). 34, 3402-3419.
[4]	Chandra, P. and Fisher, M. L. Coordination of production and distribution planning. European Journal of Operational Research, (1994). 72, 503–517.
[5]	Chern, C. C. and Hsieh, J. S. A heuristic algorithm for master planning that satisfies multiple objectives. Computers & Operations Research, (2007). 34, 3491-3513.
[6]	Chen, W. H. and Thizy, J. M. Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research, (1990). 26, 29-72.
[7]	Eppen, G. D. and Martin, R. K. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Operations Research, (1987). 35, 832–848.
[8]	Erromdhani, R., Eddaly, M., and Rebai, A. Hierarchical production planning with flexibility in agroalimentary environment: a case study. Journal of Intelligent Manufacturing, (2012). 23, 811–819.
[9]	Glover, F., Jones, G., Karney, D., Klingman, D. and Mote, J. An integrated production, distribution, and inventory planning system. Interfaces,(1979). 9, 21–35.
[10]	Hwang, H. C. and Jaruphongsa, W. Dynamic lot-sizing model with demand time windows and speculative cost structure. Operations Research Letters, (2006). 34, 251–256.
[11]	Kanchanasuntorn, K. and Techanitisawad, A. An approximate periodic model for fixed-life perishable products in a two-echelon inventory-distribution system. International Journal of Production Economics, (2006). 100, 101-115.
[12]	Lei, L., Liu, S., Park, S. and Ruszczynski, A. On the integrated production, inventory, and distribution routing problem. IIE Transactions, (2006). 38, 955–970.
[13]	Lejeune, M. A. A variable neighborhood decomposition search method for supply chain management planning problems. European Journal of Operational Research, (2006). 175, 959-976.
[14]	Mladenovic, N., Todosijevic, R., and Urosevic, D. AN EFFICIENT GENERALVARIABLE NEIGHBORHOOD SEARCH FOR LARGE TRAVELLING SALESMAN PROBLEM WITH TIME WINDOWS. Yugoslav Journal of Operations Research, (2013).23, 19–30.
[15]	Neves-Moreira, F., Almada-Lobo, B., Cordeau, J. F, Guimarães, L. and Jans, R. Solving a large multi-productproduction-routing problem with delivery time windows. Omega, (2018).1-19.
[16]	Nezhad, A. M., Manzour, H. and Salhi, S. Lagrangian relaxation heuristics for the uncapacitated single source multi-product facility location problem. International Journal Production Economics, (2013).145, 713-723.
[17]	Pochet, Y. and Wolsey, L. A. Production Planning By Mixed Integer Programming. Springer Series in Operations Research and Financial Engineering. (2006).
[18]	Sambasivan, M. and Yahya, S. A Lagrangean-based Heuristic for Multi-plant, Multi-item, Multi-period Capacitated Lot-sizing Problems with Inter-plant Transfers. Computers & Operations Research, (2005). 32, 537–555.
[19]	Solyali, Q., Süral, H. A Relaxation Based Solution Approach for the Inventory Control and Vehicle Routing Problem in Vendor Managed Systems. Modeling Computation and Optimization, (2009). 2000, 171-189.
[20]	Thomas, L. J., Trigeiro, W. W. and McClain, J. O. Capacitated Lot Sizing with Setup Times. Management Science, (1989). 35, 353–366.
[21]	Wolsey, L. A. Lot-sizing with production and delivery time windows. Mathematical Programming, (2006). 107, 471–489.
[22]	Yee Lee, C., Çetinkaya, S., and Wagelmans, A. P. M. A Dynamic Lot-Sizing Model with Demand Time Windows. Management Science, (2000).47, 1384-1395.

Cite This Article

Plain Text BibTeX RIS

APA Style

Ridha Erromdhani, Abdelwaheb Rebaï. (2021). A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study. International Journal of Management and Fuzzy Systems, 7(1), 1-10. https://doi.org/10.11648/j.ijmfs.20210701.11

Copy | Download

ACS Style

Ridha Erromdhani; Abdelwaheb Rebaï. A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study. Int. J. Manag. Fuzzy Syst. 2021, 7(1), 1-10. doi: 10.11648/j.ijmfs.20210701.11

Copy | Download

AMA Style

Ridha Erromdhani, Abdelwaheb Rebaï. A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study. Int J Manag Fuzzy Syst. 2021;7(1):1-10. doi: 10.11648/j.ijmfs.20210701.11

Copy | Download

@article{10.11648/j.ijmfs.20210701.11,
  author = {Ridha Erromdhani and Abdelwaheb Rebaï},
  title = {A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study},
  journal = {International Journal of Management and Fuzzy Systems},
  volume = {7},
  number = {1},
  pages = {1-10},
  doi = {10.11648/j.ijmfs.20210701.11},
  url = {https://doi.org/10.11648/j.ijmfs.20210701.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijmfs.20210701.11},
  abstract = {Our research focuses on the development of two algorithms based on the mathematical programming and local search procedures for resolution the Multi-Item Capacitated Lot Sizing Problem and Vehicle Routing Problem (MICLSP-VRP). It concerns so a particularly important and difficult problem in the strong sense for solving. In particular, our study is motivated by a real case study in a butcher’s shop firm whose meat processing. Several production lines are considered of (turkey and   chicken) items and a fleet of vehicles that is used to deliver. In this study, an effective approach based on the local search and accurate mixed integer programming model is presented to solve multi-item capacitated lot sizing problem and vehicle routing problem with delivery time windows. This consists of determining the production quantities at each site by minimizing the cost of transport and solving the sub problem. By considering an integrated approach, the computational results of a case study show a 25.33% percent decrease in the total cost production.},
 year = {2021}
}

Copy | Download

TY  - JOUR
T1  - A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study
AU  - Ridha Erromdhani
AU  - Abdelwaheb Rebaï
Y1  - 2021/03/30
PY  - 2021
N1  - https://doi.org/10.11648/j.ijmfs.20210701.11
DO  - 10.11648/j.ijmfs.20210701.11
T2  - International Journal of Management and Fuzzy Systems
JF  - International Journal of Management and Fuzzy Systems
JO  - International Journal of Management and Fuzzy Systems
SP  - 1
EP  - 10
PB  - Science Publishing Group
SN  - 2575-4947
UR  - https://doi.org/10.11648/j.ijmfs.20210701.11
AB  - Our research focuses on the development of two algorithms based on the mathematical programming and local search procedures for resolution the Multi-Item Capacitated Lot Sizing Problem and Vehicle Routing Problem (MICLSP-VRP). It concerns so a particularly important and difficult problem in the strong sense for solving. In particular, our study is motivated by a real case study in a butcher’s shop firm whose meat processing. Several production lines are considered of (turkey and   chicken) items and a fleet of vehicles that is used to deliver. In this study, an effective approach based on the local search and accurate mixed integer programming model is presented to solve multi-item capacitated lot sizing problem and vehicle routing problem with delivery time windows. This consists of determining the production quantities at each site by minimizing the cost of transport and solving the sub problem. By considering an integrated approach, the computational results of a case study show a 25.33% percent decrease in the total cost production.
VL  - 7
IS  - 1
ER  -

Copy | Download

Author Information

Ridha Erromdhani

Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems, Faculty of Economics and Management, University of Sfax, Sfax, Tunisia
Abdelwaheb Rebaï

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Ridha Erromdhani, Abdelwaheb Rebaï. (2021). A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study. International Journal of Management and Fuzzy Systems, 7(1), 1-10. https://doi.org/10.11648/j.ijmfs.20210701.11

Copy | Download

ACS Style

Ridha Erromdhani; Abdelwaheb Rebaï. A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study. Int. J. Manag. Fuzzy Syst. 2021, 7(1), 1-10. doi: 10.11648/j.ijmfs.20210701.11

Copy | Download

AMA Style

Ridha Erromdhani, Abdelwaheb Rebaï. A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study. Int J Manag Fuzzy Syst. 2021;7(1):1-10. doi: 10.11648/j.ijmfs.20210701.11

Copy | Download

@article{10.11648/j.ijmfs.20210701.11,
  author = {Ridha Erromdhani and Abdelwaheb Rebaï},
  title = {A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study},
  journal = {International Journal of Management and Fuzzy Systems},
  volume = {7},
  number = {1},
  pages = {1-10},
  doi = {10.11648/j.ijmfs.20210701.11},
  url = {https://doi.org/10.11648/j.ijmfs.20210701.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijmfs.20210701.11},
  abstract = {Our research focuses on the development of two algorithms based on the mathematical programming and local search procedures for resolution the Multi-Item Capacitated Lot Sizing Problem and Vehicle Routing Problem (MICLSP-VRP). It concerns so a particularly important and difficult problem in the strong sense for solving. In particular, our study is motivated by a real case study in a butcher’s shop firm whose meat processing. Several production lines are considered of (turkey and   chicken) items and a fleet of vehicles that is used to deliver. In this study, an effective approach based on the local search and accurate mixed integer programming model is presented to solve multi-item capacitated lot sizing problem and vehicle routing problem with delivery time windows. This consists of determining the production quantities at each site by minimizing the cost of transport and solving the sub problem. By considering an integrated approach, the computational results of a case study show a 25.33% percent decrease in the total cost production.},
 year = {2021}
}

Copy | Download

TY  - JOUR
T1  - A Local Search for Solving the Multi-item Capacitated Lot Sizing Problem and Vehicle Routing: A Case Study
AU  - Ridha Erromdhani
AU  - Abdelwaheb Rebaï
Y1  - 2021/03/30
PY  - 2021
N1  - https://doi.org/10.11648/j.ijmfs.20210701.11
DO  - 10.11648/j.ijmfs.20210701.11
T2  - International Journal of Management and Fuzzy Systems
JF  - International Journal of Management and Fuzzy Systems
JO  - International Journal of Management and Fuzzy Systems
SP  - 1
EP  - 10
PB  - Science Publishing Group
SN  - 2575-4947
UR  - https://doi.org/10.11648/j.ijmfs.20210701.11
AB  - Our research focuses on the development of two algorithms based on the mathematical programming and local search procedures for resolution the Multi-Item Capacitated Lot Sizing Problem and Vehicle Routing Problem (MICLSP-VRP). It concerns so a particularly important and difficult problem in the strong sense for solving. In particular, our study is motivated by a real case study in a butcher’s shop firm whose meat processing. Several production lines are considered of (turkey and   chicken) items and a fleet of vehicles that is used to deliver. In this study, an effective approach based on the local search and accurate mixed integer programming model is presented to solve multi-item capacitated lot sizing problem and vehicle routing problem with delivery time windows. This consists of determining the production quantities at each site by minimizing the cost of transport and solving the sub problem. By considering an integrated approach, the computational results of a case study show a 25.33% percent decrease in the total cost production.
VL  - 7
IS  - 1
ER  -

Copy | Download