1991
DOI: 10.1080/03088839100000028
|View full text |Cite
|
Sign up to set email alerts
|

Fleet deployment optimization for liner shipping Part 2. Implementation and results

Abstract: We use linear programming (LP) for solving the problem of the optimal deployment of an existing fleet of multipurpose or fully containerized ships, among a given set of routes, including information for lay-up time, if any, and type and number of extra ships to charter, based on a detailed and realistic model for the calculation of the operating costs of all the ship types in every route and on a suitable LP formulation developed in earlier work of the authors. The optimization model is also applicable to the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2000
2000
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 88 publications
(29 citation statements)
references
References 1 publication
0
29
0
Order By: Relevance
“…Cho and Perakis, 33 considering the fleet size, mixing, and delivery route assignment, presented integer linear programming models over a long-term planning horizon. Jaramillo and Perakis 34 proposed an integer linear programming model with two feasible models based on mixed linear-integer programming models. Fagerholt 35 worked a three-phase method by assuming weekly liner routes for this fleet deployment problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Cho and Perakis, 33 considering the fleet size, mixing, and delivery route assignment, presented integer linear programming models over a long-term planning horizon. Jaramillo and Perakis 34 proposed an integer linear programming model with two feasible models based on mixed linear-integer programming models. Fagerholt 35 worked a three-phase method by assuming weekly liner routes for this fleet deployment problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…During this period the operating cost of the ships laid up is reduced due mainly to engines kept at least regimes and reduced crew. Perakis and Jaramillo (1991) and Jaramillo and Perakis (1991) introduced lay up possibilities in a fleet deployment problem. The former presented an LP formulation for the problem while the latter presented its implementation and results.…”
Section: Fleet Adjustment In Tactical Problemsmentioning
confidence: 99%
“…The ship capacity constraints are given by (10) and (11) imposing an upper bound on the quantity on board for a single product and all the products respectively. Constraints (10) also impose an lower bound on the the quantity on board.…”
Section: Inimizementioning
confidence: 99%
“…Individual ships of the same type are not distinguished. Perakis and Jaramillo [10,12] have contributed to develop mathematical models for liner shipping fleet deployment problems. They proposed a linear programming (LP) model for a liner ship fleet deployment problem.…”
Section: Introductionmentioning
confidence: 99%