The potential growth found inthe short sea shipping sector motivated the development of a methodology usedas a decision support tool in which both the parameters regarding the demand ofmarkets and the characteristics of the fleet may be tested for its evaluation.It is also possible to determine the fleet deployment, establishing its routesand scales in the ports for a particular scenario. The considered methodologymay be divided in two parts, being the first one related with the generation ofall feasible routes, alongside all the parameters specific to each route foreach vessel class. The second part is the introduction of a linear programmingmodel that maximizes the shipping operation’s total profit, according a givenset of restrictions. The models were structured according to three main criteria:the evaluation of the fleet for each vessel’s class; the optimal route for eachvessel and the frequency in each port. To provide the methodology’s validation,the developed models shall be submitted to a fictitious operational scenario,considering three different situations: the fleet’s normal operation; aparametric variation of required demand for the same fleet composition; anevaluation of several fleet compositions for the same demand level.
. List, G.F., Wood, B., Nozick, L.K., Turnquist, M.A., Jones, D.A., Kjeldgaard, E.A. and Lawton, C.R., 2002, Robust optimization for fleet planning under uncertainty. Transportation Research Part E: Logistics and Transportation Review, 39 (3), 209-227.
. Ronen, D., 1993, Vessel scheduling: The last decade. European Journal of Operational Research, 71, 325-333.
. Silva, C. A. and Guedes Soares, C., 2011, Planning a fleet of containerships for a given set of ports. C. Guedes Soares, Y. Garbatov S. Sutulo T. A. Santos, (Eds.). Maritime Engineering and Technology. London, UK: Taylor & Francis Group; 2012; pp. 87-96.
. Cullinane, K. and Khanna, M., 2000, Economies of scale in large containerships: optimal size and geographical implications. Journal of Transport Geography, 8 (3), 181-195.
. Wong, P.T.H., Singh, V.K. and Mcgeer, E.G., 1984, Vehicle routing using fixed delivery areas. Omega, 12 (6), 591-600.
. Shapiro, J. and Goldberg, R.R., 2001, Extending Graham’s result on scheduling to other heuristics. Operations Researchers Letters, 29 (4), 149-153.
. Couillard, J., 1993, A decision support system for vehicle fleet planning. Decision Support Systems, 9 (2), 149-159.
. Petering, M.E.H., 2011, Decision support for yard capacity, fleet composition, truck substitutability, and scalability issues at seaport container terminals. Transportation Research Part E, 47, 85-103.
. Lau, H.Y.K., Xhao, Y., 2007, Integrated scheduling of handling equipment at automated container terminals. International Journal of Production Economics, 112, 665-682.
. Fagerholt, K., 1999, Optimal vessel design on a vessel routing problem. International Transactions in Operational Research, 6 (5), 453-464.
. Fagerholt, K., 2000, Evaluating the trade-off between the level of customer service and transportation costs in a vessel scheduling problem. Maritime Policy Management, 27 (2), 145-153.
. Fagerholt, K., 2001, Vessel scheduling with soft time windows: An optimization approach. European Journal of Operational Research, 131 (3), 559-571.
. Taillard, E.D., Gendreau, M., Laport, G. and Musaraganyi, C., 1999, A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26 (12), 1153-1173.
. Salhi, R., 1993, Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research, 66 (3), 313-330.
. Nishimura, E., Imai, A., Papadimitriou, S., 2005, Yard trailer routing at a maritime container terminal. Transportation Research Part E, 41, 53-76.
. Pang, K., Xu, Z., Li, C., 2011, Ship routing problem with berthing time clash avoidance constraints. International Journal of Production Economics, 131 (2), 752-762.
. Karlaftis, M.G., Kepaptsoglou, K., Sambracos, E., 2009, Containership routing with time deadlines and simultaneous deliveries and pick-ups. Transportation Research Part E, 45 (1), 210-221.
. Jarpa, G.G., Desaulniers, G., Laporte, G. Marianov, V., 2010, A branch and price algorithm for the vehicle routing problem with deliveries, selective pickups and time Windows. European Journal of Operations Research, 206 (2), 341-349.
. Sherali, H. D., Al-Yakoob, S. M. and Asan, M. M., 1999, Fleet management models and algorithms for an oil-tanker routing and scheduling problem. IIE Transactions, 31, 395-406.
. Bausch, D.O., Brown, G.G. and Ronen, D., 1991, Elastic set partitioning – A powerful tool for scheduling transportation of oil and gas. Invited paper in Advances in Operations Research in the Oil and Gas Industry, eds Breton, M., and Zaccour, G. (Paris), pp. 151-162.
. Brown, G.G., Graves, G.W. and Ronen, D., 1987, Scheduling ocean transportation of crude oil. Management Science, 33, 335-346.
. Land, A.H. and Doig, A.G., 1960, An automatic method of solving discrete programming problems. Econometrica, 28 (3), 497-520.
. Boykin, R.F. and Levary, R.R., 1985, An interactive decision support system for analyzing vessel voyage alternatives. Interfaces, 15(2), 81-84.
Guest Editor: Eleonora Papadimitriou, PhD
Editors: Dario Babić, PhD; Marko Matulin, PhD; Marko Ševrović, PhD.
The mission of our journal is to provide high quality communication of research results, which is crucial for the effectiveness of scientific research, the promotion of scientific information, new ideas, and original research in the field of traffic and transportation engineering.
1848-4069
0353-5320
Proud publisher
Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal
