| dc.contributor.author | Fadly Arrachman, 05522125 | |
| dc.date.accessioned | 2020-03-23T09:42:11Z | |
| dc.date.available | 2020-03-23T09:42:11Z | |
| dc.date.issued | 2011 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/18752 | |
| dc.description.abstract | Adistribution activity in a company will related the problem ofvehicle 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.
Keywords: distribution, vehicle routing problem, heterogeneous fixed fleet, Holmes
and Parker algorithm | en_US |
| dc.publisher | Universitas Islam Indonesia | en_US |
| dc.subject | Total Cost Minimization | en_US |
| dc.subject | Heterogeneous Fixed | en_US |
| dc.subject | Fleet Vehicle Routing | en_US |
| dc.subject | Problem Using Holmes | en_US |
| dc.subject | Parker Algorithm | en_US |
| dc.title | Total Cost Minimization of Heterogeneous Fixed Fleet Vehicle Routing Problem Using Holmes and Parker Algorithm | en_US |
