A memetic algorithm for the open capacitated arc routing problem
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 53-67 |
Journal / Publication | Transportation Research Part E: Logistics and Transportation Review |
Volume | 50 |
Issue number | 1 |
Publication status | Published - Feb 2013 |
Link(s)
Abstract
In this paper, an open capacitated arc routing problem (OCARP) is defined and considered. The OCARP seeks to find a set of minimum-cost open routes that can serve the tasks (i.e., required arcs) of a given graph, subject to the vehicle capacity and travel distance. A mathematical programming formulation and a lower bound are established. An effective memetic algorithm is developed for solving the OCARP. Computational experiments demonstrate that the proposed algorithm can produce high quality solutions within a reasonable computational time span, and the proposed memetic algorithm is superior to the classical genetic algorithm in solution quality. © 2012 Elsevier Ltd.
Research Area(s)
- Lower bound, Memetic algorithm, Open capacitated arc routing problem
Citation Format(s)
A memetic algorithm for the open capacitated arc routing problem. / Fung, Richard Y.K.; Liu, Ran; Jiang, Zhibin.
In: Transportation Research Part E: Logistics and Transportation Review, Vol. 50, No. 1, 02.2013, p. 53-67.
In: Transportation Research Part E: Logistics and Transportation Review, Vol. 50, No. 1, 02.2013, p. 53-67.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review