A combined ship scheduling and allocation problem View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2000-07

AUTHORS

K Fagerholt, M Christiansen

ABSTRACT

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. More... »

PAGES

834-842

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1057/palgrave.jors.2600973

DOI

http://dx.doi.org/10.1057/palgrave.jors.2600973

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1005991797


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

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

Subject Predicate Object
1 sg:pub.10.1057/palgrave.jors.2600973 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N9790098d061a4290b7062336c1d6ace1
4 schema:citation sg:pub.10.1023/a:1018921527269
5 https://doi.org/10.1002/1520-6750(198902)36:1<27::aid-nav3220360103>3.0.co;2-0
6 https://doi.org/10.1016/0377-2217(83)90215-1
7 https://doi.org/10.1016/0377-2217(91)90319-q
8 https://doi.org/10.1016/0377-2217(93)90343-l
9 https://doi.org/10.1016/0377-2217(95)00231-6
10 https://doi.org/10.1080/03088839800000057
11 https://doi.org/10.1080/030888399286934
12 https://doi.org/10.1111/j.1475-3995.2000.tb00196.x
13 https://doi.org/10.1287/mnsc.33.3.335
14 https://doi.org/10.1287/opre.38.2.249
15 https://doi.org/10.1287/opre.43.2.367
16 https://doi.org/10.1287/opre.45.3.365
17 schema:datePublished 2000-07
18 schema:datePublishedReg 2000-07-01
19 schema: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.
20 schema:genre research_article
21 schema:inLanguage en
22 schema:isAccessibleForFree false
23 schema:isPartOf N4afb0ae22eaf43c5a0c7ea48dcfdd467
24 N95e6ebb220334fe2b85ef2175505f25f
25 sg:journal.1087747
26 schema:name A combined ship scheduling and allocation problem
27 schema:pagination 834-842
28 schema:productId N541c4c8f6cf8461b8cf559fbb3af8a26
29 N9ab7c2dfaab544d38c1b3cc56d2f99cd
30 Na8cca9a7a0bf42ec875bf07e322506b1
31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005991797
32 https://doi.org/10.1057/palgrave.jors.2600973
33 schema:sdDatePublished 2019-04-10T19:54
34 schema:sdLicense https://scigraph.springernature.com/explorer/license/
35 schema:sdPublisher N11f0926899ec4ffa92e6fc6ae9779217
36 schema:url http://link.springer.com/10.1057/palgrave.jors.2600973
37 sgo:license sg:explorer/license/
38 sgo:sdDataset articles
39 rdf:type schema:ScholarlyArticle
40 N11f0926899ec4ffa92e6fc6ae9779217 schema:name Springer Nature - SN SciGraph project
41 rdf:type schema:Organization
42 N4afb0ae22eaf43c5a0c7ea48dcfdd467 schema:issueNumber 7
43 rdf:type schema:PublicationIssue
44 N541c4c8f6cf8461b8cf559fbb3af8a26 schema:name doi
45 schema:value 10.1057/palgrave.jors.2600973
46 rdf:type schema:PropertyValue
47 N95e6ebb220334fe2b85ef2175505f25f schema:volumeNumber 51
48 rdf:type schema:PublicationVolume
49 N9790098d061a4290b7062336c1d6ace1 rdf:first sg:person.013764636233.10
50 rdf:rest Ne11a45cb9cfe4f2da938c7eb801c1c9b
51 N9ab7c2dfaab544d38c1b3cc56d2f99cd schema:name readcube_id
52 schema:value 1c8a8c50b59480028efa9b9ef0b259ae8df62661832e0884b78f1742ff0c18e1
53 rdf:type schema:PropertyValue
54 Na8cca9a7a0bf42ec875bf07e322506b1 schema:name dimensions_id
55 schema:value pub.1005991797
56 rdf:type schema:PropertyValue
57 Ne11a45cb9cfe4f2da938c7eb801c1c9b rdf:first sg:person.012500202107.37
58 rdf:rest rdf:nil
59 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
60 schema:name Information and Computing Sciences
61 rdf:type schema:DefinedTerm
62 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
63 schema:name Artificial Intelligence and Image Processing
64 rdf:type schema:DefinedTerm
65 sg:journal.1087747 schema:issn 0160-5682
66 1476-9360
67 schema:name Journal of the Operational Research Society
68 rdf:type schema:Periodical
69 sg:person.012500202107.37 schema:affiliation https://www.grid.ac/institutes/grid.5947.f
70 schema:familyName Christiansen
71 schema:givenName M
72 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012500202107.37
73 rdf:type schema:Person
74 sg:person.013764636233.10 schema:affiliation https://www.grid.ac/institutes/grid.5947.f
75 schema:familyName Fagerholt
76 schema:givenName K
77 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013764636233.10
78 rdf:type schema:Person
79 sg:pub.10.1023/a:1018921527269 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006215858
80 https://doi.org/10.1023/a:1018921527269
81 rdf:type schema:CreativeWork
82 https://doi.org/10.1002/1520-6750(198902)36:1<27::aid-nav3220360103>3.0.co;2-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025411373
83 rdf:type schema:CreativeWork
84 https://doi.org/10.1016/0377-2217(83)90215-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041595784
85 rdf:type schema:CreativeWork
86 https://doi.org/10.1016/0377-2217(91)90319-q schema:sameAs https://app.dimensions.ai/details/publication/pub.1040217687
87 rdf:type schema:CreativeWork
88 https://doi.org/10.1016/0377-2217(93)90343-l schema:sameAs https://app.dimensions.ai/details/publication/pub.1008986624
89 rdf:type schema:CreativeWork
90 https://doi.org/10.1016/0377-2217(95)00231-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052965857
91 rdf:type schema:CreativeWork
92 https://doi.org/10.1080/03088839800000057 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038913738
93 rdf:type schema:CreativeWork
94 https://doi.org/10.1080/030888399286934 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052850461
95 rdf:type schema:CreativeWork
96 https://doi.org/10.1111/j.1475-3995.2000.tb00196.x schema:sameAs https://app.dimensions.ai/details/publication/pub.1004674390
97 rdf:type schema:CreativeWork
98 https://doi.org/10.1287/mnsc.33.3.335 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064720298
99 rdf:type schema:CreativeWork
100 https://doi.org/10.1287/opre.38.2.249 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064730095
101 rdf:type schema:CreativeWork
102 https://doi.org/10.1287/opre.43.2.367 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064730757
103 rdf:type schema:CreativeWork
104 https://doi.org/10.1287/opre.45.3.365 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064730956
105 rdf:type schema:CreativeWork
106 https://www.grid.ac/institutes/grid.5947.f schema:alternateName Norwegian University of Science and Technology
107 schema:name Norwegian University of Science and Technology, Trondheim, Norway
108 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...