MULTI-COMPARTMENT VEHICLE ROUTING PROBLEM WITH CONTINUOUSLY FLEXIBLE COMPARTMENT SIZES (MCVRP-CFCS) MODEL AND ALGORITHM WITH TIME WINDOWS, MULTIPLE TRIPS AND CLEANING SERVICES TO MINIMIZE THE DISTRIBUTION COST OF HALAL PRODUCTS
This research develops a Multi-Compartment Vehicle Routing Problem (MCVRP) model and algorithm to deliver mixed product, including three different types of products: Halal certified, non-halal-but-allowable (NHBA) and non-halal. This model proposes flexible compartments where the size of each com...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/77714 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Summary: | This research develops a Multi-Compartment Vehicle Routing Problem (MCVRP)
model and algorithm to deliver mixed product, including three different types of
products: Halal certified, non-halal-but-allowable (NHBA) and non-halal. This
model proposes flexible compartments where the size of each compartment is not
fixed beforehand but the number of compartments is limited. These compartments
are known as Continuously Flexible Compartment Sizes (CFCS), where the size of
each compartment can be selected arbitrarily within the limits of the vehicle’s
capacity. The developed model enriches the characteristics MCVRP-CFCS by
adopting Islamic Sharia principles in distribution activities to prevent
contamination and maintain the integrity of halal products.
Connventional logistics services providers often use separate vehicle to deliver
Halal-certified products. Meanwhile, other types of products are transported using
a different vehicle, resulting in high operational costs. However, in this model,
halal certified products and NHBA products can be loaded in the same vehicle
route. The flexibility of NHBA products allows them to be combined with non-halal
products. Thus, this model enables the use of the same vehicle to deliver a
combination of Halal certified+NHBA products after transporting Haram+NHBA
products but must go through a cleaning process.
A Mixed Integer Linear Programming (MILP) model was formulated and showed
a global optimal solution for a dataset of 4-9 customers. Additionally, the developed
Genetic Algorithm (GA) generates near-optimal solutions with an 8.34% gap. GA
also efficiently solves larger problems with up to 40 customers within a reasonable
timeframe. The developed mathematical model and algorithm can guarantee the
Islamic Sharia principles in Halal logistics by preventing contamination of halal-
certified products and maintaining a low distribution cost.
|
---|