Total Cost Minimization of Heterogeneous Fixed Fleet Vehicle Routing Problem Using Holmes and Parker Algorithm

dc.contributor.author	Arrachman, Fadly
dc.date.accessioned	2017-10-16T06:55:51Z
dc.date.available	2017-10-16T06:55:51Z
dc.date.issued	2011
dc.description.abstract	A distribution activity in a company will related the problem of vehicle routing. There are several of Vehicle Routing Problem variants and one of them is Heterogeneous Fixed Fleet Vehicle Routing Problem. The problem has several main characteristic which are there is several different type of vehicles with limited number in a fleet which has also different capacity and also cost. The objective is to design the vehicle routes that minimize the total relevant cost with satisfying all customers demand, visiting each customer exactly once, and originating and terminating at a depot. In (his research a classical heuristic Holmes and Parker algorithm used to solve cost minimization of Heterogeneous Fixed Fleet Vehicle Routing Problem. The proposed algorithm is easy to implement and understand and also can provide a good solution. The solution generated by proposed algorithm shown the better than the current route in the total relevant cost that implemented by the company.	en_US
dc.identifier.uri	http://hdl.handle.net/123456789/3685
dc.publisher	UII Yogyakarta	en_US
dc.subject	distribution	en_US
dc.subject	vehicle routing problem	en_US
dc.subject	heterogeneous fixed fleet	en_US
dc.subject	Holmes and Parker algorithm	en_US
dc.title	Total Cost Minimization of Heterogeneous Fixed Fleet Vehicle Routing Problem Using Holmes and Parker Algorithm	en_US