Cart (Loading....) | Create Account
Close category search window

Ant Colony Algorithm for Waste Collection Vehicle Arc Routing Problem with Turn Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Jie Liu ; Sch. of Urban & Rural Constr., Chengdu Univ., Chengdu, China ; Yanfeng He

A Waste Collection Arc Vehicle Routing Problem with turn constraints (WCAVRPTC) model is proposed to minimize the length of municipal solid waste (MSW) collection routes, which presents several characteristics derived from traffic regulations: some streets can be traversed crossed in only one direction, and some turns should be forbidden when the common angle is too narrow. The problem is transformed into a node routing ones and a clustering-based multiple ant colony system algorithm is described to address it. This algorithm possesses a set of new strategies to construct solutions, including clustering-based strategy, improved global pheromone update rule. The methodology is also applied to the urban waste collection problem in Shuangnan. The results of optimization indicate that the length of saving routes is 89984.96m and 92330.04m respectively with or without turns constrains constraints, which decreased by 31.1% and 31.9% respectively.

Published in:

Computational Intelligence and Security (CIS), 2012 Eighth International Conference on

Date of Conference:

17-18 Nov. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.