Title of article
A largeneighbourhoodsearchheuristicforshiproutingandschedulingwith split loads
Author/Authors
Jarl EirikKorsvik ، نويسنده , , KjetilFagerholt ، نويسنده , , GilbertLaporte، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
10
From page
474
To page
483
Abstract
The purposeofthispaperistopresentandsolveanew,importantplanningproblemfacedbymany
shippingcompaniesdealingwiththetransportofbulkproducts.Theseshippingcompaniesare
committedtocarryingsomecontractcargoesandwilltrytoderiveadditionalrevenuefromoptional
spot cargoes.Inmostoftheliteratureonshiproutingandschedulingproblemsacargocannotbe
transportedbymorethanoneship.Byintroducingsplitloadsthisrestrictionisremovedandeachcargo
can betransportedbyseveralships.Inthispaperweproposealargeneighbourhoodsearchheuristicfor
the shiproutingandschedulingproblemwithsplitloads.Computationalresultsshowthattheheuristic
providesgoodsolutionstoreal-lifeinstanceswithinreasonabletime.Itisalsoshownthatintroducing
split loadscanyieldsignificantimprovements.
Keywords
Routing , Maritime transportation , Scheduling , Split loads
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927872
Link To Document