HEURISTIC FOR ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM

Tjutju Tarliah.D, DS (2012) HEURISTIC FOR ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM. Proceeding, International Seminar on Industrial Engineering and Management Aston Hotel, Manado, Indonesia, February 14 th – 16 th , 2012. pp. 20-25. ISSN 1978-774X

Preview	Text R34_TjutjuTD_Pasundan Univ.pdf Download (207kB) | Preview
Preview	Text HEURISTIC FOR ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM.pdf Download (4MB) | Preview

Abstract

The vehicle routing problem (VRP) is commonly defined as the problem of designing optimal delivery or collection routes from one or several depots to a set of geographically scattered customers, under a variety of side conditions. This problem is generally described through a graph, whose arcs represent the road sections and vertices correspond to the depot and customer locations. The arcs (and consequently the corresponding graph) can be directed or undirected, depending on whether they can be traversed in only one direction or in both directions. Since each arc is associated with a cost then if the graph is directed, the cost matrix is asymmetric and the corresponding problem is called asymmetric vehicle routing problem (AVRP). Although the symmetric problems are special cases of the asymmetric ones, the latter were much less studied in the literature. In this paper, a type of problem, called the Asymmetric Capacitated Vehicle Routing Problem (ACVRP) is discussed and a heuristic algorithm is proposed to solve the problem. Keywords: Vehicle Routing, Asymmetric, Capacitated, Heuristic

Item Type:	Article
Subjects:	JOURNAL
Divisions:	Fakultas Teknik > Teknik Industri 2012
Depositing User:	Irwan Kustiawan
Date Deposited:	02 Aug 2017 07:18
Last Modified:	28 May 2021 08:56
URI:	http://repository.unpas.ac.id/id/eprint/28435

Actions (login required)

View Item