Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

Research output: Working paperWorking papers

Standard

Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses. / Xie, Lin; Li, Hanyi; Luttmann, Laurin.

New York, 2021. (arXiv.org).

Research output: Working paperWorking papers

Harvard

APA

Vancouver

Bibtex

@techreport{b5877654559a443cb090a8d37ac26cb0,
title = "Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses",
abstract = " Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both single-line and multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions are proposed in the literature and in practice. For example, in a mixed-shelves storage policy, items of the same stock keeping unit are spread over several shelves in a warehouse; or automated guided vehicles (AGVs) are used to transport the picked items from the storage area to packing stations instead of human pickers. This is the first paper to combine both solutions, creating what we call AGV-assisted mixed-shelves picking systems. We model the new integrated order batching and routing problem in such systems as an extended multi-depot vehicle routing problem with both three-index and two-commodity network flow formulations. Due to the complexity of the integrated problem, we develop a novel variable neighborhood search algorithm to solve the integrated problem more efficiently. We test our methods with different sizes of instances, and conclude that the mixed-shelves storage policy is more suitable than the usual storage policy in AGV-assisted mixed-shelves systems for both single-line and multi-line orders (saving up to 67% on driving distances for AGVs). Our variable neighborhood search algorithm provides close-to-optimal solutions within an acceptable computational time. ",
keywords = "Mathematics, math.OC, cs.AI, cs.RO, Business informatics",
author = "Lin Xie and Hanyi Li and Laurin Luttmann",
year = "2021",
month = jan,
day = "27",
language = "English",
series = "arXiv.org",
publisher = "Cornell University",
type = "WorkingPaper",
institution = "Cornell University",

}

RIS

TY - UNPB

T1 - Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

AU - Xie, Lin

AU - Li, Hanyi

AU - Luttmann, Laurin

PY - 2021/1/27

Y1 - 2021/1/27

N2 - Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both single-line and multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions are proposed in the literature and in practice. For example, in a mixed-shelves storage policy, items of the same stock keeping unit are spread over several shelves in a warehouse; or automated guided vehicles (AGVs) are used to transport the picked items from the storage area to packing stations instead of human pickers. This is the first paper to combine both solutions, creating what we call AGV-assisted mixed-shelves picking systems. We model the new integrated order batching and routing problem in such systems as an extended multi-depot vehicle routing problem with both three-index and two-commodity network flow formulations. Due to the complexity of the integrated problem, we develop a novel variable neighborhood search algorithm to solve the integrated problem more efficiently. We test our methods with different sizes of instances, and conclude that the mixed-shelves storage policy is more suitable than the usual storage policy in AGV-assisted mixed-shelves systems for both single-line and multi-line orders (saving up to 67% on driving distances for AGVs). Our variable neighborhood search algorithm provides close-to-optimal solutions within an acceptable computational time.

AB - Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both single-line and multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions are proposed in the literature and in practice. For example, in a mixed-shelves storage policy, items of the same stock keeping unit are spread over several shelves in a warehouse; or automated guided vehicles (AGVs) are used to transport the picked items from the storage area to packing stations instead of human pickers. This is the first paper to combine both solutions, creating what we call AGV-assisted mixed-shelves picking systems. We model the new integrated order batching and routing problem in such systems as an extended multi-depot vehicle routing problem with both three-index and two-commodity network flow formulations. Due to the complexity of the integrated problem, we develop a novel variable neighborhood search algorithm to solve the integrated problem more efficiently. We test our methods with different sizes of instances, and conclude that the mixed-shelves storage policy is more suitable than the usual storage policy in AGV-assisted mixed-shelves systems for both single-line and multi-line orders (saving up to 67% on driving distances for AGVs). Our variable neighborhood search algorithm provides close-to-optimal solutions within an acceptable computational time.

KW - Mathematics

KW - math.OC

KW - cs.AI

KW - cs.RO

KW - Business informatics

M3 - Working papers

T3 - arXiv.org

BT - Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses

CY - New York

ER -

Documents

Links