Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: A case study in Indonesia

Production and Manufacturing Research

Volumn 4, Issue 1, 2016, Pages 90-113

  Santosa, Budi ^a   Damayanti, Rita ^a   Sarkar, Biswajit ^b  

^a DEPARTMENT OF ELECTRICAL ENGINEERING   (Indonesia)

^b Hanyang University   (South Korea)

Author keywords

Cross entropy; Genetic algorithm; Heterogeneous fleet; Inventory ship routing problem; Metaheuristics; Multi product

Indexed keywords

COSTS; ENTROPY; FLEET OPERATIONS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; ROUTING ALGORITHMS; SHIPS; TABU SEARCH; WASHING;

CROSS ENTROPY; HETEROGENEOUS FLEET; META HEURISTICS; MULTI-PRODUCTS; ROUTING PROBLEMS;

PROBLEM SOLVING;

EID: 84995898073     PISSN: None     EISSN: 21693277     Source Type: Journal    
DOI: 10.1080/21693277.2016.1204961     Document Type: Article

References (17)

1. Agra, A., Christiansen, M., Delgado, A., & Hvattum, L. M. (2015). A maritime inventory routing problem with stochastic sailing and port times. Computers and Operations Research, 61, 18–30.
2. Al-Khayyal, F., & Hwang, S. J. (2007). Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: Applications and model. Middle East, 176, 106–130.
3. Andersson, H., Duesund, J. M., & Fagerholt, K. (2011). Ship routing and scheduling with cargo coupling and synchronization constraints. Computers & Industrial Engineering, 61, 1107–1116.
4. Chopra, S., & Meindl, P. (2007). Supply Chain Management Strategy, Planning and Operation. New Jersey: Prentice Hall.
5. de Boer, P. T. D., Kroese, D. P., Mannor, S., & Rubinstein, R. Y. (2005). A tutorial on the cross-entropy method. Annals of Operations Research, 134, 19–67.
6. Hemmati, A., Stalhane, M., Hvattum, L. M., & Andersson, H. (2015). An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping. Computers & Operations Research, 64, 274–282.
7. Ho, W., Ho, G. T. S., Ji, P., & Lau, H. C. W. (2008). A hybrid genetic algorithm for the multi-depot vehicle routing problem. Engineering Applications of Artificial Intelligence, 21, 548–557.
8. Hvattum, L. M., Fagerholt, K., & Armentano, V. A. (2009). Tank allocation problems in maritime bulk shipping. Computers & Industrial Engineering, 36, 3051–3060.
9. Laguna, M., Duarte, A., & Marti, R. (2007). Hybridizing the cross-entropy method: An application to the max-cut problem. Computers & Operations Research, 36, 487–498.
10. Lee, J., & Kim, B.-I. (2015). Industrial ship routing problem with split delivery and two types of vessels. Expert Systems with Applications, 42, 1–12.
11. Rubinstein, R. Y., & Kroese, D. P. (2004). The cross-entropy method: A unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning. New York, NY: Springer Science+Business Media.
12. Rusdiansyah, A., & Nurminarsih, S. (2012). Hybrid tabu search for solving multi product tanker scheduling problem (m-TSP) considering product loading compatibility constraint. In V. Kachitvichyanukul, H. T. Luong, & R. Pitakaso (Eds.), Proceedings of the Asia Pacific industrial engineering & management systems conference, Phuket, Thailand, APIEMS (pp. 1085–1092).
13. Santosa, B., Budiman, M. A., & Wiratno, S. E. (2011). A cross entropy-genetic algorithm for m-machines no-wait job-shop scheduling problem. Journal of Intelligent Learning Systems and Applications, 3, 171–180.
14. Santosa, B., & Hardiansyah, N. (2010). Cross entropy method for solving generalized orienteering problem. iBusiness, 2, 342–347.
15. Santosa, B., & Willy, P. (2011). Metoda metaheuristik, Konsep dan Implementasi [Metaheuristics method: Concept and implementation]. Surabaya: Guna Widya.
16. Sastry, K., Goldberg, D., & Kendall, G. (2005). Genetic Algorithms. In E. K. Burke & G. Kendall (Eds.), Search methodologies. New York, NY: Springer.
17. Siswanto, N., Essam, D., & Sarker, R. (2011). Solving the ship inventory routing and scheduling problem with undedicated compartments. Computers & Industrial Engineering, 61, 289–299.