Operational Freight Carrier Planning Basic Concepts, Optimization Mo
This book represents the compilation of several research approaches on opera tional freight carrier planning carried out at the Chair of Logistics, University of Bremen. It took nearly three years from the first ideas to the final version, now in your ha
- PDF / 592,151 Bytes
- 12 Pages / 439.37 x 666.142 pts Page_size
- 118 Downloads / 228 Views
Aarts, E., Korst, J., van Laarhoven, P. (1997). Simulated annealing. In: Aarts and Lenstra (1997), pp. 91-120. Aarts, E., Lenstra, J. (Eds.) (1997). Local Search in combinatorial Optimization. John Wiley & Sons. Alander, J. (1999). An indexed bibliography of genetic algorithm implementations. Tech. Rep. 94-1-IMPLE, University of Vaasa. Alvarenga, G., Mateus, G., de Tomi, G. (2003). Finding near optimal solutions for vehicle routing problems with time windows using hybrid genetic algorithm. Tech. rep., Manuscript presented at Odysseus 2003 Conference. Angelelli, E., Mansini, R. (2002). The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose, A., Speranza, M. G., van Wassenhove, L. (Eds.), Quantitative Approaches o Distribution Logistics and Supply Chain Management. No. 519 in Lecture Notes in Economics and Mathematical Systems. Springer, pp. 249-267. Arendt, M., Achermann, Y. (2002). Aggregierte Verkehrsprognosen Schweiz und EU - Zusammenstellung vorhandener Prognosen bis 2020. Tech. rep., Bundesamt fiir Raumentwicklung. Back, T., Fogel, D., Michalewicz, Z. (Eds.) (2000a). Evolutionary Computation 1 Basic Algorithms and Operators. Institute of Physics Publishing. Back, T., Fogel, D., Michalewicz, Z. (Eds.) (2000b). Evolutionary Computation 2 Advanced Algorithms and Operators. Institute of Physics Publishing. Baker, B., Ayechew, M. (2003). A genetic algorithm for the vehicle routing problem. Computers & Operations Research 30, 787-800. Beasley, D. (2000). Possible applications of evolutionary computation. In: Back et al. (2000a), pp. 4-19. Beasley, D., Bull, D., Martin, R . (1993). Reducing epistasis in combinatorial problems by expansive coding. In: Forrest, S. (Ed.), Proceeding of the Fifth Intern* tional Conference on Genetic Algorithms. Morgan Kaufmann. Berger, J., Barkaoui, M. (2002). A memetic algorithms for the vehicle routing problem with time windows. In: Proceedings of 7th International Command and Control Reserach and Technology Symposium.
154
References
Bierwirth, C., Mattfeld, D., Kopfer, H. (1996). On permutation representations for scheduling problems. In: Ebeling, W., Rechenberg, I., Schwefel, H., Voigt, H. (Eds.),Proceedings of Parallel Problem Solving from Nature IV. Springer-Verlag. Blanton, J., Wainwright, R. (1993). Multi vehicle routing with time and capacity constraints using genetic algorithms. In: Forrest, S. (Ed.), Proceedings of the Fifth International Conference On Genetic Algorithms. Morgan Kaufmann Publishers, Inc. Blum, C., Roli, A. (2001). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. Tech. Rep. TR/IRIDIA/2001-3, IRIDIA. Braysy, 0 . (2001). Genetic algorithms for the vehicle routing problem with time windows. Arpakannus 1, 33-38. Burke, E., Newall, J., Weare, R. (1996). A memetic algorithm for university exam timetabling. In: Burke, E., Ross, P. (Eds.), Proceedings of First International Conference of Practice and Theory of Automated Timetabling. Vol. 1153 of Lecture Notes in Computer Science. Springer. Butt
Data Loading...
