Number: 011-0101 A Feasibility Study for Joint Services of Vehicle Routing and Patrol Chikong Huang Stephen C. Shih Poshun Wang *1 Professor, Department of Industrial Management, Institute of Industrial Engineering and Management, National Yunlin University of Science & Technology, 123 University Road, Section 3, Touliu, Yunlin, Taiwan 64002, R.O.C. E-mail: huangck@yuntech.edu.tw, Phone: 886-5-5342601 ext. 5336 2 Associate Professor & Associate Director, School of Information Systems and Applied Technologies College of Applied Sciences and Arts Southern Illinois University Carbondale, Illinois 62901-6614, USA E-mail: shihcs@siu.edu, Phone: (618) 453-7266 3 Graduate Student, Institute of Industrial Engineering and Management, National Yunlin University of Science & Technology, 123 University Road, Section 3, Touliu, Yunlin, Taiwan 64002, R.O.C. E-mail: g9426703@yuntech.edu.tw, Phone: 886-5-5342601 ext. 5336 POM 20 Annual Conference Orlando, Florida U.S.A. May 1 to May 4, 2009
[1]
R. Tavakkoli-Moghaddam,et al.
A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
,
2006,
Appl. Math. Comput..
[2]
Wen-Chyuan Chiang,et al.
Simulated annealing metaheuristics for the vehicle routing problem with time windows
,
1996,
Ann. Oper. Res..
[3]
Alain Hertz,et al.
A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems
,
1999,
Oper. Res. Lett..
[4]
Rajan Batta,et al.
A simulated annealing approach to police district design
,
2002,
Comput. Oper. Res..
[5]
Michel Gendreau,et al.
Vehicle dispatching with time-dependent travel times
,
2003,
Eur. J. Oper. Res..
[6]
Roberto Cordone,et al.
A heuristic approach to the overnight security service problem
,
2003,
Comput. Oper. Res..