A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping (Q2676312): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2022.105904 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283069281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated maritime fleet deployment and speed optimization: case study from RoRo shipping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forty years of periodic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liner shipping network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load-dependent speed optimization in maritime inventory routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The periodic supply vessel planning problem with flexible departure times and coupled vessels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed optimizations for liner networks with business constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tramp ship routing and scheduling with voyage separation requirements / rank
 
Normal rank

Latest revision as of 06:12, 30 July 2024

scientific article
Language Label Description Also known as
English
A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping
scientific article

    Statements

    A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2022
    0 references
    0 references
    maritime transportation
    0 references
    roll-on roll-off shipping
    0 references
    evenly spread requirement
    0 references
    speed optimization
    0 references
    transit time constraints
    0 references
    heuristic
    0 references
    0 references