Ant Colony Optimization with Path Relinking for the Capacitated Arc Routing Problem
The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem that has wide applicability in real-world logistics problems. The CARP involves finding a set of routes with minimum costs for a set of demand arcs with vehicle capacity limitations. Due to its NP-hard property, the CARP cannot be solved within reasonable time by exact algorithms. In recent years, metaheuristic algorithms have been developed to solve the CARP. Here, the authors propose an ant colony optimization algorithm with path relinking (ACOPR) to solve the problem. The proposed ACOPR was tested with seven benchmark sets of 181 instances from the literature for its effectiveness and compared with the existing best-performing metaheuristics. The computational results show that ACOPR is competitive with the compared state-of-the-art metaheuristic algorithms.
- Record URL:
- Record URL:
-
Authors:
- TING, Ching-Jung
- TSAI, Han-Shiuan
- Publication Date: 2018
Language
- English
- Japanese
Media Info
- Media Type: Digital/other
- Features: Figures; References; Tables;
- Pagination: pp 362-377
-
Serial:
- Asian Transport Studies
- Volume: 5
- Issue Number: 2
- Publisher: Eastern Asia Society for Transportation Studies
- EISSN: 2185-5560
- Serial URL: https://www.jstage.jst.go.jp/browse/eastsats
-
Publication flags:
Open Access (libre)
Subject/Index Terms
- TRT Terms: Algorithms; Demand; Logistics; Routing; Vehicle capacity
- Uncontrolled Terms: Ant colony optimization; Metaheuristics
- Subject Areas: Freight Transportation; Operations and Traffic Management; Planning and Forecasting;
Filing Info
- Accession Number: 01682163
- Record Type: Publication
- Source Agency: Japan Science and Technology Agency (JST)
- Files: TRIS, JSTAGE
- Created Date: Sep 27 2018 4:11PM