Selecting algorithms for large berth allocation problems

•Algorithm portfolios solve large berth allocation problems.•Runtime-solution quality trade-off is the core of portfolio construction method.•Algorithm portfolios evolving with runtime limit outperform fixed portfolios. This paper considers algorithm selection for the berth allocation problem (BAP)...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 283; no. 3; pp. 844 - 862
Main Authors:	Wawrzyniak, Jakub, Drozdowski, Maciej, Sanlaville, Éric
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.06.2020 Elsevier
Subjects:	Algorithm portfolios Algorithm selection problem Berth allocation problem Computer Science Heuristics Operations Research Quality-runtime trade-off Scheduling Algorithm portfolios Berth allocation problem Quality-runtime trade-off Scheduling Heuristics Algorithm selection problem algorithm portfolios berth allocation problem algorithm selection problem heuristics quality- runtime trade-off
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!