Professional Documents
Culture Documents
37–47
ISSN 0092-2102 (print) ISSN 1526-551X (online) http://dx.doi.org/10.1287/inte.1120.0668
© 2013 INFORMS
John Dimotikalis
Technological Education Institute of Crete, Crete, Greece, jdim@staff.teicrete.gr
Orestis Varelas
Anangel Maritime Services Inc., Piraeus, Greece, mail@anangelmar.com
In this paper we present an innovative toolkit that Danaos Corporation developed and deployed to optimize
ship routing. Operations Research In Ship MAnagement (ORISMA) provides a clear answer to the conventional
dilemma of least-cost voyage versus faster voyage. ORISMA maximizes revenue by using relevant information,
including financial data, hydrodynamic models, weather conditions, and marketing forecasts. It considers the
financial benefits after ship voyage completion to optimize the fleetwide performance instead of single-vessel
performance. Using operations research and expert knowledge, we developed ORISMA to include world-class
capabilities in scheduling optimization, intelligent voyage planning, ship bunkering, and chartering. In addition
to maximizing Danaos’ profit, it helps the company to minimize carbon emissions, reduce staff workload, and
increase customer satisfaction.
Key words: voyage planning; dynamic programming; cargo transport optimization; maritime routing.
it allows the shipowner to determine the best ship- on one voyage. To achieve this objective, we consider
chartering option. Since its inception, ORISMA has in detail all the factors that may affect it by describing
supported Danaos’ strategic goals of being innovative the ship-routing problem in a systematic way.
and creative. Its objective is to enrich, upgrade, A ship does not necessarily optimize its fuel con-
and transform conventional maritime information sumption (i.e., consume less fuel) when it sails at a
systems to provide prescriptive analytics function- constant speed along the shortest sailing path under
ality. Using ORISMA, we are able to offer both given environmental conditions. From a scientific per-
data reports and intelligent, customized consultancy spective, worldwide cargo transportation is an exam-
services using expert heuristics and in-depth opera- ple of energy transformation. Chemical energy is
tions research (OR) capabilities. Because it produces transformed to mechanical work to overcome water
optimal solutions, it has generated millions of dollars resistance. However, from a business perspective,
in revenue for Danaos in the first year of its imple- it can also be a profit-generating process, for exam-
mentation. To demonstrate the full ORISMA capabil- ple, by producing ton miles and consuming tons of
ity in this paper, we first describe the ship-routing fuel oil. Similarly, providing fuel to a ship (i.e., the
problem. We then describe ORISMA’s development ship’s bunkering procedure) when the ship is along
and implementation for a particular ship voyage. We the quayside or in the anchorage area near the main
demonstrate the results of the application on a micro port is the greatest cost factor. Although other oper-
(single-ship) and macro (fleetwide) scale. Finally, we ational costs (e.g., labor costs) contribute to the over-
emphasize that ORISMA is a breakthrough innova- all cost, fuel is by far the most significant factor.
tion for the maritime industry and also provides tan- Hence, decreasing fuel consumption (e.g., by approx-
gible benefits for the worldwide transportation sector. imately 3 percent) can provide significant cost sav-
ings (Turan et al. 2009). Such savings are achievable
by considering weather forecasts and by planning the
Problem Description ship’s route to minimize the added resistance result-
From celestial to satellite navigation, the dilemma that ing from wind, wind waves, swells, and currents,
sea voyage planners face centers around the trade- thus minimizing nonproductive time and the result-
offs between a least-cost voyage and a faster voyage ing nonproductive costs—the costs of the additional
(i.e., cost savings versus time savings). By a least- time (days) that the ship requires to sail to a spe-
cost voyage, we mean that we can significantly reduce cific port because of the added resistance; nonpro-
the overall cost for a specific ship voyage if the ship ductive time reduces the ship’s operational capacity
sails at a lower speed than usual. That is, the ship (i.e., the available operational time that the ship has
will save on the cost of fuel by consuming less; how- throughout the year). In recent years, various research
ever, it will arrive at its final port (destination) later— centers have developed weather forecasting models,
usually a few days later. Assuming that sufficient including wind-wave, swell, wind, and currents mod-
demand still exists for the ship’s next employment, it els, which the shipping industry has widely adopted
will lose available operational time (days). By faster (Journee and Meijers 1980, de Wit 1990, Spaans 1995,
voyage, we mean that the ship will gain operational Kwon 2008). We can now obtain reasonably good two-
time; the obvious drawback is higher fuel consump- week forecasts, and sophisticated interpolation tech-
tion and, accordingly, higher fuel cost. For several niques have improved the earth grid resolution to
years, we have tried to address this problem, keeping 0025∗0025 degrees, which is the latitude and longitude
in mind the continuously changing nature of the ship- precision for a specific ship route; we use latitude and
ping environment and of the state of the art of related longitude to derive the forecasts for our optimized
theory and practice (Dimotikalis et al. 2010; Varelas ship-routing process.
et al. 2010a, b; Theodossiou and Grigoropoulos 2005). Conversely, the development of ship performance
Summarizing these efforts, our objective is to maxi- models enables the theoretical calculation of a ves-
mize fleetwide net profit by optimizing ship routing sel’s performance index (measured in consumed tons
over the long horizon rather than maximizing it based of fuel per mile). In general, when a new voyage is
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
Interfaces 43(1), pp. 37–47, © 2013 INFORMS 39
ordered, the navigation officer, in conjunction with the a ship sails faster is common practice to save time
ship’s captain and company headquarters personnel, when the time savings, expressed in terms of mon-
prepares the voyage plan. The navigation officer starts etary values, may be higher. That is, the expected
by recalling similar previous voyages, if any, and then time-chartering equivalent (TCE), which is the time-
studies the relevant terms and conditions of the com- saving unit expressed in US dollars, provides the
mercial agreement (i.e., the charter party agreement) potential income per day for a vessel used in pre-
between the ship charterer and the shipowner and defined market boundaries. The in-house charterer is
(or) manager for the specific ship route and cargo the officer who has responsibility for determining the
transportation. The navigation officer also uses the vessel most suitable to a customer’s request for con-
relevant navigation maps to draft the ship’s course, tainer transportation from point X to point Y within
splits the ship’s voyage into passages, and draws a specific time horizon. To make decisions on fixing
them onto a ship’s chart (i.e., gnomonic chart). The (i.e., arranging to transport a certain type and num-
gnomonic map is a two-dimensional exact representa- ber of cargo containers) and planning a voyage, the
tion of the earth’s oceans and seas, displaying all the charterer usually follows the empirical maritime com-
earth’s great circles as straight lines. The gnomonic mon sense rule: full speed ahead whenever the ship
maps are created by projecting the earth’s surface anticipates a highly profitable next freight; economy
onto a tangent plane. After consulting with the ship’s (slower) speed whenever the result of marketing data
captain, the navigation officer uses waypoints to plot analysis shows that profit from the next freight will
the course the ship will follow for a particular voy- be low. However, in day-to-day operations, this set
age. A waypoint is a reference point that is drawn of different scenarios can become much more compli-
on the map and assists in specifying the exact voy- cated because fuel prices and market demand indexes
age sequence. A ship voyage consists of several way- change continuously.
points that are particularly useful when a ship sails Moreover, a shipowner who wants to plan a ship
long distances or in restricted areas or waters, because voyage to maximize the ship’s daily revenue will try
the ship will change its course several times before to achieve this over a horizon longer than a single-
it reaches its final port. The captain transfers the voyage duration. The charterer determines a voy-
selected waypoints onto the Mercator map—a map age employment, which we term subject (i.e., cargo
commonly used onboard ships for plotting the ship’s transportation from one port to another), among sev-
course and navigating. eral alternatives; each alternative has a different path
The shortest path between two points over the and freight (i.e., option). Accordingly, before making
earth’s surface is the corresponding arc of the greatest a decision, the charterer must evaluate each feasible
circle. We calculate its length by using the haversine next option for each subject by looking forward in
formula (see the last section of the appendix). In pre- time. A subject with low freight and a subsequent
vious times, sailors navigated along rhumb lines (i.e., employment possibility of high freight might be a bet-
lines crossing all earth meridians of longitude at the ter option than a subject with initially high freight and
same angle). On modern ships, the captain plots the relatively low next-employment freight. As an anal-
bearing of the ship’s course on the map, ensuring that ogy, a taxi driver might prefer to go to an airport
the ship sails along the same bearing without having transporting low (or no) freight if the probability of
to continuously change course. Following a constant transporting high freight on the way back is good.
compass bearing is easier than constantly adjusting For scenarios with multiple subjects and multiple
the bearing, as following a great circle requires. options, the problem’s complexity increases, although
Consuming the least amount of fuel does not nec- optimum decision making is hard to achieve. Further-
essarily result in maximum profit for a given period more, the approach we describe is deterministic. Esti-
and voyage between an origin-destination pair that mations for the succeeding options are stochastic, and
have different positions along a ship’s route; the next their accuracy depends on the levels of expertise of
step in formulating the overall ship-routing prob- the decision makers. We emphasize the importance
lem addresses this reality. Paying more for fuel when of evaluating past decisions to determine the experts
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
40 Interfaces 43(1), pp. 37–47, © 2013 INFORMS
among the decision makers. We record each finalized minimum fuel quantity, distance to be covered) to
decision and compare the corresponding voyage esti- compile this bunkering plan. The objective is to find
mation to the actual data following the completion of the optimum bunkering cost for the specific ship voy-
a voyage. The smallest deviation implies a better deci- age to conform to safety and technical constraints.
sion, and we consider the associated decision maker In most cases, the bunkering operator empirically
an expert. determines the bunkering plan, which then proves
Additionally, fixing a vessel that is not chartered to be feasible and satisfactory only when the ship’s
currently and that is closest to the departure port is schedule is simple and straightforward. However, in
not necessarily the optimum decision. In this case, day-to-day ship operations with complicated bunker-
we consider (1) the optimization of the ship fleet by ing schedules, a conventional bunkering plan is not
minimizing the total idle time, and (2) the fleetwide optimum. In this situation, the bunkering operator
long-term revenue maximization. This is a multicrite- must consider a variety of factors, including the over-
ria decision-making process that considers the vessel’s all marine fuel quantity needed for a specific trip or
principal characteristics (e.g., age, capacity), position, combination of trips, the specific quantities of the var-
and corresponding administrative costs. Older vessels ious types of marine fuel remaining on board, the
could be fixed in low freight and vessels with high places or ports of bunkering, and the price of these
administrative costs should be fixed with high freight. types of marine fuel at the various ports that the ship
Moreover, waiting to fix a vessel while minimiz- will approach. We can solve this problem using lin-
ing the bunkering cost does not necessarily maximize ear programming, where lower bounds ensure that
the net profit. The bunkering cost includes the costs enough fuel will be available to cover the next voy-
for different types of marine fuel, such as marine gas age leg and upper bounds prevent overfilling the
oil, diesel, and heavier types of fuel oil, which will fuel tank’s capacity. Therefore, we must carefully and
be consumed on board the ship. Sometimes, initiating accurately formulate a process to address a problem
a ship’s voyage toward a potential future destination that would otherwise be time consuming and create
and port where it will load its cargo (e.g., a num- operational frustration.
ber of containers), rather than waiting to arrange or
charter the cargo before sailing toward the container The ORISMA Solution
loading port, is a better decision. Therefore, ship man- ORISMA optimizes the overall fleet utilization by
agement constantly seeks ways to minimize vessel offering a high degree of scheduling optimization,
idle time and maximize fleet utilization. The shipping intelligent voyage and bunkering planning, and com-
company’s operations department must often use its mitment to charters. We measure fleet utilization as
expertise to make a decision about a ship’s route the total number of vessel employment days per total
after the ship has discharged its cargo, but before its available vessel days. The in-house chartering depart-
next employment, charter agreement, cargo, or port ment focuses on finding the proper employment for
is known. the right vessel (i.e., a vessel that is free and close to
Another issue in planning ship routes is that a ship- the loading port). Fleet scheduling assigns the most
ping company’s objective to minimize the required suitable vessel to each employment option to maxi-
ship fuel consumption (in tons) for a given ship mize the fleetwide revenue, rather than single-vessel
voyage does not necessarily minimize the bunkering voyage net profit. The objective of intelligent voy-
cost, because the company must also consider the age bunkering is to minimize the cost of bunker fuel
fuel price variations per port. The bunkering oper- based on the spatially distributed prices of bunker-
ator, who is responsible for reviewing and drafting ing suppliers; we suggest new routes that lead to
the ship’s voyage bunkering plan, must consider mar- fuel cost efficiency. Intelligent voyage planning max-
ket data (e.g., fuel prices, trends, availability), vessel imizes profit, while satisfying the overall chartering
attributes (e.g., fuel type, fuel storage capacity, ves- plan and chartering clauses. Examples of chartering
sel speed, fuel consumption per mile), and opera- clauses include payments in case of delay (demur-
tional data (e.g., fuel remaining on board, fuel safety, rage) or bonuses for traveling through war zones.
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
Interfaces 43(1), pp. 37–47, © 2013 INFORMS 41
We compile alternative chartering plans and then fix conventional voyage from the United Kingdom to the
employments. When employment has been fixed, the US East Coast, as planned by a navigator.
voyage has been planned. The volatile and highly We incorporate the estimated next daily income
competitive nature of marine shipping poses many into the objective function of ORISMA. This case is
challenges to this optimization process. We overcome more complex when more than one chartering option
these challenges by using reliable information (e.g., and more than one alternative for subsequent vessel
vessel particulars, potential customer details, and employment are available. Using ORISMA, we also
financial data), which we retrieve from both external develop and combine a number of functions, includ-
sources (e.g., the freight and bunkering market) and ing an optimized weather routing process (i.e., the
internal sources (e.g., Danaos’ operational and admin- best option for a ship route considering the weather
istrative departments). conditions at the time and place of the specific ship
Our approach to ship-routing issues is to select and voyage), single-voyage efficiency, and an optimum
optimize ship routes by responding to all relevant bunkering plan, into an integrated approach to maxi-
variables by adjusting the ship’s speed as a vector of mize the revenue over at least two consecutive voyage
the time and prevailing weather conditions of the spe- periods (e.g., from port X to port Y and from port Y
cific sailing area and route. These variables include to port Z).
added resistance (e.g., because of wind, wind waves, We specify, implement, and appropriately integrate
swells, and currents), ship fuel consumption, char- fleet-scheduling functions to minimize the idle time
ter party agreements, and navigation maps. Using and to search for a way to optimize fleetwide revenue.
ORISMA, we consider weather forecasts and suggest We also describe this operational ship management
a series of actions to minimize added resistance by issue by recording and evaluating existing business
adjusting the ship’s speed and evaluating possible practices.
deviations from the original planned route; as a result, Initially, we addressed the geometrically formu-
we can save fuel costs. In Figure 1, we demonstrate an lated problem of a move from a port to two poten-
optimized ORISMA route as a series of dotted lines tial destinations by determining the interior point of
and compare it to the continuous plotted line of a a given triangle, where the sum of its distances from
the three vertices is minimized (Varelas et al. 2010b).
300° 320° We transformed this triangle model to an appro-
priate business model to reflect real-life conditions.
In particular, the various chartering alternatives are
not necessarily equally likely, and the sides of the
40° 40°
given triangle and the distances of internal points of
the triangle from its vertices are not rectilinear sec-
tions, but are sets of the arcs of the largest circle.
Therefore, we also satisfy spatiotemporal restrictions
imposed by geography, regulations, and safety.
Relative to a ship’s routes to eventual ports of call,
we specify an intermediary destination that could also
20° 20° serve as a point of waiting. Given the time upper
20°
limit for the alternative ship routes and durations, we
300° 320°
use dynamic programming to propose a new routing
schedule that lessens idle time. Eventually, we deter-
Figure 1: This screen shot shows an ORISMA-optimized ship route (dotted mine that the ship should start its voyage toward the
line) versus the conventional planned route (continuous line) for a vessel next potential port of call, sailing from one plotted
travelling from the United Kingdom to the US East Coast. The route repre- point on the map to another; however, it should not
sented by the dotted line is an optimized route because ORISMA considers
the prevailing conditions in the specific ship route, thus saving tens of wait for the company to fix a charter agreement before
tons of marine fuel. it sails toward a specific port. We call this model the
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
42 Interfaces 43(1), pp. 37–47, © 2013 INFORMS
Figure 3: We compare wind diagrams for the optimal ORISMA-suggested route (left) and the actual route (right)
for the example described in Figure 2 and Tables 1 and 2. The two figures in the graphic show that ORISMA
recommends a route that minimizes the added wind resistance.
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
44 Interfaces 43(1), pp. 37–47, © 2013 INFORMS
accuracy. Our novel approach provides a more opti- nodes and the consumption resulting from any projected
mized ship route than the conventional process. How- deviation. We calculate the FOC per leg as the product of
ever, our process can be refined further to improve FOC per mile (lj 5 by the sum of the traveling distance and
the overhead of the deviation, if any.
the decision-making effort. We encourage academia We formulate the weather-routing cost-minimization
to do additional applied research in the transporta- problem as follows.
tion operations practice and to also apply ORISMA
∃ rj ∈ O rj = 8xij i = 1 2 n9 2
in other business areas. For example, the go-and- Xn
stay model might have applications in financial FOCmin = FOC4rj 5 = li ∗ 4Si + dvi 51 (1)
i=1
investment analysis, and the multicriteria chartering
decision model might be applicable to the rental car with variables defined as follows:
rj : all alternate routes;
and real estate businesses. O: the orbital set of all the alternate routes rj ;
Many researchers have developed algorithms with xij 4i = 1 2 n5 n nodes i of route j that are linked with the
the minimization of ship fuel consumption as their shortest path;
objective. The most popular methods include calculus FOC: fuel oil consumption in metric tons, subject to
weather conditions and vessel particulars;
of variations, and modified isochrone, isopone, and
li : performance index (fuel oil consumption per mile)
genetic algorithms. However, none considers the indi- from node i to node i + 1;
vidual vessel behavior, the sea-keeping data, and Si : distance in miles from node i to i + 1;
the most important factor—the cost of time. These dvi : whenever a vessel needs to deviate from the shortest
methods also ignore the importance of maximizing path, additional miles are covered;
the overall fleet utilization, minimizing idle time, dvi : definition of this deviation in miles (i.e., the addi-
tional distance traveled between node i and the next
and considering the results of market trend analy- node (i + 1) beyond the distance of the shortest path
sis. We address these factors in ORISMA by using from i to i + 1).
an integrated ship management platform. We also
Routing Cost and Time Minimization
enhanced ORISMA with several modules that address
Considering the value of time, we enhance the previous
intelligent crew planning, supplier appraisal and model as follows;
selection schemas, and risk assessment to minimize
∃ rj ∈ O rj 2 8xij i = 1 2 n9 2
proportional and fixed operational costs (Varelas and
Archontaki 2010). During the initial implementation cmin = c4rj 5 = TCE ∗ tj + FOC4rj 5 ∗ p = TCE ∗ tj
stage, we significantly improved business admin- n
X
istration efficiency. Decision makers are now able + li ∗4Si + dvi 5 ∗ p1 (2)
i=1
to use an integrated approach that enhances team-
with variables defined as follows:
work, improves creativity, and drastically reduces p: fuel oil price ($/ton);
staff day-to-day workload. Moreover, universities and tj : time to travel route j;
institutes, such as the University of Strathclyde, c: total cost;
the Business College of Athens, the Technological TCE = Time chartering equivalent in $/day (potential daily
University of Crete, and the Hellenic Marine Environ- income from chartering).
This model is further extended to cover multivoyage plan-
ment Protection Association (HELMEPA), have incor- ning, where the evaluated potential scenarios have multiple
porated ORISMA into their academic programs as a consecutive voyages.
best business practice paradigm. We are continuing to
Optimal Bunkering
improve and refine the ORISMA solution to provide
In the optimum bunkering problem, a vessel that departs
greater business value for our clients. from port A1 will berth at ports Ai and will arrive at the
final destination port An . The objective is to minimize fuel
Appendix. Model Formulations
consumption:
n
Routing Cost Minimization
X
Minimize f = qi ∗ pi 1 (3)
We define each vessel route j as a voyage through n ordered i=1
xij nodes (physical points). The objective is to find the route with variables defined as follows:
with the minimum fuel oil consumption (FOC), as the sum- qi : purchased quantity of fuel oil in metric tons at port Ai ;
mation of the FOC of each leg that links two consecutive pi : price in $ of a fuel oil ton at port Ai .
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
46 Interfaces 43(1), pp. 37–47, © 2013 INFORMS
The remaining fuel oil on board, robi , at port i should be Bellman RE (1957) Dynamic Programming (Princeton University
sufficient to cover the required fuel to cover the distance to Press, Princeton, NJ).
the next bunkering port. Also, the robi onboard fuel quantity Carnall AC (1995) Managing Change in Organisations (Prentice-Hall,
at port i should be less than the vessel tanks’ capacity cap. Hertfordshire, UK).
The following two constraints keep the fuel quantity pur- Cui H, Banks C, Lazakis I, Turan O, Incecik A (2011) Onboard deci-
sion support system for low carbon-energy efficient ship oper-
chased between its bounds and keep track of the remaining ation. Turan O, Incecik A, eds. Proc. Internat. Conf. Tech. Oper.
onboard fuel quantity after purchases and consumption. Logist. Modeling Low Carbon Shipping (Department of Naval
Architecture and Marine Engineering, Glasgow, UK), 81–94.
ci − robi ≤ qi ≤ cap − robi 1 (4) de Wit C (1990) Proposal for low cost ocean routing. J. Navigation
43(3):428–439.
robi = robi−1 + qi − ci 1 (5) Dimotikalis J, Archontaki S, Varelas T (2010) Non linear analysis for
chartering. Proc. 14th Internat. Sympos. Appl. Stochastic Models
where Data Anal. (ASMDA), Rome.
ci : consumed fuel in tons for the (Ai to Ai+1 5 vessel route ECSA (2011) European Community Shipowners’ Associations
leg. (ECSA) Annual Report 2010–2011. ECSA, Brussels, Belgium.
Huse EF, Cummings TG (1989) Organization Development and Change
Minimize Idle Time Whenever Next Employment Is (South Western Educational Publishing, Mason, OH).
Not Fixed Journee JM, Meijers J (1980) Ship routing for optimum per-
Whenever a vessel is idle at node C and n eventual alter- formance. Report 0529-P, Delft University of Technology,
native employments nodes Dn exist, we advise the ship’s Delft, The Netherlands.
captain to sail for a waiting node (G5 to maximize the profit Kwon YJ (2008) Speed loss due to added resistance in wind and
waves. Naval Architect 3(March):14–16.
by saving time, although an additional movement cost is
Spaans JA (1995) New developments in ship weather routing. Nav-
needed: igation 43(169):95–106.
n
X Theodossiou DK, Grigoropoulos G (2005) Optimal routing decision
maximize f = time · saving · profiti − FOCi 1 (6) support systems. 1st Internat. Sympos. Ship Oper. Management
i=1 Econom. (Society of Naval Architects and Marine Engineers
(SNAME), Jersey City, NJ).
with variables defined as follows:
Turan O, Ölçer A, Lazakis I, Rigo P, Caprace JD (2009) Mainte-
FOCi = FOC6G−Di 7+FOC6C −G7−FOC6C −Di 7: bunker- nance/repair and production-oriented life cycle cost/earning
ing cost from C to destination Di through G minus the model for ship structural optimization during conceptual
bunkering cost of proceeding directly from C to Di ; design stage. Ships Offshore Structures 4(2):107–125.
time · saving · profiti = TCEi ∗ 4t6C − Di 7 − t6G − Di 75: incre- Varelas O, Archontaki S (2010) Cos(i): Intelligence in crew option
mental improvement in profit because of a faster route from systems. Internat. Sympos. Ship Oper. Management Econom. (Soci-
C to Di through G versus a direct route from C to Di ; ety of Naval Architects and Marine Engineers (SNAME), Jersey
City, NJ).
FOC[A − B]: the fuel oil consumption cost from node A
Varelas O, Archontaki S (2011) Intelligence voyage planning for
to node B;
emission lowering. Turan O, Incecik A, eds. Proc. Internat. Conf.
t6A − B7: the time in days to move from node A to B. Tech. Oper. Logist. Modeling Low Carbon Shipping (Department
of Naval Architecture and Marine Engineering, Glasgow, UK),
Haversine Formula 137–141.
The shortest distance between two points on earth is calcu- Varelas O, Archontaki S, Moutsikopoulou D (2010a) IAFOS: Intel-
lated by the haversine formula as follows: ligent algorithm for fuel oil supply. 3rd Internat. Sympos. Ship
Oper. Management Econom. (Society of Naval Architects and
Distance = R ∗ C1 Marine Engineers (SNAME), Jersey City, NJ).
Varelas O, Archontaki S, Moutsikopoulou D (2010b) CHAOS(I)
where R is the earth’s radius (mean radius = 61371 km), intelligence in chartering option summary. 9th Internat. Conf.
√ √ Hellenic Oper. Res. Soc. (HELORS), Agios Nikolaos, Crete.
C = 2atan2( a1 41 − a5), and
a = sin 4ãlat/25 + cos4lat1 5 cos4lat2 5 sin2 4ãlong/2);
2
ãlat = lattitude2 − latitudue1 : ãlong = longitude2 Takis Varelas has more than 30 years experience in
−longitude1 ; shipping and information industries and has managed the
lati = latitude of point i: loni = longitude of point i. Danaos Research Centre since 2004. He was a professor
of OR/MS at the Technical University of Crete. He is the
author of papers, a keynote speaker at conferences, an
References invited lecturer at universities, and a participant in more
than 20 EU-funded and industry-funded integrated projects
Banks C, Lazakis I, Turan O, Incecik A (2011) Education and
training of seafarers in low carbon-energy efficient operations. focused on OR.
Turan O, Incecik A, eds. Proc. Internat. Conf. Tech. Oper. Logist. Sofia Archontaki has been a senior operational researcher
Modeling Low Carbon Shipping (Department of Naval Architec- at Danaos Research Centre since 2000. She majored in OR
ture and Marine Engineering, Glasgow, UK), 207–220. and maritime management science and spent more than
Varelas et al.: Optimizing Ship Routing to Maximize Fleet Revenue at Danaos
Interfaces 43(1), pp. 37–47, © 2013 INFORMS 47
15 years in shipping industry management. She is the systems, and advanced design and optimization techniques
author of several papers and a participant in research pro- using artificial intelligence.
grams funded by the European Union and industry and Iraklis Lazakis is a lecturer in the Department of Naval
focused on optimization techniques. Architecture and Marine Engineering at the University of
John Dimotikalis is a production and management engi- Strathclyde, Glasgow, and has 10 years of industrial expe-
neer and holds MSc and PhD degrees from the Technical rience. He has participated in and contributed to research
University of Crete. He is an assistant professor at the Tech- projects funded by industry, the United Kingdom, and the
nological Education Institute of Crete. His academic inter- European Union in the fields of maintenance, reliability
ests are focused on nonlinear optimization applied to ship analysis, and optimization.
management and financials. He is an organizer of interna- Orestis Varelas is a naval architect and mechanical engi-
tional conferences of CHAOS. neer. He graduated from the National Technical University
Osman Turan is a professor in the Department of Naval of Athens and joined Anangel Maritime SA in 2008. He
Architecture and Marine Engineering at the University of works as a superintendent engineer. He is a participant in
Strathclyde, Glasgow. He is an expert on shipping safety, European Union projects focused on bunkering and energy
design for safety covering human factors, decision support efficiency optimization.