Interaction of maritime shipping and hinterland traffic using a two-level hierarchical transport network

References

• Applegate, D. L., R. E. Bixby, W. J. Chvátal, and W. J. Cook. 2006. The Traveling Salesman Problem: A Computational Study. Princeton, NJ: Princeton University Press.
   Google Scholar
• Archetti, C., and M. G. Speranza. 2008. “The Split Delivery Vehicle Routing Problem: A Survey.” In The Vehicle Routing Problem: Latest Advances and New Challenges, edited by B. Golden, S. Raghavan, and E. Wasil, 103–122. Vol. 43 of Operations Research/Computer Science Interfaces Series. New York: Springer.
   Google Scholar
• Avriel, M., M. Penn, and N. Shpirer. 2000. “Container Ship Stowage Problem: Complexity and Connection to the Coloring of Circle Graphs.” Discrete Applied Mathematics 103: 271–279. doi: 10.1016/S0166-218X(99)00245-0
   Web of Science ®Google Scholar
• Baldacci, R., P. Toth, and D. Vigo. 2010. “Exact Algorithms for Routing Problems Under Vehicle Capacity Constraints.” Annals of Operations Research 175 (1): 213–245. doi: 10.1007/s10479-009-0650-0
   Web of Science ®Google Scholar
• Bianchessi, N., R. Mansini, and M. G. Speranza. 2014. “The Distance Constrained Multiple Vehicle Traveling Purchaser Problem.” European Journal of Operational Research 235 (1): 73–87. doi: 10.1016/j.ejor.2013.10.018
   Web of Science ®Google Scholar
• Bontoux, B., and D. Feillet. 2008. “Ant Colony Optimization for the Traveling Purchaser Problem.” Computers & Operations Research 35 (2): 628–637. doi: 10.1016/j.cor.2006.03.023
   Web of Science ®Google Scholar
• Cappanera, P., L. Gouveia, and M. G. Scutellà. 2011. “The Skill Vehicle Routing Problem.” In International Network Optimization Conference 2011, edited by J. Pahl, T. Reiners, and S. Voß, 354–364. Vol. 6701 of Lecture Notes in Computer Science. Berlin: Springer.
   Google Scholar
• Cariou, P. 2008. “Liner Shipping Strategies: An Overview.” International Journal of Ocean Systems Management 1 (1): 2–13. doi: 10.1504/IJOSM.2008.017778
   Google Scholar
• Cariou, P. 2011. “Is Slow Steaming a Sustainable Means of Reducing CO2 Emissions from Container Shipping?” Transportation Research Part D: Transport and Environment 16 (3): 260–264. doi: 10.1016/j.trd.2010.12.005
   Web of Science ®Google Scholar
• Choi, M.-J., and S.-H. Lee. 2010. “The Multiple Traveling Purchaser Problem.” Proceedings of the 40th international conference on computers and industrial engineering (CIE), Awaji, Japan.
   Google Scholar
• Choi, M.-J., and S.-H. Lee. 2011. “The Multiple Traveling Purchaser Problem for Maximizing System's Reliability with Budget Constraints.” Expert Systems with Applications 38 (8): 9848–9853. doi: 10.1016/j.eswa.2011.02.018
   Web of Science ®Google Scholar
• Cordeau, J.-F., M. Gendreau, A. Hertz, G. Laporte, and J.-S. Sormany. 2005. “New Heuristics for the Vehicle Routing Problem.” In Logistics Systems: Design and Optimization, edited by A. Langevin and D. Riopel, 279–297. New York: Springer.
   Google Scholar
• Forsgren, A., and M. Prytz. 2006. “Telecommunications Network Design.” In Handbook of Optimization in Telecommunications, edited by M. G. C. Resende and P. M. Pardalos, 269–290. New York: Springer.
   Google Scholar
• Golden, B., S. Raghavan, and E. Wasil, eds. 2008. The Vehicle Routing Problem – Latest Advances and New Challenges. Berlin: Springer.
   Google Scholar
• Gouveia, L., A. Paias, and S. Voß. 2011. “Models for a Traveling Purchaser Problem with Additional Side-constraints.” Computers & Operations Research 38: 550–558. doi: 10.1016/j.cor.2010.07.016
   Web of Science ®Google Scholar
• Hoffman, K. L., M. Padberg, and G. Rinaldi. 2013. “Traveling Salesman Problem.” In Encyclopedia of Operations Research and Management Science, edited by S. I. Gass and M. C. Fu, 1573–1578. New York: Springer.
   Google Scholar
• Hu, B., and G. R. Raidl. 2008. “Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.” In Evolutionary Computation in Combinatorial Optimization, edited by J. van Hemert and C. Cotta, 36–47. Vol. 4972 of Lecture Notes in Computer Science. Berlin: Springer.
   Google Scholar
• Infante, D., G. Paletta, and F. Vocaturo. 2009. “A Ship-Truck Intermodal Transportation Problem.” Maritime Economics & Logistics 11 (3): 247–259. doi: 10.1057/mel.2009.6
   Web of Science ®Google Scholar
• Jozefowiez, N., F. Glover, and M. Laguna. 2008. “Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits.” Journal of Mathematical Modelling and Algorithms 7 (2): 177–195. doi: 10.1007/s10852-008-9080-2
   Google Scholar
• Kanga, S., and Y. Ouyang. 2011. “The Traveling Purchaser Problem with Stochastic Prices: Exact and Approximate Algorithms.” European Journal of Operational Research 209 (3): 265–272. doi: 10.1016/j.ejor.2010.09.012
   Web of Science ®Google Scholar
• Kovacs, A. 2009. “Heuristics for Service Technician Routing and Scheduling.” PhD diss., University of Vienna.
   Google Scholar
• Laporte, G. 2007. “What You Should Know About the Vehicle Routing Problem.” Naval Research Logistics 54 (8): 811–819. doi: 10.1002/nav.20261
   Web of Science ®Google Scholar
• Laporte, G. 2010. “A Concise Guide to the Traveling Salesman Problem.” Journal of the Operational Research Society 61: 35–40. doi: 10.1057/jors.2009.76
   Web of Science ®Google Scholar
• Manerba, D., and R. Mansini. 2015. “A Branch-and-Cut Algorithm for the Multi-vehicle Traveling Purchaser Problem with Pairwise Incompatibility Constraints.” Networks 65 (2): 139–154. doi: 10.1002/net.21588
   Web of Science ®Google Scholar
• Öncan, T., İ. K. Altınel, and G. Laporte. 2009. “A Comparative Analysis of Several Asymmetric Traveling Salesman Problem Formulations.” Computers & Operations Research 36 (3): 637–654. doi: 10.1016/j.cor.2007.11.008
   Web of Science ®Google Scholar
• Riera-Ledesma, J., and J. J. Salazar-González. 2005. “A Heuristic Approach for the Travelling Purchaser Problem.” European Journal of Operational Research 162 (1): 142–152. doi: 10.1016/j.ejor.2003.10.032
   Web of Science ®Google Scholar
• Samanlioglu, F., W. G. Ferrell Jr, and M. E. Kurz. 2008. “A Memetic Random-Key Genetic Algorithm for a Symmetric Multi-objective Traveling Salesman Problem.” Computers & Industrial Engineering 55 (2): 439–449. doi: 10.1016/j.cie.2008.01.005
   Web of Science ®Google Scholar
• Schwarze, S., and S. Voß. 2013. “Improved Load Balancing and Resource Utilization for the Skill Vehicle Routing Problem.” Optimization Letters 7 (8): 1805–1823. doi: 10.1007/s11590-012-0524-2
   Web of Science ®Google Scholar
• Snyder, L. V., and M. S. Daskin. 2006. “A Random-Key Genetic Algorithm for the Generalized Traveling Salesman Problem.” European Journal of Operational Research 174 (1): 38–53. doi: 10.1016/j.ejor.2004.09.057
   Web of Science ®Google Scholar
• Toth, P., and D. Vigo. 2001. The Vehicle Routing Problem. Philadelphia, PA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Tsai, C.-F., C.-W. Tsai, and C.-C. Tseng. 2004. “A New Hybrid Heuristic Approach for Solving Large Traveling Salesman Problem.” Information Sciences 166 (1–4): 67–81. doi: 10.1016/j.ins.2003.11.008
   Web of Science ®Google Scholar
• Voß, S. 1996. “Dynamic Tabu Search Strategies for the Traveling Purchaser Problem.” Annals of Operations Research 63 (2): 253–275. doi: 10.1007/BF02125457
   Web of Science ®Google Scholar