CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM
Direct shipment generate the lowest cost in LNG distribution, yet not all destination point can be reach when the travel time to reach destination point is greater than the planning horizon. To be able deliver with timely manner required intermediary facility to connect LNG source location with dest...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/21836 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:21836 |
---|---|
spelling |
id-itb.:218362017-09-29T14:18:27ZCLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM AMIR HAMZAH - NIM: 23414034 , DWINANTO Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/21836 Direct shipment generate the lowest cost in LNG distribution, yet not all destination point can be reach when the travel time to reach destination point is greater than the planning horizon. To be able deliver with timely manner required intermediary facility to connect LNG source location with destination location and devide the supply chain network into two echelon supply chain network. This problem is studied specifically in a research field called 2-echelon location routing problem (2E-LRP). <br /> <br /> <br /> In this research, developed 2E-LRP mathematical model by considering direct shipment and maximum travel time. Mathematical model proposed in this research is complex that analytic calculations can only be used on small data sets. In order to solve real problems with large data sets, simulated annealing algorithm was developed using clustering approach. The initial solution was generated by clustering based heuristic algorithm then improved by using simulated annealing algorithm with three operators, split cluster, combine cluster and origin swap or exchange. <br /> <br /> <br /> Based on the experimental results with 12 sets of hypothetical data generate an average solution of 99.89% approaching global optimum solution with computation time used only 13.34% of the total time average to obtain global optimum solution by using analytical method. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
Direct shipment generate the lowest cost in LNG distribution, yet not all destination point can be reach when the travel time to reach destination point is greater than the planning horizon. To be able deliver with timely manner required intermediary facility to connect LNG source location with destination location and devide the supply chain network into two echelon supply chain network. This problem is studied specifically in a research field called 2-echelon location routing problem (2E-LRP). <br />
<br />
<br />
In this research, developed 2E-LRP mathematical model by considering direct shipment and maximum travel time. Mathematical model proposed in this research is complex that analytic calculations can only be used on small data sets. In order to solve real problems with large data sets, simulated annealing algorithm was developed using clustering approach. The initial solution was generated by clustering based heuristic algorithm then improved by using simulated annealing algorithm with three operators, split cluster, combine cluster and origin swap or exchange. <br />
<br />
<br />
Based on the experimental results with 12 sets of hypothetical data generate an average solution of 99.89% approaching global optimum solution with computation time used only 13.34% of the total time average to obtain global optimum solution by using analytical method. |
format |
Theses |
author |
AMIR HAMZAH - NIM: 23414034 , DWINANTO |
spellingShingle |
AMIR HAMZAH - NIM: 23414034 , DWINANTO CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM |
author_facet |
AMIR HAMZAH - NIM: 23414034 , DWINANTO |
author_sort |
AMIR HAMZAH - NIM: 23414034 , DWINANTO |
title |
CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM |
title_short |
CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM |
title_full |
CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM |
title_fullStr |
CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM |
title_full_unstemmed |
CLUSTERING APPROACH ON TWO-ECHELON LOCATION ROUTING PROBLEM WITH DIRECT SHIPMENT AND MAXIMUM TRAVEL TIME USING SIMULATED ANNEALING ALGORITHM |
title_sort |
clustering approach on two-echelon location routing problem with direct shipment and maximum travel time using simulated annealing algorithm |
url |
https://digilib.itb.ac.id/gdl/view/21836 |
_version_ |
1821120586534879232 |