IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v31y2025i3d10.1007_s10732-025-09563-4.html
   My bibliography  Save this article

A Tabu-Bi-label hybridized branch and price algorithm for just-in-time material handling scheduling problems of mixed-model assembly lines with electric vehicle recharging requirements

Author

Listed:
  • Yufan Huang

    (Tongji University)

  • Binghai Zhou

    (Tongji University)

Abstract

Driven by the highly-diversified customer demand, mixed-model automobile assembly lines (MMAALs) have been widely applied to enable the mass production of customized automobiles. Meanwhile, an inexorable trend in the green and sustainable production has promoted the optimization of material handling scheduling, which constitutes a large proportion of the energy consumption in the automobile production. Therefore, to deal with both manufacturing and energy issues, this article employed electric vehicles (EVs) and proposed a supermarket integrated MMAAL material handling scheduling problem under JIT settings with EV recharging requirements. A mixed integer linear programming model is consequently established, aiming to minimize the number of EVs for reducing cost as well as saving energy. In order to obtain the global optimal solution, a Tabu-Bi-Label Hybridized Branch and Price Algorithm (TBHBP) algorithm is developed, a heuristic Tabu Search algorithm is combined with a modified Bidirectional Labeling for achieving much faster speed while maintaining a high solution quality. Computational experiments on TBHBP along with a case study are carried out and compared with benchmark algorithms, the results of which verified the efficiency and effectiveness of TBHBP in dealing with the proposed problem.

Suggested Citation

  • Yufan Huang & Binghai Zhou, 2025. "A Tabu-Bi-label hybridized branch and price algorithm for just-in-time material handling scheduling problems of mixed-model assembly lines with electric vehicle recharging requirements," Journal of Heuristics, Springer, vol. 31(3), pages 1-34, September.
    • Handle: RePEc:spr:joheur:v:31:y:2025:i:3:d:10.1007_s10732-025-09563-4
    DOI: 10.1007/s10732-025-09563-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-025-09563-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-025-09563-4?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Lee, In Gyu & Yoon, Sang Won & Won, Daehan, 2022. "A Mixed Integer Linear Programming Support Vector Machine for Cost-Effective Group Feature Selection: Branch-Cut-and-Price Approach," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1055-1068.
    2. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    3. Yang, Weibo & Ke, Liangjun & Wang, David Z.W. & Lam, Jasmine Siu Lee, 2021. "A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    4. Boysen, Nils & Bock, Stefan, 2011. "Scheduling just-in-time part supply for mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 211(1), pages 15-25, May.
    5. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    6. repec:dau:papers:123456789/14496 is not listed on IDEAS
    7. Guy Desaulniers & Fausto Errico & Stefan Irnich & Michael Schneider, 2016. "Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 64(6), pages 1388-1405, December.
    8. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    9. Mustapha Sali & Evren Sahin & Alain Patchong, 2015. "An empirical assessment of the performances of three line feeding modes used in the automotive sector: line stocking vs. kitting vs. sequencing," Post-Print hal-01508414, HAL.
    10. Chen, Yuanyi & Hu, Simon & Zheng, Yanchong & Xie, Shiwei & Yang, Qiang & Wang, Yubin & Hu, Qinru, 2024. "Coordinated optimization of logistics scheduling and electricity dispatch for electric logistics vehicles considering uncertain electricity prices and renewable generation," Applied Energy, Elsevier, vol. 364(C).
    11. Boysen, Nils & Emde, Simon, 2014. "Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79439, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    12. Emde, Simon & Boysen, Nils, 2012. "Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 217(2), pages 287-299.
    13. Z Xiaobo & Z Zhou, 1999. "Algorithms for Toyota's goal of sequencing mixed models on an assembly line with multiple workstations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 704-710, July.
    14. Simon Emde & Malte Fliedner & Nils Boysen, 2012. "Optimally loading tow trains for just-in-time supply of mixed-model assembly lines," IISE Transactions, Taylor & Francis Journals, vol. 44(2), pages 121-135.
    15. C. Briand & Y. He & S. U. Ngueveu, 2018. "Energy-efficient planning for supplying assembly lines with vehicles," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 387-414, December.
    16. Emde, Simon & Fliedner, Malte & Boysen, Nils, 2012. "Optimally loading tow trains for just-in-time supply of mixed-model assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79434, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    17. Mustapha Sali & Evren Sahin & Alain Patchong, 2015. "An empirical assessment of the performances of three line feeding modes used in the automotive sector: line stocking vs. kitting vs. sequencing," International Journal of Production Research, Taylor & Francis Journals, vol. 53(5), pages 1439-1459, March.
    18. Yunfang Peng & Chenting Wu & Wenqing Shao & Beixin Xia, 2024. "Collaborative optimization of route planning and just-in-time scheduling for mixed-model assembly lines," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(11), pages 2185-2199, November.
    19. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
    20. Boysen, Nils & Emde, Simon, 2014. "Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets," European Journal of Operational Research, Elsevier, vol. 239(3), pages 820-829.
    Full references (including those not matched with items on IDEAS)

    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. Stefan Helber & Carolin Kellenbrink & Insa Südbeck, 2024. "Evaluation of stochastic flow lines with provisioning of auxiliary material," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 669-708, September.
    2. Erfan Ghorbani & Mahdi Alinaghian & Gevork. B. Gharehpetian & Sajad Mohammadi & Guido Perboli, 2020. "A Survey on Environmentally Friendly Vehicle Routing Problem and a Proposal of Its Classification," Sustainability, MDPI, vol. 12(21), pages 1-71, October.
    3. Simon Emde & Lukas Polten, 2019. "Sequencing assembly lines to facilitate synchronized just-in-time part supply," Journal of Scheduling, Springer, vol. 22(6), pages 607-621, December.
    4. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    5. Adenipekun, Ebenezer Olatunde & Limère, Veronique & Schmid, Nico André, 2022. "The impact of transportation optimisation on assembly line feeding," Omega, Elsevier, vol. 107(C).
    6. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2023. "Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models," European Journal of Operational Research, Elsevier, vol. 306(2), pages 828-848.
    7. Simon Emde & Michael Schneider, 2018. "Just-In-Time Vehicle Routing for In-House Part Feeding to Assembly Lines," Transportation Science, INFORMS, vol. 52(3), pages 657-672, June.
    8. Mustapha Sali & Evren Sahin, 2016. "Line feeding optimization for Just in Time assembly lines: an application to the automotive industry," Post-Print hal-01265041, HAL.
    9. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    10. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    11. Sternatz, Johannes, 2015. "The joint line balancing and material supply problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 304-318.
    12. Qin, Hu & Su, E. & Wang, Yilun & Li, Jiliu, 2022. "Branch-and-price-and-cut for the electric vehicle relocation problem in one-way carsharing systems," Omega, Elsevier, vol. 109(C).
    13. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    14. Stefan Faldum & Sarah Machate & Timo Gschwind & Stefan Irnich, 2024. "Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1063-1097, December.
    15. Bock, Stefan, 2015. "Solving the traveling repairman problem on a line with general processing times and deadlines," European Journal of Operational Research, Elsevier, vol. 244(3), pages 690-703.
    16. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    17. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    18. Cortés-Murcia, David L. & Prodhon, Caroline & Murat Afsar, H., 2019. "The electric vehicle routing problem with time windows, partial recharges and satellite customers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 184-206.
    19. Daria Battini & Nils Boysen & Simon Emde, 2013. "Just-in-Time supermarkets for part supply in the automobile industry," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 24(2), pages 209-217, July.
    20. Yin, Yunqiang & Li, Dongwei & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Wang, Sutong, 2023. "A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1125-1144.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:joheur:v:31:y:2025:i:3:d:10.1007_s10732-025-09563-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.