Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
This paper improves heuristic algorithms presented in Benjamin and Beasley (Comput Oper Res 37(12):2270–2280, 2010) for solving the waste collection vehicle routing problem with time windows, particularly the real life waste collection benchmark problems from Kim et al.(Comput Oper Res 33(12):3624–3...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Published: |
Springer
2013
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/12610/ http://dx.doi.org/10.1007/s11590-012-0549-6 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|