A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Year of publication: |
16 January 2018
|
---|---|
Authors: | Žulj, Ivan ; Kramer, Sergej ; Schneider, Michael |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 264.2018, 2 (16.1.), p. 653-664
|
Subject: | Logistics | Order batching | Adaptive large neighborhood search | Tabu search | Hybrid metaheuristics | Suchtheorie | Search theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | USA | United States | Theorie | Theory | Nachbarschaft | Neighbourhood |
-
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem
Mauri, Geraldo Regis, (2016)
-
Parallel local search algorithms for high school timetabling problems
Saviniec, Landir, (2018)
-
Iterated local search with tabu search for the weighted vertex coloring problem
Nogueira, Bruno, (2021)
- More ...
-
Cost-neutral reduction of infection risk in picker-to-parts warehousing systems
Löffler, Maximilian, (2022)
-
Order batching and batch sequencing in an AMR-assisted picker-to-parts system
Žulj, Ivan, (2022)
-
Cost-neutral reduction of infection risk in picker-to-parts warehousing systems
Löffler, Maximilian, (2023)
- More ...