Manpower allocation with time windows

Journal of the Operational Research Society

Volumn 55, Issue 11, 2004, Pages 1178-1186

  Lim, A ^a   Rodrigues, B ^b   Song, L ^c  

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

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Heuristics; Manpower allocation

Indexed keywords

EFFICIENCY; HEURISTIC METHODS; MOTIVATION; PERSONNEL; PROBLEM SOLVING; PRODUCTIVITY;

MANPOWER ALLOCATION; OPERATIONAL CONSTRAINTS; SCHEDULING COMPLEXITY; TIME WINDOWS;

RESOURCE ALLOCATION;

EID: 7544236963     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601782     Document Type: Article

References (19)

1. Cai X and Li KN (2000). A genetic algorithm for scheduling staff of mixed under multi-criteria. Eur J Opl Res 125: 359-369.
2. Abboud N, Inuiguchi M, Sakawa M and Uemura Y (1998). Manpower allocation using genetic annealing. Eur J Opl Res 111: 405-420.
3. Pardalos P. and Resende M (eds) (2002). Handbook of Applied Optimization. Oxford University Press: Oxford.
4. Savelsbergh M (1985). Local search for routing problem with time windows. Ann Opns Res 4: 285-305.
5. Rochat Y and Taillard E (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
6. Chiang W and Russell R (1997). A reactive tabu search metaheuristics for the vehicle routing problem with time window. INFORMS J Comput 9: 417-430.
7. Taillard E, Badeau P, Gendreau M, Geurtin F and Potvin J (1997). A tabu search heuristic for the vehicle routing problem with time windows. Transport Sci 31: 170-186.
8. Thangiah SR (1999). A hybrid genetic algorithm, simulated annealing and tabu search heuristics for the vehicle routing problem with time windows. In: Chambers LD (ed). Practical Handbook of Genetic Algorithms: Complex Coding Systems Vol. III. CRC Press, Boca Raton, pp. 253-277.
9. Homberger J and Gehring H (1999). Two evolutionary metaheuristics for the vehicle routing problem with time window. INFOR 37: 165-172.
10. Cordeau J, Laporte G and Mercier A (2000). A unified tabu search heuristic for vehicle routing problem with time windows. Technical Report. CRT-00-03, Center for Research on Transportation, Montreal, Canada.
11. Backer B, Furnon V, Shaw P, Kilby P and Prosser P (2000). Solving vehicle routing problem using constraint programming and metaheuristics. J Heuristics 6: 501-523.
12. Rousseau J, Gendreau M and Pesant G (2002). Using constraint-based operators to solve the vehicle routing problem with time windows. J Heuristics 8: 43-58.
13. Li HB and Lim A (2003). Local search with annealing-like restarts to solve the VRPTW. Eur J Opl Res 150: 115-127.
14. Solomon M (1987). Algorithms for the vehicle routing and scheduling problems with time window constrains. Opns Res 35: 254-264.
15. Kirkpatrick S, Gelatt Jr CD and Vecchi MP (1983). Optimization by Simulated Annealing. Science 20: 671-680.
16. Li HB and Lim A (2001). A metaheuristic for solving the pickup and delivery problem with time windows. In: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI-2001, Dallas, USA. IEEE Computer Society, Los Alamitos, California, pp. 151-158.
17. Joslin D and Clements DP (1998). Squeaky Wheel Optimizations. AAAI/IAAI 1998 pp. 340-346.
18. Joslin D and Clements DP (1999). Squeaky wheel optimization. J AI Res 10: 353-373.
19. Clements D et al (1997). Heuristic optimization; a hybrid AI/OR approach. Workshop on Industrial Constraint-Directed Scheduling held in conjunction with CP'97, Schloss Hagenberg, Austria.