FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM
two-echelon vehicle routing problem (2E-VRP) is a vehicle routing problem whose route search consists of two echelon and the nodes compose of depots, satellites, dan customers. The delivery of an item is carried out from the depot to the customer via satellite and vice versa for picking up goods....
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/69313 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:69313 |
---|---|
spelling |
id-itb.:693132022-09-21T13:06:58ZFRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM Tony Indonesia Final Project framework, GUI application, 2E-VRP, algorithm. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/69313 two-echelon vehicle routing problem (2E-VRP) is a vehicle routing problem whose route search consists of two echelon and the nodes compose of depots, satellites, dan customers. The delivery of an item is carried out from the depot to the customer via satellite and vice versa for picking up goods. The routes between depot and satellites are called first echelon routes. The routes between the satellite and the customer are called second echelon routes. This problem is widely studied by researchers, because this problem can also be used to model logistics problems that exist in the world. In designing the 2E-VRP algorithm, researchers usually try out algorithms that have been published by other researchers. Writing the code to run the algorithm takes the time from the researcher. Moreover, researchers also need to write boilerplate codes such as data structures, read input, and provide output. Therefore, a framework was created that will overcome boilerplate codes and simulate the algorithm that the researcher wants to try. With this framework, researchers only need to write 2E-VRP input according to the format and provide an input algorithm called the strategy algorithm. In addition, researchers do not need to think about the graph representation that will be used. In addition to the framework, an application that runs on top of the framework has also been created that has a GUI display that could help researchers write the code and visualize the routes from the output. In its implementation, this framework uses the Java programming language. The resulting framework only requires three types of input in the form of 2E-VRP in YAML format, checking constraints in the form of vehicle capacity, time synchronization, and vehicle fuel, and six types of algorithm strategies. This framework is used to build GUI applications that can help visualize the output of the framework. During testing, the output of the GUI Application makes it easy to check the routes of the framework. 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 |
two-echelon vehicle routing problem (2E-VRP) is a vehicle routing problem whose route
search consists of two echelon and the nodes compose of depots, satellites, dan customers. The
delivery of an item is carried out from the depot to the customer via satellite and vice versa for
picking up goods. The routes between depot and satellites are called first echelon routes. The
routes between the satellite and the customer are called second echelon routes. This problem is
widely studied by researchers, because this problem can also be used to model logistics
problems that exist in the world. In designing the 2E-VRP algorithm, researchers usually try
out algorithms that have been published by other researchers. Writing the code to run the
algorithm takes the time from the researcher. Moreover, researchers also need to write
boilerplate codes such as data structures, read input, and provide output.
Therefore, a framework was created that will overcome boilerplate codes and simulate the
algorithm that the researcher wants to try. With this framework, researchers only need to write
2E-VRP input according to the format and provide an input algorithm called the strategy
algorithm. In addition, researchers do not need to think about the graph representation that will
be used. In addition to the framework, an application that runs on top of the framework has
also been created that has a GUI display that could help researchers write the code and visualize
the routes from the output. In its implementation, this framework uses the Java programming
language.
The resulting framework only requires three types of input in the form of 2E-VRP in YAML
format, checking constraints in the form of vehicle capacity, time synchronization, and vehicle
fuel, and six types of algorithm strategies. This framework is used to build GUI applications
that can help visualize the output of the framework. During testing, the output of the GUI
Application makes it easy to check the routes of the framework. |
format |
Final Project |
author |
Tony |
spellingShingle |
Tony FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM |
author_facet |
Tony |
author_sort |
Tony |
title |
FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM |
title_short |
FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM |
title_full |
FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM |
title_fullStr |
FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM |
title_full_unstemmed |
FRAMEROWK DEVELOPMENT TO DESIGN 2E-VRP ALGORITHM |
title_sort |
framerowk development to design 2e-vrp algorithm |
url |
https://digilib.itb.ac.id/gdl/view/69313 |
_version_ |
1822990994064277504 |