Fan Hou-Ming
Transportation Management Colleges, Dalian Maritime University, Liaoning, 116026, China
Li Jia-Shu
Transportation Management Colleges, Dalian Maritime University, Liaoning, 116026, China
Zhang Xiao-Nan
Transportation Management Colleges, Dalian Maritime University, Liaoning, 116026, China
Li Yang
Transportation Management Colleges, Dalian Maritime University, Liaoning, 116026, China
ABSTRACT
Industrial Solid Waste Recycling Vehicle Routing problem with Time Window is studied. Based on the characteristics of industrial solid waste recycling and reusing, a vehicle hybrid scheduling optimization model is proposed. In which, Vehicle Routing problem with full load and Vehicle Routing problem with not-full load are combined. The sum of employed vehicle cost, travel cost, handling cost and time penalty cost for waiting or delaying is took as the objective function in the model. Two constraints of time window and maximal vehicle travel length are presented. Finally, an improved ant colony optimization algorithm is proposed for solving the problem. Dalian industrial solid waste recycling network is token as case to verify effective of the proposed model and algorithm. . The result shows that the proposed ant colony algorithm can search the satisfactory solution quickly and efficiently with small error and proposed model can save the number of employed vehicles and total cost.
PDF References Citation
How to cite this article
Fan Hou-Ming, Li Jia-Shu, Zhang Xiao-Nan and Li Yang, 2013. The Study on Hybrid Scheduling Optimizing of Industrial Solid Waste Recycling Vehicle Routing with Time Window. Information Technology Journal, 12: 8220-8227.
DOI: 10.3923/itj.2013.8220.8227
URL: https://scialert.net/abstract/?doi=itj.2013.8220.8227
DOI: 10.3923/itj.2013.8220.8227
URL: https://scialert.net/abstract/?doi=itj.2013.8220.8227
REFERENCES
- Angelelli, E. and M.G. Speranza, 2002. The periodic vehicle routing problem with intermediate facilities. Eur. J. Opera. Res., 137: 233-247.
CrossRefDirect Link - Vu Tung, D. and A. Pinnoi, 2000. Vehicle routing-scheduling for waste collection in Hanoi. Eur. J. Oper. Res., 125: 449-468.
CrossRefDirect Link - Gao, Z.H. and S.F. Chen, 2005. Application of genetic algorithm to competitive location model of logistics distribution center. J. Highway Trans. Res. Dev., 8: 138-141.
Direct Link - Lia, J.Q., D. Borensteinb and P.B. Mirchandania, 2008. Truck scheduling for solid waste collection in the City of Porto. Omega. Int. J. Manage. S., 36: 1133-1149.
CrossRefDirect Link - Kirca, O. and N. Erkip, 1988. Selecting transfer station locations for large solid waste systems. Eur. J. Operat. Res., 38: 339-349.
CrossRefDirect Link - Nuortio, T., J. Kytojoki, H. Niska and O. Braysy, 2006. Improved route planning and scheduling of waste collection and transport. Exp. Syst. Appl., 30: 223-232.
CrossRefDirect Link - Zhang, M.S. and X.W. Tang, 2002. Full load vehicle routing with multiple depots: New network flow based algorithm. J. Syst. Eng., 6: 216-220.
Direct Link