DEVELOPMENT OF ALGORITHM FOR SWAP BODY VEHICLE ROUTING PROBLEM CONSIDERING TRUCKS THAT STANDBY AT SWAP LOCATION

Rahman, Adolft Afwari (2019) DEVELOPMENT OF ALGORITHM FOR SWAP BODY VEHICLE ROUTING PROBLEM CONSIDERING TRUCKS THAT STANDBY AT SWAP LOCATION. Other thesis, Institut Teknologi Sepulu Nopember.

Text 02411540000124-Undergraduate_Thesis.pdf Restricted to Repository staff only Download (3MB) | Request a copy

Abstract

Managing a day-to-day operational transportation decision is compulsory in creating an effective and efficient supply chain so that the goals achieved. Many challenges are imposed in the process of making decision, such as variability of customers accessibility. Many of the this transportation related problem is solved using Vehicle Routing Problem (VRP). A variant of the VRP, namely the Swap Body Vehicle Routing Problem (SBVRP) is investigated in this research. This research is motivated by Verolog Solver Challenge 2014.
This SBVRP is characterized by a fleet of vehicles consisting of trucks, semi-trailers, and swap bodies is available at a depot to serve a given set of customers. To serve these customers, two configurations can be chosen, either a truck or a train. The route starts and ends at the depot. To perform route several constraints, such as maximum operating time, accessibility of customers, and vehicle capacity have to be satisfied. Each customer can only be visited once.
However, this research adds new modification of system which is at the swap location there are several trucks that standby thus whenever a train visit a swap location, the two swap bodies can start to traverse the route right away. The swap location can act as a urban consolidation center to depict the real application of system. The purpose of this research is to minimize the total cost consisting of the fixed cost and variable costs and which swap location to be selected.
This problem is solved by employing a construction heuristic which based on cluster-first-route-second algorithm and improvement heuristic which based Variable Neighborhood Search (NVS). To generate the computerized model, Visual Basic Application (VBA) in Microsoft Excel is used. The performance of the improvement varies according to type of dataset used, the highest can improve around 6% and the lowest can improve 0.2%. Nevertheless, as a drawback, this model does not include inter-route-operator from the VNS which may improve the initial solution even better and also long computational time because of the big dataset used.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Keyword: Swap Body Vehicle Routing Problem, Swap Locations, Cluster-First-Route-Second, Variable Neighborhood Search.
Subjects:	H Social Sciences > HF Commerce > HF5415.7 Physical distribution management
Divisions:	Faculty of Industrial Technology > Industrial Engineering > 26201-(S1) Undergraduate Thesis
Depositing User:	Adolft Afwari Rahman
Date Deposited:	22 Jul 2026 06:48
Last Modified:	22 Jul 2026 06:48
URI:	http://repository.its.ac.id/id/eprint/66710

Actions (login required)

View Item