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 条
  • [41] Variable Neighborhood Search Procedures for the Multi-Period Technician Routing and Scheduling Problem
    Khattara, Abouliakdane
    Cherif-Khettaf, Wahiba Ramdane
    Mostefai, Mohamed
    2017 4TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2017, : 839 - 844
  • [42] Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection
    Papalitsas, Christos
    Karakostas, Panayiotis
    Andronikos, Theodore
    Sioutas, Spyros
    Giannakis, Konstantinos
    ALGORITHMS, 2018, 11 (04)
  • [43] Multi-objective general variable neighborhood search for software maintainability optimization
    Yuste, Javier
    Pardo, Eduardo G.
    Duarte, Abraham
    Hao, Jin-Kao
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 133
  • [44] Variable neighborhood search for the linear ordering problem
    Garcia, Carlos G.
    Perez-Brito, Dionisio
    Campos, Vicente
    Marti, Rafael
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3549 - 3565
  • [45] Variable neighborhood search for the Vertex Separation Problem
    Duarte, Abraham
    Escudero, Laureano F.
    Marti, Rafael
    Mladenovic, Nenad
    Jose Pantrigo, Juan
    Sanchez-Oro, Jesus
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 3247 - 3255
  • [46] Variable neighborhood search for the travelling deliveryman problem
    Nenad Mladenović
    Dragan Urošević
    Saïd Hanafi
    4OR, 2013, 11 : 57 - 73
  • [47] Variable neighborhood search for the travelling deliveryman problem
    Mladenovic, Nenad
    Urosevic, Dragan
    Hanafi, Said
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2013, 11 (01): : 57 - 73
  • [48] Economic batching scheduling problem under order and delivery integration
    Yu, Liang
    Chen, Feng
    Qi, Xiang-Tong
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2010, 44 (12): : 1665 - 1671
  • [49] Integrated order batching and vehicle routing operations in grocery retail-A General Adaptive Large Neighborhood Search algorithm
    Kuhn, Heinrich
    Schubert, Daniel
    Holzapfel, Andreas
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (03) : 1003 - 1021
  • [50] A General Variable Neighborhood Search for the No-Idle Flowshop Scheduling Problem with Makespan Criterion
    Shen, Liangshan
    Tasgetiren, Mehmet Fatih
    Oztop, Hande
    Kandiller, Levent
    Gao, Liang
    2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 1684 - 1691
12345