Matheuristics for Waiting Time Minimization for Trailers with Uncertain Arrival Times

Standard

Matheuristics for Waiting Time Minimization for Trailers with Uncertain Arrival Times. / Ratushnyi, A. V.; Kochetov, Yu A.

In: Journal of Applied and Industrial Mathematics, Vol. 16, No. 3, 05.2022, p. 540-549.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{83ff5c2d3f244006978d92d14873ba87,

title = "Matheuristics for Waiting Time Minimization for Trailers with Uncertain Arrival Times",

abstract = "We present a new loading/unloading trailer scheduling problem for a logistics company.There is a building with several warehouses. Each warehouse stores pallets of different types ofproducts in rooms for loading into trailers. Each warehouse has two gates. One gate is for thetrailers, and the other one is for two forklifts from the central zone (production line). It producessome products which must be placed in warehouses according to the no wait rule. We assume thatthe arrival time for each trailer is uncertain. Our goal is to assign all trailers to warehouses andfind a schedule for servicing all the trailers with the maximum stability radius under the totalwaiting time constraint. For this NP-hard problem, we design a two-stage matheuristic. First, wesolve the simplified model using the Gurobi solver. Then the VNS algorithm is usedto return the solution into the feasible domain taking into account the detailed information aboutpallets in each warehouse. We generate some test instances using real data from a Dutch logisticscompany. Computational results for 6 warehouses, 18 types of products, and 90 trailers arediscussed.",

keywords = "matheuristic, stability radius, uncertainty, VNS",

author = "Ratushnyi, {A. V.} and Kochetov, {Yu A.}",

note = "Funding Information: This work was supported by the Russian Science Foundation, project no. 21–41–09017. Publisher Copyright: {\textcopyright} 2022, Pleiades Publishing, Ltd.",

year = "2022",

month = may,

doi = "10.1134/S1990478922030176",

language = "English",

volume = "16",

pages = "540--549",

journal = "Journal of Applied and Industrial Mathematics",

issn = "1990-4789",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "3",

}

RIS

TY - JOUR

T1 - Matheuristics for Waiting Time Minimization for Trailers with Uncertain Arrival Times

AU - Ratushnyi, A. V.

AU - Kochetov, Yu A.

PY - 2022/5

Y1 - 2022/5

N2 - We present a new loading/unloading trailer scheduling problem for a logistics company.There is a building with several warehouses. Each warehouse stores pallets of different types ofproducts in rooms for loading into trailers. Each warehouse has two gates. One gate is for thetrailers, and the other one is for two forklifts from the central zone (production line). It producessome products which must be placed in warehouses according to the no wait rule. We assume thatthe arrival time for each trailer is uncertain. Our goal is to assign all trailers to warehouses andfind a schedule for servicing all the trailers with the maximum stability radius under the totalwaiting time constraint. For this NP-hard problem, we design a two-stage matheuristic. First, wesolve the simplified model using the Gurobi solver. Then the VNS algorithm is usedto return the solution into the feasible domain taking into account the detailed information aboutpallets in each warehouse. We generate some test instances using real data from a Dutch logisticscompany. Computational results for 6 warehouses, 18 types of products, and 90 trailers arediscussed.

AB - We present a new loading/unloading trailer scheduling problem for a logistics company.There is a building with several warehouses. Each warehouse stores pallets of different types ofproducts in rooms for loading into trailers. Each warehouse has two gates. One gate is for thetrailers, and the other one is for two forklifts from the central zone (production line). It producessome products which must be placed in warehouses according to the no wait rule. We assume thatthe arrival time for each trailer is uncertain. Our goal is to assign all trailers to warehouses andfind a schedule for servicing all the trailers with the maximum stability radius under the totalwaiting time constraint. For this NP-hard problem, we design a two-stage matheuristic. First, wesolve the simplified model using the Gurobi solver. Then the VNS algorithm is usedto return the solution into the feasible domain taking into account the detailed information aboutpallets in each warehouse. We generate some test instances using real data from a Dutch logisticscompany. Computational results for 6 warehouses, 18 types of products, and 90 trailers arediscussed.

KW - matheuristic

KW - stability radius

KW - uncertainty

KW - VNS

UR - http://www.scopus.com/inward/record.url?scp=85144022279&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/83b885da-32cd-3a2a-b5cd-036c8a215fd4/

U2 - 10.1134/S1990478922030176

DO - 10.1134/S1990478922030176

M3 - Article

AN - SCOPUS:85144022279

VL - 16

SP - 540

EP - 549

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 3

ER -

ID: 41153386