Exploring the Integration of General Variable Neighborhood Search with Exact Procedures for the Optimization of the Order Batching Problem

被引：0
|
作者：
Gil-Borras, Sergio [1 ]
Pardo, Eduardo G. [2 ,3 ]
机构：
[1] Univ Politecn Madrid, Dept Sistemas Informat, Madrid, Spain
[2] Univ Rey Juan Carlos, Dept Comp Sci, Madrid, Spain
[3] Univ Rey Juan Carlos, Dept Comp Sci, Mostoles, Spain
来源：
METAHEURISTICS, MIC 2024, PT I | 2024年 / 14753卷
基金：
奥地利科学基金会;
关键词：
Order Batching Problem; General Variable Neighborhood Search; Exact algorithms; TABU SEARCH; PICKING; WAREHOUSE; HEURISTICS; ALGORITHMS; DISTANCE;
D O I：
10.1007/978-3-031-62912-9_31
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper studies the influence of combining exact algorithms with heuristic procedures for the optimization of the Order Batching Problem. The problem looks to minimize the time that an operator needs to pick all items from a set of orders within a warehouse, when all orders are known before starting the picking process. It involves solving different tasks, such as batching the orders in groups or routing the picker through the warehouse. In this proposal a previous General Variable Neighborhood Search proposal for the batching task has been integrated with exact algorithms for the routing task. Several experiments have been designed to test the performance of the constructed algorithms.
引用
收藏
页码：331 / 343
页数：13
相关论文
共 50 条
  • [21] A General Variable Neighborhood Search for The Travelling Salesman Problem with Draft Limits
    Todosijevic, Raca
    Mjirda, Anis
    Hanafi, Said
    Mladenovic, Nenad
    Gendron, Bernard
    PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013), 2013, : 25 - 28
  • [22] Skewed general variable neighborhood search for the location routing scheduling problem
    Macedo, Rita
    Alves, Claudio
    Hanafi, Said
    Jarboui, Bassem
    Mladenovic, Nenad
    Ramos, Bruna
    Valerio de Carvalho, J. M.
    COMPUTERS & OPERATIONS RESEARCH, 2015, 61 : 143 - 152
  • [23] General variable neighborhood search approach to group steiner tree problem
    Matijevic, Luka
    Jelic, Slobodan
    Davidovic, Tatjana
    OPTIMIZATION LETTERS, 2023, 17 (09) : 2087 - 2111
  • [24] General variable neighborhood search approach to group steiner tree problem
    Luka Matijević
    Slobodan Jelić
    Tatjana Davidović
    Optimization Letters, 2023, 17 : 2087 - 2111
  • [25] A general variable neighborhood search approach for the minimum load coloring problem
    Herran, Alberto
    Manuel Colmenar, J.
    Mladenovic, Nenad
    Duarte, Abraham
    OPTIMIZATION LETTERS, 2023, 17 (09) : 2065 - 2086
  • [26] A general variable neighborhood search heuristic for multiple traveling salesmen problem
    Soylu, Banu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 90 : 390 - 401
  • [27] Variable neighborhood search for the orienteering problem
    Sevkli, Zulal
    Sevilgen, F. Erdogan
    Computer and Information Sciences - ISCIS 2006, Proceedings, 2006, 4263 : 134 - 143
  • [28] Exact methods and a variable neighborhood search for the robust capacitated p-median problem
    Campos, Rafael A.
    Chagas, Guilherme O.
    Coelho, Leandro C.
    Munari, Pedro
    COMPUTERS & OPERATIONS RESEARCH, 2025, 173
  • [29] Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
    Smiti, Noura
    Dhiaf, Mohamed Mahjoub
    Jarboui, Bassem
    Hanafi, Said
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) : 651 - 664
  • [30] A general variable neighborhood search algorithm for the k-traveling salesman problem
    Venkatesh, Pandiri
    Srivastava, Gaurav
    Singh, Alok
    8TH INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING & COMMUNICATIONS (ICACC-2018), 2018, 143 : 189 - 196
12345