A vehicle routing system to solve a periodic vehicle routing problem for a food chain in Hong Kong

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1763-1768

  Zhu, Jianfeng ^a   Zhu, Wenbin ^b   Che, Chan Hou ^b   Lim, Andrew ^a,b,c  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b Red Jasper Limited   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; NETWORK ROUTING; PROBLEM SOLVING; ROUTING ALGORITHMS; VEHICLES;

FIXED PERIODS; FOOD CHAINS; HONG KONG; NUMBER OF VEHICLES; PERIODIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 57749093201     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Cordeau, J-F.; Laporte, G.; and Mercier, A. 2001. A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows. Journal of the Operational Research Society 52: 928-936.
2. Lim, A., and Zhang, X. 2007. A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows. Informs Journal on Computing 19: 443-457.
3. Solomon, M. M. 1987. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operation Research 35: 254-265.
4. Or, I. 1976. Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking. Ph.D. thesis, Northwestern Univ., Evanston, Illinois.
5. Bräysy, O.; Berger, J.; Barkaoui, M.; and Dullaert, W. 2003. A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows. Central European Journal of Operations Research 11(4): 369-387