Optimizing the Door Assignment in LTL-Terminals

References

• Bartz-Beielstein T.Experimental Research in Evolutionary Computation—The New Experimentalism, Natural Computing Series (2006) (Springer, Berlin) Google Scholar
• Bartz-Beielstein T., Chmielewski A., Janas M., Naujoks B., Scheffermann R. Optimizing door assignment in LTL-terminals by evolutionary multiobjective algorithms. Proc. 2006 Congress on Evolutionary Comput. (CEC'06) Within Fourth IEEE World Congress on Comput. Intelligence (WCCI'06) (2006) (IEEE Press, Piscataway, NJ) Crossref, Google Scholar
• Bermúdez R., Cole M. H. A genetic algorithm approach to door assignments in breakbulk terminals. (2001) . Technical Report MBTC-1102, Mack-Blackwell Transportation Center, University of Arkansas, FayettevilleGoogle Scholar
• Coello Coello C. A., Van Veldhuizen D. A., Lamont G. B.EA for Solving Multi-Objective Problems (2002) (Kluwer, New York) Crossref, Google Scholar
• Davis L., Grefenstette J. J. Job shop scheduling with genetic algorithms. Proc. Internat. Conf. Genetic Algorithms and Their Appl. (1985) (Carnegie Mellon University, Pittsburgh) Google Scholar
• Deb K. Multi-objective optimization using evolutionary algorithms. Wiley-Interscience Series in Systems and Optimization (2001) (Wiley, Chichester, UK) Google Scholar
• Deb K., Agrawal S., Pratab A., Meyarivan T., Schoenauer M., Deb K., Rudolph G., Yao X., Lutton E., Merelo J. J., Schwefel H.-P. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proc. Parallel Problem Solving from Nature VI Conf. (2000a) 1917Paris, France(Springer)849–858Lecture Notes in Computer ScienceCrossref, Google Scholar
• Deb K., Agrawal S., Pratab A., Meyarivan T. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. (2000b) . KanGAL Report 200001, Indian Institute of Technology, Kanpur, IndiaGoogle Scholar
• Ehrgott M., Gandibleux X. A survey and annotated bibliography of MCO. OR Spektrum (2000) 22:425–460Crossref, Google Scholar
• Ehrgott M., Gandibleux X., Ehrgott M., Gandibleux X. Multiobjective combinatorial optimization—Theory, methodology, and applications. Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys (2002) (Kluwer Academic Publishers, Boston) 369–444Crossref, Google Scholar
• Emmerich M., Beume N., Naujoks B., Coello Coello C. A., Hernández Aguirre A., Zitzler E. An EMO algorithm using the hypervolume measure as selection criterion. Evolutionary Multi-Criterion Optimization. Third Internat. Conf., EMO 2005 (2005) 3410Guanajuato, México(Springer)62–76Lecture Notes in Computer ScienceCrossref, Google Scholar
• Fonseca C. M., Fleming P. J. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Comput. (1995) 3(1):1–16Crossref, Google Scholar
• Grefenstette J. J., Gopal R., Rosmaita B. J., Van Gucht D., Grefenstette J. J. Genetic algorithm for the travelling salesman problem. Proc. Intl. Conf. Genetic Algorithms and Their Appl. (1985) (Carnegie Mellon University, Pittsburgh) Google Scholar
• Gue G., Bartholdi J. The effects of trailer scheduling on the layout of freight terminals. (1999) . Technical report, Naval Postgraduate School, Monterey, CAGoogle Scholar
• Hart W. E., Krasnogor N., Smith J. E.Recent Advances in Memetic Algorithms, Vol. 166. Studies in Fuzziness and Soft Computing (2005) (Springer, Heidelberg, Germany) Crossref, Google Scholar
• Hart E., Ross P., Corne D. Evolutionary scheduling: A review. Genetic Programming Evolvable Machine (2005) 6:191–220Crossref, Google Scholar
• Huisman D. Integrated and dynamic vehicle and crew scheduling. (2004) . Ph.D. thesis, Tinbergen Institute, Erasmus University Rotterdam, The NetherlandsGoogle Scholar
• Huisman D., Jans R., Peeters M., Wagelmans A. P. M., Desaulniers J., et al. Combining column generation and Lagrangian relaxation. Column Generation, GERAD 25th Anniversary Series (2005) (Springer, New York) 247–270Crossref, Google Scholar
• Krasnogor N. Studies on the theory and design space of memetic algorithms. (2002) . Ph.D. thesis, University of the West of England, Bristol, UKGoogle Scholar
• Laumanns M. Analysis and applications of evolutionary multiobjective optimization algorithms. (2003) . Ph.D. thesis, Swiss Federal Institute of Technology, ZürichGoogle Scholar
• Savelsbergh M. W. P., Sol M. A branch-and-price algorithm for the pickup and delivery problem with time windows. (1994) . Technical Report COC-94-06, Georgia Institute of Technology, AtlantaGoogle Scholar
• Schaffer J. D., Grefenstette J. J. Multiple objective optimization with vector evaluated genetic algorithms. Proc. Internat. Conf. Genetic Algorithms Their Appl. (1985) (Carnegie-Mellon University, Pittsburgh) Google Scholar
• Smith D., Grefenstette J. J. Bin packing with adaptive search. Proc. Internat. Conf. Genetic Algorithms Their Appl. (1985) (Carnegie Mellon University, Pittsburgh) Google Scholar
• Stickel M., Marquardt Hans-Georg. Efficient operational Torbelegung using combinatorial auctions. Fachkolloquium der WGTL, Conf. Proc (2006) (Technical University of Dresden, Dresden, Germany) 145–158Google Scholar