Modeling rolling batch planning as vehicle routing problem with time windows

Computers and Operations Research

Volumn 25, Issue 12, 1998, Pages 1127-1136

  Chen, Xiong ^a   Wan, Weishui ^a   Xu, Xinhe ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Genetic algorithm; Heuristics; Rolling batch planning; Vehicle routing problem with time windows

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

ROLLING BATCH PLANNING;

OPERATIONS RESEARCH;

EID: 0032345070     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00018-5     Document Type: Article

References (17)

1. Ohnishi, E. et al., System technology supporting operation of direct rolling. Iron and Steel, 1988, 7, 1314-1321.
2. Yoshimura, H., Watanake, K. and Miyawaki, H., Production control system for direct-linked process between continuous casters and hot strip mill or plate mill at Oita Works, Nippon Steel. Iron and Steel, 1988, 7, 1323-1330.
3. Chang, S. Y., Hong, Y. and Jum, C., Constraint satisfaction approach to scheduling DHCR process. Proceeding of Computerise Production Conference of Steel. South Korea. 1993, pp. 464-470.
4. Jacobs, T. L. et al., Optimal inter-process steel production scheduling. Comput. Oper. Res., 1988.
5. Kosiba, E. D., Wright, J. R. and Cobbs, A. E., Discrete event sequencing as a traveling salesman problem. Computers in Industry, 1992, 19, 317-327.
6. Xiong, C., Weisui, W. and Xinhe, X., The Rolling Batch Planning and its Solution. ICARCV, Singapore, 1996.
7. Fisher, M. L. and Jaikumar, R., A generalized assignment heuristic for vehicle routing. Networks, 1981, 11, 109-124.
8. Bodin et al., Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10, 62-212.
9. Laporte, G., The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research, 1992, 59, 345-358.
10. Savelsbergh, M. W. P., Local search for routing problem with time windows. Annals of Operations Research, 1985, 4, 285-305.
11. Solomon, M. M., Algorithm for the vehicle routing and scheduling problem with time window constraints. Operations Research, 1987, 35(2), 254-265.
12. Solomon, M. M. and Desrosiers, J., Time window constrained routing and scheduling problems: a survey. Transportation Science, 1988, 22(1), 1-11.
13. Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA, 1989.
14. Davis, L., Handbook of Genetic Algorithms. Van Nostrand Reinhold, Princeton, NJ, 1991.
15. Blanton, J. L. and Wainwright, R. L., Multiple vehicle routing with time and capacity constraints using genetic algorithms. The Fifth Proceeding of ICGA. 1993, pp. 452-459.
16. Jones, D. R. and Beltramo, M. A., Solving partitioning problems with genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms. 1991, pp. 442-449.
17. Potvin, J. Y. and Rousseau, J. M., An exchange heuristic for routing problems with time windows. Journal of Operational Research Society, 1995, 46, 1433-1446.