Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

•We investigate the two-dimensional vector packing problem with time windows.•A branch-price-and-cut method is proposed with exact and heuristic pricing.•The proposed algorithm significantly outperforms three exact algorithms. This paper introduces the two-dimensional vector packing problem with tim...

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 157; p. 106267
Main Authors:	Gao, Mujin, Chen, Yanru, Li, Junheng, Wahab, M.I.M.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.09.2023
Subjects:	Adaptive large neighborhood search Branch-and-price-and-cut Hybrid method Time windows Two-dimensional vector packing problem Time windows Adaptive large neighborhood search Hybrid method Two-dimensional vector packing problem Branch-and-price-and-cut
ISSN:	0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!