Ontology type: schema:ScholarlyArticle
2000-07
AUTHORS ABSTRACTWe present a bulk ship scheduling problem that is a combined multi-ship pickup and delivery problem with time windows (m-PDPTW) and multi-allocation problem. In contrast to other ship scheduling problems found in the literature, each ship in the fleet is equipped with a flexible cargo hold that can be partitioned into several smaller holds in a given number of ways. Therefore, multiple products can be carried simultaneously by the same ship. The scheduling of the ships constitutes the m-PDPTW, while the partition of the ships' flexible cargo holds and the allocation of cargoes to the smaller holds make the multi-allocation problem. A set partitioning approach consisting of two phases is proposed for the combined ship scheduling and allocation problem. In the first phase, a number of candidate schedules (including allocation of cargoes to the ships' cargo holds) is generated for each ship. In the second phase, we minimise transportation costs by solving a set partitioning problem where the columns are the candidate schedules generated in phase one. The computational results show that the proposed approach works, and optimal solutions are obtained on several cases of a real ship planning problem. More... »
PAGES834-842
http://scigraph.springernature.com/pub.10.1057/palgrave.jors.2600973
DOIhttp://dx.doi.org/10.1057/palgrave.jors.2600973
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1005991797
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Artificial Intelligence and Image Processing",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Norwegian University of Science and Technology",
"id": "https://www.grid.ac/institutes/grid.5947.f",
"name": [
"Norwegian University of Science and Technology, Trondheim, Norway"
],
"type": "Organization"
},
"familyName": "Fagerholt",
"givenName": "K",
"id": "sg:person.013764636233.10",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013764636233.10"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Norwegian University of Science and Technology",
"id": "https://www.grid.ac/institutes/grid.5947.f",
"name": [
"Norwegian University of Science and Technology, Trondheim, Norway"
],
"type": "Organization"
},
"familyName": "Christiansen",
"givenName": "M",
"id": "sg:person.012500202107.37",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012500202107.37"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1111/j.1475-3995.2000.tb00196.x",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1004674390"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1023/a:1018921527269",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1006215858",
"https://doi.org/10.1023/a:1018921527269"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0377-2217(93)90343-l",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1008986624"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0377-2217(93)90343-l",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1008986624"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1002/1520-6750(198902)36:1<27::aid-nav3220360103>3.0.co;2-0",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1025411373"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1080/03088839800000057",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1038913738"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0377-2217(91)90319-q",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1040217687"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0377-2217(91)90319-q",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1040217687"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0377-2217(83)90215-1",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1041595784"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1080/030888399286934",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1052850461"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0377-2217(95)00231-6",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1052965857"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1287/mnsc.33.3.335",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064720298"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1287/opre.38.2.249",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064730095"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1287/opre.43.2.367",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064730757"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1287/opre.45.3.365",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064730956"
],
"type": "CreativeWork"
}
],
"datePublished": "2000-07",
"datePublishedReg": "2000-07-01",
"description": "We present a bulk ship scheduling problem that is a combined multi-ship pickup and delivery problem with time windows (m-PDPTW) and multi-allocation problem. In contrast to other ship scheduling problems found in the literature, each ship in the fleet is equipped with a flexible cargo hold that can be partitioned into several smaller holds in a given number of ways. Therefore, multiple products can be carried simultaneously by the same ship. The scheduling of the ships constitutes the m-PDPTW, while the partition of the ships' flexible cargo holds and the allocation of cargoes to the smaller holds make the multi-allocation problem. A set partitioning approach consisting of two phases is proposed for the combined ship scheduling and allocation problem. In the first phase, a number of candidate schedules (including allocation of cargoes to the ships' cargo holds) is generated for each ship. In the second phase, we minimise transportation costs by solving a set partitioning problem where the columns are the candidate schedules generated in phase one. The computational results show that the proposed approach works, and optimal solutions are obtained on several cases of a real ship planning problem.",
"genre": "research_article",
"id": "sg:pub.10.1057/palgrave.jors.2600973",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": [
{
"id": "sg:journal.1087747",
"issn": [
"0160-5682",
"1476-9360"
],
"name": "Journal of the Operational Research Society",
"type": "Periodical"
},
{
"issueNumber": "7",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "51"
}
],
"name": "A combined ship scheduling and allocation problem",
"pagination": "834-842",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"1c8a8c50b59480028efa9b9ef0b259ae8df62661832e0884b78f1742ff0c18e1"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1057/palgrave.jors.2600973"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1005991797"
]
}
],
"sameAs": [
"https://doi.org/10.1057/palgrave.jors.2600973",
"https://app.dimensions.ai/details/publication/pub.1005991797"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-10T19:54",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8681_00000498.jsonl",
"type": "ScholarlyArticle",
"url": "http://link.springer.com/10.1057/palgrave.jors.2600973"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1057/palgrave.jors.2600973'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1057/palgrave.jors.2600973'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1057/palgrave.jors.2600973'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1057/palgrave.jors.2600973'
This table displays all metadata directly associated to this object as RDF triples.
108 TRIPLES
21 PREDICATES
40 URIs
19 LITERALS
7 BLANK NODES