Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Feng, C. W., Cheng, T. M., Wu, H. T.: Optimizing the schedule of dispatching RMC trucks through genetic algorithms. Automation in Construction, Vol. 13, issue 3 (2004) 327-340
Garcia, J. M., Lozano, S., Smith, K., Kwok, T., Villa, G.: Coordinated scheduling of production and delivery from multiple plants and with time windows using genetic algorithms. Proceedings of the 9th International Conference on Neural Information Processing, ICONIP ’ 02, Vol. 3 (2002) 1153-1158
Gendreau, M., Laporte, G., Séguin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research, Vol. 44, issue 3 (1996) 469-477
Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R.: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, Vol. 151 (2003) 1-11
Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation, Vol. 7 issue 2 (2003) 204-223
Laporte, G., Gendreau, M., Potvin, J. Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, Vol. 7, issue 4-5 (2000) 285-300
Lau, H. C., Sim, M., Teo, K. M.: Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research, Vol. 148 (2003) 559-569
Lee, C. Y., Choi, J. Y.: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers & Operations Research, Vol. 22, issue 8 (1995) 857-869
Marinakis, Y., Migdalas, A.: Annotated Bibliography in Vehicle Routing. Operational Research--An International Journal, Vol. 2, (2003) 32-46
M atsatsinis, Nikolaos F.: Towards a decision support system for the ready concrete distribution system: A case of a Greek company. European Journal of Operational Research, Vol. 152, issue 2 (2004) 487-499
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer-Verlag, Berlin Heidelberg New York (1996)
Min, L., Cheng, W.: A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artificial Intelligence in Engineering, Vol. 13, issue 4 (1999) 399-403
D. Naso, M. Surico, B. Turchiano, U. Kaymak, “Genetic algorithms for supply chain scheduling: a case study on ready mixed concrete”, Erasmus Research Institute of Management-Report ERS-2004-096-LIS, to appear on European Journal of Operation Research, 2006 or 2007
Nearchou, A. C.: The effect of various operators on the genetic search for large scheduling problems. International Journal of Production Economics, Vol. 88, issue 2 (2004) 191-203
Pinedo M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs, New Jersey (1995) Chap. 4, 86
Serifoglu, F. S., Ulusoy, G,: Parallel machine scheduling with earliness and tardiness penalties. Computers & Operations Research, Vol. 26, issue 8 (1999) 773-787
Solomon, M. M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operation Research, Vol. 35, issue 2, (1987) 254-265
Tan, K. C., Lee, L. H., Ou, K.: Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific Journal of Operational Research, Vol. 18, issue 1 (2001a) 121-130
Tan, K. C., Lee, L. H., Zhu, Q. L., Ou, K.: Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering, Vol. 15, issue 3 (2001b) 281-295
Tommelein, I. D., Li, A.: Just-In-Time Concrete Delivery: Mapping Alternatives for Vertical Supply Chain Integration. Proceedings of the Seventh Annual Conference of the International Group for Lean Construction IGLC-7, University of California, Berkeley, California, (1999) 97-108
Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics, Vol. 123, issue 1-3 (2002) 487-512
H. Ishibuchi, T. Yoshida, and T. Murata: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput., vol. 7 (2003), pp. 204-223
N. Krasnogor, J. Smith: A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, Vol. 9, Issue 5 (2005), 474-488
Y. S. Ong, M. H. Lim, N. Zhu, K. W. Wong: Classification of adaptive memetic algorithms: a comparative study. IEEE Transactions on Systems, Man and Cybernetics, Part B. Vol. 36, issue 1(2006) 141-152
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Naso, D., Surico, M., Turchiano, B. (2007). Scheduling Production and Distribution of Rapidly Perishable Materials with Hybrid GA's. In: Dahal, K.P., Tan, K.C., Cowling, P.I. (eds) Evolutionary Scheduling. Studies in Computational Intelligence, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48584-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-48584-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48582-7
Online ISBN: 978-3-540-48584-1
eBook Packages: EngineeringEngineering (R0)