Vis enkel innførsel

dc.contributor.authorLarsen, Fredrik Nestvold
dc.date.accessioned2023-08-14T23:41:08Z
dc.date.available2023-08-14T23:41:08Z
dc.date.issued2023-07-01
dc.date.submitted2023-08-11T22:00:52Z
dc.identifier.urihttps://hdl.handle.net/11250/3083938
dc.description.abstractBORA : Yes Across the globe, hundreds of shipping networks form an intricate web of trade routes forming the backbone of international commerce. These networks are responsible for an estimated 80 percent of all cargo transported globally and are known as Liner Shipping Network Design Problem (LSNDP) in the literature. This thesis will focus on a variant of the LSNDP known as the feeder networks. It is the problem of serving a number of shipping requests using a fleet of vessels. Each request involves moving a number of containers from the origin port to the destination port. Our objective is to design routes that connect all ports in the most optimized order such that pickup and deliveries correspond with the lowest cost possible. We will implement, adapt and compare two state-of-the-art frameworks, where one (Adaptive Heuristic) framework is optimized and created for the FNDP while the other (Deep Reinforcement Learning Hyperheuristic) is a more general framework for a multitude of different Combinatorial Optimization Problems.
dc.language.isonob
dc.publisherThe University of Bergen
dc.rightsCopyright the Author. All rights reserved
dc.subjectFeeder Network
dc.subjectHyperheuristic
dc.subjectOptimization
dc.subjectDeep Learning
dc.subjectReinforcement Learning
dc.titleOptimizing Feeder Network Design with Deep Reinforcement Learning: A Hyperheuristic Approach
dc.title.alternativeOptimizing Feeder Network Design with Deep Reinforcement Learning: A Hyperheuristic Approach
dc.typeMaster thesis
dc.date.updated2023-08-11T22:00:52Z
dc.rights.holderCopyright the Author. All rights reserved
dc.description.degreeMasteroppgave i informatikk
dc.description.localcodeINF399
dc.description.localcodeMAMN-INF
dc.description.localcodeMAMN-PROG
dc.subject.nus754199
fs.subjectcodeINF399
fs.unitcode12-12-0


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel