Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications

References

• Aarts E. H. L., Korst J. H. M.Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (1989) (John Wiley & Sons, Chichester, UK) Google Scholar
• Ackley D. H.A Connectionist Machine for Genetic Hillclimbing (1987) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Arnold P., Peeters D., Thomas I. Modelling a rail/road intermodal transportation system. Transportation Res. Part E (2004) 40:255–270Crossref, Google Scholar
• Arroyo J. E. C., Armentano V. A. Genetic local search for multi-objective flowshop scheduling problems. Eur. J. Oper. Res. (2005) 151:717–738Crossref, Google Scholar
• Aykin T. On a quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1990) 46:409–411Crossref, Google Scholar
• Balakrishnan A., Magnanti T. L., Wong R. T. A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. (1989) 37:716–740Link, Google Scholar
• Bard J. F.Practical Bilevel Optimization: Algorithms and Applications (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Boyce D. E. Urban transportation network equilibrium and design models: Recent achievements and future prospectives. Environ. Planning (1984) 16 A:1445–1474Crossref, Google Scholar
• Braess D., Nagurney A., Wakolbinger T. On a paradox of traffic planning. Transportation Sci. (2005) 39:446–450Link, Google Scholar
• Bruynooghe M. An optimal method of choice of investments in a transport network. Presentation, Planning & Transport Research & Computation Seminars on Urban Traffic Model Reasearch (1972) London, UKGoogle Scholar
• Campbell J. Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. (1994) 72:387–405Crossref, Google Scholar
• Campbell J. Hub location and the p-hub median problem. Oper. Res. (1996) 44:923–935Link, Google Scholar
• Cascetta E.Transportation Systems Engineering: Theory and Methods (2001) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Chen M., Alfa A. S. A network design algorithm using a stochastic incremental traffic assignment approach. Transportation Sci. (1991) 25:215–224Link, Google Scholar
• Crainic T. G., Florian M., Leal J. A model for the strategic planning of national freight transportation by rail. Transportation Sci. (1990) 24:1–24Link, Google Scholar
• Dafermos S. C. Traffic equilibrium and variational inequality. Transportation Sci. (1980) 14:43–54Link, Google Scholar
• Daskin M. S.Network and Discrete Location: Models, Algorithms, and Applications (1995) (John Wiley & Sons, New York) Crossref, Google Scholar
• Davidor Y.Genetic Algorithms and Robotics: A Heuristic Strategy for Optimization (1991) (World Scientific Publishing, Singapore) Crossref, Google Scholar
• Davis L.Handbook of Genetic Algorithms (1991) (Van Nostrand, New York) Google Scholar
• Dell'Amico M., Lodi A., Maffioli F. Solution of the cumulative assignment problem with a well-structured tabu search method. J. Heuristics (1999) 5:123–143Crossref, Google Scholar
• Diaz J. A., Fernadez E. A tabu search heuristic for the generalized assignment problem. Eur. J. Oper. Res. (2001) 132:22–38Crossref, Google Scholar
• Dorigo M., Stutzle T.Ant Colony Optimization (2004) (MIT Press, Boston) Crossref, Google Scholar
• Dorigo M., Di Caro G., Gambardella L. M. Ant algorithms for discrete optimization. Artificial Life (1999) 5:137–172Crossref, Google Scholar
• Drezner Z.Facility Location: A Survey of Applications and Methods (1995) (Springer-Verlag, Heidelberg) Crossref, Google Scholar
• Florian M., Spiess H. The convergence of diagonalization algorithms for asymmetric network equilibrium problems. Transportation Res. Part B (1982) 16:477–483Crossref, Google Scholar
• Francis R. L., McGinnis L. F., White J. A.Facility Layout and Location: An Analytical Approach (1992) (Prentice-Hall, Upper Saddle River, NJ) Google Scholar
• Friesz T. L., Tobin R. L., Harker P. T. Predictive intercity freight network models: The state of the art. Transportation Res. Part A (1983) 17:409–417Crossref, Google Scholar
• Galinier P., Hao J. K. Hybrid evolutionary algorithms for graph coloring. Combin. Optim. (1999) 3:379–397Crossref, Google Scholar
• Gao Z., Wu J., Sun H. Solution algorithm for the bi-level discrete network design problem. Transportation Res. Part B (2005) 39:479–495Crossref, Google Scholar
• Glover F., Kochenberger G. A.Handbook of Metaheuristics (2003) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Glover F., McMillan C. The general employee scheduling problem: An integration of management science and artificial intelligence. Comput. Oper. Res. (1986) 15:563–593Crossref, Google Scholar
• Goldberg D. E.Genetic Algorithms in Search, Optimization, and Machine Learning (1989) (Addison Wesley, Reading, MA) Google Scholar
• Guelat J., Florian M., Crainic T. G. A multimode multiproduct network assignment model for strategic planning of freight flows. Transportation Sci. (1990) 24:25–39Link, Google Scholar
• Herz A., Widmer M. Guidelines for the use of metaheuristics in combinatorial optimization. Eur. J. Oper. Res. (2003) 151:247–252Crossref, Google Scholar
• Holland J. H.Adaptation in Natural and Artificial Systems (1975) (University of Michigan Press, Ann Arbor, MI) Google Scholar
• Jaszkiewicz A. Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. (2002) 137:50–71Crossref, Google Scholar
• Jaszkiewicz A., Kominek P. Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur. J. Oper. Res. (2003) 151:352–364Crossref, Google Scholar
• Kirkpatrick S. C., Gellat D., Vecchi M. P. Optimization by simulated annealing. Science (1983) 220:671–680Crossref, Google Scholar
• Laporte G., Golden B. L., Assad A. A. Location-routing Problems. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam) 163–198Google Scholar
• Luo J. S., Pang Z. Q., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Magnanti T. L., Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18:1–55Link, Google Scholar
• Melkote S., Daskin M. S. An integrated model of facility location and transportation network design. Transportation Res. Part A (2001) 35:515–538Google Scholar
• Merz P., Freisleben B. Genetic local search for the TSP: New results. Proc. 1997 IEEE Internat. Conf. Evolutionary Comput. (1997) (New York)159–164Crossref, Google Scholar
• Michalewicz Z., Fogel D. B.How to Solve It: Modern Heuristics (2002) (Springer-Verlag, Berlin) Google Scholar
• Min H., Jayaraman V., Srivastava R. Combined location-routing problems: A synthesis and future research directions. Eur. J. Oper. Res. (1998) 108:1–15Crossref, Google Scholar
• Murata T., Ishibuchi H. Performance evaluation of genetic algorithms for flowshop scheduling problems. Proc. 1st IEEE Internat. Conf. Evolutionary Comput. (1994) (IEEE, Orlando, FL) 812–817Crossref, Google Scholar
• Nagurney A.Sustainable Transportation Networks (2000) (Edward Elgar, Northampton, UK) Google Scholar
• Nagurney A., Dong J. A multiclass, multicriteria traffic network equilibrium model with elastic demand. Transportation Res. Part B (2001) 36:445–469Crossref, Google Scholar
• O'Kelly M. A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. (1987) 32:393–404Crossref, Google Scholar
• Poorzahedy H., Turnquist M. A. Approximate algorithms for the discrete network design problem. Transportation Res. Part (1982) 16:45–55Crossref, Google Scholar
• Priemus H. On modes, nodes and networks: Technological and spatial conditions for a breakthrough towards multimodal terminals and networks of freight transport in Europe. Transportation Planning Tech. (1999) 23:83–103Crossref, Google Scholar
• Radcliffe N. J., Surry P. D., Fogarty T. Formal memetic algorithms. Evolutionary Computing (1994) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Ravi R., Sinha A. Approximation algorithms for problems combining facility location and network design. Oper. Res. (2006) 54:73–81Link, Google Scholar
• Reeves C. R. Genetic algorithms for the operations researcher. INFORMS J. Comput. (1997) 9:231–250Link, Google Scholar
• Resende M. G. C., Pinho de Sousa J.Metaheuristics: Computer Decision-Making (2004) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• ReVelle C. S., Laporte G. The plant location problem: New models and research prospects. Oper. Res. (1996) 44:864–874Link, Google Scholar
• Ribeiro C., Hansen P.Essays and Surveys on Metaheuristics (2001) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
• Rochat Y., Taillard E. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Rothengatter W., Kroon M., Smit R., Van Ham J. Cost-benefit-analyses for goods transport on roads. Freight Transport and the Environment (1991) (Elsevier, Amsterdam) 187–213Crossref, Google Scholar
• Russ B. F., Yamada T., Castro J., Yasukawa H. Optimising the design of multimodal freight transport network in Indonesia. J. Eastern Asia Soc. Transportation Stud. (2005) 6:2894–2907Google Scholar
• Sheffi Y.Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (1985) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Shepherd S. P., Sumalee A. A genetic algorithm based approach to optimal toll level and location problem. Networks Spatial Econom. (2004) 4(2):161–179Crossref, Google Scholar
• Southworth F., Peterson B. E. Intermodal and international freight modeling. Transportation Res. Part C (2000) 8:147–166Crossref, Google Scholar
• Stackelberg H. V.Marketform and Gleichgewicht (1934) (Julius Springer, Vienna) Google Scholar
• Steenbrink A. Transport network optimization in the Dutch integral transportation study. Transportation Res. Part B (1974) 8:11–27Crossref, Google Scholar
• Syswerda G. Uniform crossover in genetic algorithms. Proc. Third Internat. Conf. Genetic Algorithms (1989) (Morgan Kaufmann Publishers, Inc., Fairfax, VA) 2–9Google Scholar
• Taniguchi E., Noritake M., Yamada T., Izumitani T. Optimal size and location planning of public logistics terminals. Transportation Res. Part E (1999) 35:207–222Crossref, Google Scholar
• Taniguchi E., Thompson R. G., Yamada T., Van Duin J. H. R.City Logistics: Network Modelling and Intelligent Transport Systems (2001) (Pergamon, Oxford, UK) Crossref, Google Scholar
• Tavasszy L. A. Modeling European freight transport flows. (1996) . Unpublished doctoral dissertation, Delft University of Technology, Delft, The NetherlandsGoogle Scholar
• Thomas R. Traffic assignment techniques. Avebury Technical (1991) Google Scholar
• Yagiura M., Ibaraki T. On metaheuristic algorithms for combinatorial optimization problems. Systems Comput. Japan (2001) 32:33–55Crossref, Google Scholar
• Yamada T., Taniguchi E., Noritake M., Sucharov L. J. Optimal location planning of logistics terminals based on multiobjective programming method. Urban Transport V (1999) (WIT Press, Southampton, UK) 449–458Google Scholar
• Yang H., Bell M. G. H. Models and algorithms for road network design: A review and some new developments. Transport Rev. (1998) 18:257–278Crossref, Google Scholar
• Zhang X., Yang H. The optimal cordon-based network congestion pricing problem. Transportation Res. Part B (2004) 38:517–537Crossref, Google Scholar