MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE

Logistics is one activity that has the potential to cause excessive costs for the company. Transportation and distribution are included into strategic planning on logistics. The importance of transportation leads to the need for transportation planning to keep the resource efficiency high, one of wh...

Full description

Saved in:
Bibliographic Details
Main Author: SAIDATUNINGTYAS - NIM : 23414029 , IFA
Format: Theses
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/22489
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:22489
spelling id-itb.:224892017-09-29T14:21:06ZMODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE SAIDATUNINGTYAS - NIM : 23414029 , IFA Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/22489 Logistics is one activity that has the potential to cause excessive costs for the company. Transportation and distribution are included into strategic planning on logistics. The importance of transportation leads to the need for transportation planning to keep the resource efficiency high, one of which is the ability to manage, schedule and route the vehicle. Cross-docking strategy is one of the logistics techniques that can help reduce inventory costs while simultaneously increasing the flow rate of goods, and shortening the flow of goods. <br /> <br /> <br /> In this research, a MRK-CD model which can minimize transportation cost by considering service time window (JW) for consumer (supplier and retailer) and depot is developed. The model also considers the use of multiple routes (RM) on vehicles. This problem arises because in real life condition, vehicles are not only used once in the planning period (single-trip) because it is considered inefficient. The developed model can not solve the problem in large quantities of data. Because of that weakness, it is proposed an algorithm (SI) that can solve the problem of MRKCDJWRM in large quantities data. <br /> <br /> <br /> The developed SI algorithm shows a relatively large gap. Trial comparison of analytical solutions with SI solutions to 10 data, shows a relatively large gap (<30%), so a solution improvement algorithm is required. As for the computation time required, the SI algorithm is faster> 99% in generating the solution when compared to the analytic model. The developed model was trialed on 5 sets of hypothetical data. Based on the calculations, it is known that the use of multiple routes provides significant savings on single route MRK-CD models. The result of objective function on a single route has a gap of > 130% more expensive when compared to the MRKCD model with the multiple routes (multiple trips). 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 Logistics is one activity that has the potential to cause excessive costs for the company. Transportation and distribution are included into strategic planning on logistics. The importance of transportation leads to the need for transportation planning to keep the resource efficiency high, one of which is the ability to manage, schedule and route the vehicle. Cross-docking strategy is one of the logistics techniques that can help reduce inventory costs while simultaneously increasing the flow rate of goods, and shortening the flow of goods. <br /> <br /> <br /> In this research, a MRK-CD model which can minimize transportation cost by considering service time window (JW) for consumer (supplier and retailer) and depot is developed. The model also considers the use of multiple routes (RM) on vehicles. This problem arises because in real life condition, vehicles are not only used once in the planning period (single-trip) because it is considered inefficient. The developed model can not solve the problem in large quantities of data. Because of that weakness, it is proposed an algorithm (SI) that can solve the problem of MRKCDJWRM in large quantities data. <br /> <br /> <br /> The developed SI algorithm shows a relatively large gap. Trial comparison of analytical solutions with SI solutions to 10 data, shows a relatively large gap (<30%), so a solution improvement algorithm is required. As for the computation time required, the SI algorithm is faster> 99% in generating the solution when compared to the analytic model. The developed model was trialed on 5 sets of hypothetical data. Based on the calculations, it is known that the use of multiple routes provides significant savings on single route MRK-CD models. The result of objective function on a single route has a gap of > 130% more expensive when compared to the MRKCD model with the multiple routes (multiple trips).
format Theses
author SAIDATUNINGTYAS - NIM : 23414029 , IFA
spellingShingle SAIDATUNINGTYAS - NIM : 23414029 , IFA
MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE
author_facet SAIDATUNINGTYAS - NIM : 23414029 , IFA
author_sort SAIDATUNINGTYAS - NIM : 23414029 , IFA
title MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE
title_short MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE
title_full MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE
title_fullStr MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE
title_full_unstemmed MODEL VEHICLE ROUTING PROBLEM FOR CROSS-DOCKING STRATEGY CONSIDERING MULTIPLE
title_sort model vehicle routing problem for cross-docking strategy considering multiple
url https://digilib.itb.ac.id/gdl/view/22489
_version_ 1822920541984522240