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

Budi Santosa, Rita Damayanti, Biswajit Sarkar

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

This paper presents a model and an algorithm for an inventory ship routing problem (ISRP). It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT), product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA), was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.

Original languageEnglish
Pages (from-to)90-113
Number of pages24
JournalProduction and Manufacturing Research
Volume4
Issue number1
DOIs
Publication statusPublished - 2016 Jul 8

Fingerprint

Ships
Entropy
Genetic algorithms
Tabu search
Washing
Costs
Mooring
Polynomials

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{9fd9d5ff337747e8a4ead47a2382ab58,
title = "Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: A case study in Indonesia",
abstract = "This paper presents a model and an algorithm for an inventory ship routing problem (ISRP). It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT), product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA), was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.",
author = "Budi Santosa and Rita Damayanti and Biswajit Sarkar",
year = "2016",
month = "7",
day = "8",
doi = "10.1080/21693277.2016.1204961",
language = "English",
volume = "4",
pages = "90--113",
journal = "Production and Manufacturing Research",
issn = "2169-3277",
publisher = "Taylor and Francis Ltd.",
number = "1",

}

TY - JOUR

T1 - Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm

T2 - A case study in Indonesia

AU - Santosa, Budi

AU - Damayanti, Rita

AU - Sarkar, Biswajit

PY - 2016/7/8

Y1 - 2016/7/8

N2 - This paper presents a model and an algorithm for an inventory ship routing problem (ISRP). It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT), product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA), was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.

AB - This paper presents a model and an algorithm for an inventory ship routing problem (ISRP). It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT), product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA), was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.

UR - http://www.scopus.com/inward/record.url?scp=84995898073&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84995898073&partnerID=8YFLogxK

U2 - 10.1080/21693277.2016.1204961

DO - 10.1080/21693277.2016.1204961

M3 - Article

AN - SCOPUS:84995898073

VL - 4

SP - 90

EP - 113

JO - Production and Manufacturing Research

JF - Production and Manufacturing Research

SN - 2169-3277

IS - 1

ER -