OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY

Food and beverage company "X" is one of the providers of delivery services facing challenges in optimizing the routes for delivering customer orders. In this final project, the researcher construct a mathematical model to determine the optimal route in the Traveling Salesman Problem using...

Full description

Saved in:

Bibliographic Details
Main Author:	Sana Rachmaputri, Fadhilah
Format:	Final Project
Language:	Indonesia
Online Access:	https://digilib.itb.ac.id/gdl/view/73008
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Institut Teknologi Bandung
Language:	Indonesia

id	id-itb.:73008
spelling	id-itb.:730082023-06-13T08:23:11ZOPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY Sana Rachmaputri, Fadhilah Indonesia Final Project Traveling Salesman Problem, Cheapest Insertion Heuristic, optimal route. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/73008 Food and beverage company "X" is one of the providers of delivery services facing challenges in optimizing the routes for delivering customer orders. In this final project, the researcher construct a mathematical model to determine the optimal route in the Traveling Salesman Problem using the Cheapest Insertion Heuristic method. The researcher implement the algorithm using Python programming language and applies it to find the optimal routes in two cases: one without sequence selection and the other with sequence selection. The researcher perform simulations for two options of distance data from the company's address, namely the closest and farthest distance data. The algorithm's output consists of the selected routes counting the total distance traveled. 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	Food and beverage company "X" is one of the providers of delivery services facing challenges in optimizing the routes for delivering customer orders. In this final project, the researcher construct a mathematical model to determine the optimal route in the Traveling Salesman Problem using the Cheapest Insertion Heuristic method. The researcher implement the algorithm using Python programming language and applies it to find the optimal routes in two cases: one without sequence selection and the other with sequence selection. The researcher perform simulations for two options of distance data from the company's address, namely the closest and farthest distance data. The algorithm's output consists of the selected routes counting the total distance traveled.
format	Final Project
author	Sana Rachmaputri, Fadhilah
spellingShingle	Sana Rachmaputri, Fadhilah OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
author_facet	Sana Rachmaputri, Fadhilah
author_sort	Sana Rachmaputri, Fadhilah
title	OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
title_short	OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
title_full	OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
title_fullStr	OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
title_full_unstemmed	OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY
title_sort	optimization of route for food and beverage company
url	https://digilib.itb.ac.id/gdl/view/73008
_version_	1822992803995582464

OPTIMIZATION OF ROUTE FOR FOOD AND BEVERAGE COMPANY

Similar Items