VEHICLE ROUTING IN BEVERAGE INDUSTRY

Tjutju Tarliah.D, DS (2009) VEHICLE ROUTING IN BEVERAGE INDUSTRY. Proceeding, International Seminar on Industrial Engineering and Management. pp. 56-60. ISSN 1978-774X

Preview	Text 3rd ISIEM_108 TjutjuTD.pdf Download (200kB) | Preview
Preview	Text VEHICLE ROUTING IN BEVERAGE INDUSTRY.pdf Download (4MB) | Preview

Abstract

A classical problem in distribution logistics is the problem of designing least cost routes from one depot to a set of geographically scattered points. All routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. This problem is known as the Vehicle Routing Problem (VRP). If each customer to be served is associated with two quantities of goods to be collected and delivered, the problem is then called the Vehicle Routing Problem with Pick-up and Delivery (VRPPD). In this paper, the Vehicle Routing Problem with Pick-up and Delivery (VRPPD) is used to solve the distribution problem face by a beverage industry where vehicles of a certain loading capacity must routinely visit several retailers. Each retailer has a certain demand of full bottles to be delivered and empty bottles to be picked-up and be brought back to the depot. A heuristic algorithm is then used to construct the routes with the objective of minimizing not only the number of vehicles required, but also the total travel distance (or total cost) incurred by the fleet of vehicles. Keywords: Vehicle Routing Problem, Pick-up and Delivery, Heuristic

Item Type:	Article
Subjects:	JOURNAL
Divisions:	Fakultas Teknik > Teknik Industri 2009
Depositing User:	Irwan Kustiawan
Date Deposited:	02 Aug 2017 07:13
Last Modified:	26 May 2021 13:12
URI:	http://repository.unpas.ac.id/id/eprint/28434

Actions (login required)

View Item