Benchmark suite for industrial and tramp ship routing and scheduling problems

INFOR

Volumn 52, Issue 1, 2014, Pages 28-38

  Hemmati, Ahmad ^a   Hvattum, Lars Magnus ^a   Fagerholt, Kjetil ^a   Norstad, Inge ^b  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b SINTEF OCEAN   (Norway)

Author keywords

Adaptive large neighborhood search; Instance generation; Maritime transportation; Pick up and delivery

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING; SHIPS; WATERWAY TRANSPORTATION;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; HIGH-QUALITY SOLUTIONS; INSTANCE GENERATION; MARITIME TRANSPORTATION; MIXED INTEGER PROGRAMMING; PICKUP AND DELIVERY; ROUTING AND SCHEDULING; SOLUTION ALGORITHMS;

HEURISTIC METHODS;

EID: 84928564667     PISSN: 03155986     EISSN: 19160615     Source Type: Journal    
DOI: 10.3138/infor.52.1.28     Document Type: Article

References (28)

1. Al-Khayyal, F. and Hwang, S. J. (2007), "Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model", European Journal of Operational Research 176(1): 106-130.
2. Bebes, O. and Savin, S. (2009), "Going bunkers: the joint route selection and refueling problem", Manufacturing & Service Operations Management 11(4): 694-711.
3. Brouer, B.D., Fernando Alvarez, J., Plum, C. E. M., Pisinger, D., and Sigurd, M.M. (2013), "A base integer programming model and benchmark suite for liner-shipping network design", Transportation Science 48(2): 281-312.
4. Brønmo, G., Christiansen, M., Fagerholt, K., and Nygreen, B. (2007), "A multi-start local search heuristic for ship scheduling - a computational study", Computers and Operations Research 34(3): 900-917.
5. Christiansen, M., Fagerholt, K., Nygreen, B., and Ronen, D. (2007), "Maritime transportation." Handbooks in Operations Research and Management Science, Transportation, vol. 14, North-Holland, pp. 189-284.
6. Christiansen, M., Fagerholt, K., Nygreen, B., and Ronen, D. (2013), "Ship routing and scheduling in the new millennium", European Journal of Operational Research 228(3): 467-483.
7. Christiansen, M., Fagerholt, K., and Ronen, D. (2004), "Ship routing and scheduling: status and perspectives", Transportation Science 38(1): 1-18.
8. Crama, Y. and Schyns, M. (2003), "Simulated annealing for complex portfolio selection problems", European Journal of Operational Research 150(3): 546-571.
9. Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995), "Time constrained routing and scheduling." In Ball, M.O., Magnanti, T.L., Monma, C.L., and Nemhauser, G.L. (eds) Handbooks in Operations Research and Management Science, 8th vol. North-Holland, Amsterdam, pp 35-139.
10. Fagerholt, K., Heimdal, S. I., and Loktu, A. (2000), "Shortest path in the presence of obstacles: An application to ocean shipping", Journal of the Operational Research Society 51: 683-688.
11. Hwang, H. S., Visoldilokpun, S., and Rosenberger, J. M. (2008), "A branch-and-price-and cut method for ship scheduling with limited risk", Transportation Science 42(3): 336-351.
12. Jetlund, A. S. and Karimi, I. A. (2004), "Improving the logistics of multi-compartment chemical tankers", Computers and Chemical Engineering 28(8): 1267-1283.
13. Kontovas, K. and Psaraftis, H. N. (2011), "Reduction of emissions along the maritime intermodal container chain: operational models and policies", Maritime Policy and Management 38(4): 451-469.
14. Korsvik, J. E., Fagerholt, K., and Laporte, G. (2010), "A tabu search heuristic for ship routing and scheduling", Journal of the Operational Research Society 61(4): 594-603.
15. Lawrence, S. A. (1972), International sea transport: The years ahead, Lexington Books, Lexington.
16. Lin, D. Y. and Liu, H. Y. (2011), "Combined ship allocation, routing and freight assignment in tramp shipping", Transportation Research Part E 47(4): 414-431.
17. Malliappi, F., Bennell, J. A., and Potts, C. N. (2011), "A variable neighborhood search heuristic for tramp ship scheduling", Computational Logistics, Lecture Notes in Computer Science 6971, 273-285.
18. Norstad, I., Fagerholt, K., and Laporte, G. (2011), "Tramp ship routing and scheduling with speed optimization", Transportation Research Part C 19(5): 853-865.
19. Papageorgiou, D. J., Nemhauser, G. L., Sokol, J., Cheon, M. S., and Keha,A.B. (2014), "MIRPLib-A library of maritime inventory routing problem instances: Survey, core model, and benchmark results", European Journal of Operational Research 235(2): 350-366.
20. Psaraftis, H. N. and Kontovas, C. A. (2013), "Speed models for enegy-efficient maritime transportation: A taxonomy and survey", Transportation Research Part C 26: 331-351.
21. Ribeiro, G. M. and Laporte, G. (2012), "An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem", Computers and Operations Research 39(3):728-735.
22. Ronen, D. (1983), "Cargo ships routing and scheduling: survey of models and problems", European Journal of Operational Research 12(2): 119-126.
23. Ropke, S. and Pisinger, D. (2006), "An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows", Transportation Science 40(4): 455-472.
24. Savelsbergh, M. W. P. (1985), "Local search in routing problems with time windows", Annals of Operations Research 4:285-305.
25. Shaw, P. (1997), "A new local search algorithm providing high quality solutions to vehicle routing problems", Technical report, University of Strathclyde, Glasgow.
26. Solomon, M. M. (1987), "Algorithms for the vehicle routing and scheduling problem with time window constraints", Operations Research 35(2): 254-265.
27. UNCTAD (2013), Review of Maritime Transport, United Nations, New York and Geneva.
28. Vilhelmsen, C., Lusby, R., and Larsen, J. (2014), "Tramp ship routing and scheduling with integrated bunker optimization", EURO Journal on Transportation and Logistics. doi: 10.1007s13676-013-0039-8.