163
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

A Hybrid Iterated Greedy Algorithm for Hydrographic Survey Routing Problem

ORCID Icon, ORCID Icon, ORCID Icon, ORCID Icon &
Pages 75-100 | Received 11 Apr 2021, Accepted 10 Oct 2021, Published online: 12 Nov 2021

References

  • Arroyo, J. E. C., and J. Y. T. Leung. 2017. An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Computers & Industrial Engineering 105:84–100.
  • Aykut, N. O., and B. Akpınar. 2013. Determining the dynamic draught for precise hydrographic surveying. Ocean Engineering 62:38–44.
  • Baniasadi, P., M. Foumani, K. Smith-Miles, and V. Ejov. 2020. A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. European Journal of Operational Research 285 (2):444–57.
  • Berber, M., and W. Wright. 2016. Online kinematic GNSS data processing for small hydrographic surveys. Ocean Engineering 112:335–9.
  • Calder, B. R. 2015. On risk-based expression of hydrographic uncertainty. Marine Geodesy 38 (2):99–127.
  • Chen, C.,. K. Sasa, T. Ohsawa, and J. Prpić-Oršić. 2020. Comparative study on WRF model simulations from the viewpoint of optimum ship routing. Ocean Engineering 207:107379.
  • Chen, X., Y. Zhou, Z. Tang, and Q. Luo. 2017. A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems. Applied Soft Computing 58:104–14.
  • Chénier, R., L. Abado, and H. Martin. 2018. CHS Priority Planning Tool (CPPT)—A GIS Model for Defining Hydrographic Survey and Charting Priorities. ISPRS International Journal of Geo-Information 7 (7):240.
  • Decerle, J., O. Grunder, A. Hajjam El Hassani, and O. Barakat. 2018. A memetic algorithm for a home health care routing and scheduling problem. Operations Research for Health Care 16:59–71.
  • Delgado-Antequera, L., R. Caballero, J. Sánchez-Oro, J. M. Colmenar, and R. Martí. 2020. Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Systems with Applications 145:113101.
  • Deng, J., and L. Wang. 2017. A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm and Evolutionary Computation 32:121–31.
  • Duan, J., X. Wan, and J. Luo. 2021. Research on the hydrographic survey cycle for updating navigational charts. Journal of Navigation 74 (4):750–13.
  • Gokalp, O. 2020. An iterated greedy algorithm for the obnoxious p-median problem. Engineering Applications of Artificial Intelligence 92:103674.
  • Gong, G.,. Q. Deng, R. Chiong, X. Gong, and H. Huang. 2019. An effective memetic algorithm for multi-objective job-shop scheduling. Knowledge-Based Systems 182:104840.
  • Greenaway, S. F., A. Batts, and J. Riley. 2020. Are we done yet? An empirical estimator for level of effort for seafloor surveys – Including an estimate for the full survey of U.S. waters. Marine Geodesy 43 (2):87–104.
  • Herath Mudiyanselage, I. P., M. D. E. K. Gunathilaka, and D. R. Welikanna. 2021. Development of a unified vertical reference framework for Land and Hydrographic surveying in Sri Lanka. Marine Geodesy :1–12.
  • Huang, C., M. Wu, X. Huang, J. Cao, J. He, C. Chen, G. Zhai, K. Deng, and X. Lu. 2020. Reconstruction and evaluation of the full-depth sound speed profile with World Ocean Atlas 2018 for the hydrographic surveying in the deep sea waters. Applied Ocean Research 101:102201.
  • Kim, S. W., H. K. Jang, Y. J. Cha, H. S. Yu, S. J. Lee, D. H. Yu, A. R. Lee, and E. J. Jin. 2020. Development of a ship route decision-making algorithm based on a real number grid method. Applied Ocean Research 101:102230.
  • Li, W., Q. Kang, H. Kong, C. Liu, and Y. Kang. 2020. A novel iterated greedy algorithm for detecting communities in complex network. Social Network Analysis and Mining 10 (1):29.
  • Loyer, S., Mallégol, A., Dao, S. D., Mohammadi, M., Meyer, P., Le Gleau, M., Leidinger, N. In press. deSEAsion: Un outil d’analyse de risques pour l’hydrographie. .
  • Ma, D., W. Ma, S. Jin, and X. Ma. 2020. Method for simultaneously optimizing ship route and speed with emission control areas. Ocean Engineering 202:107170.
  • Mao, J-y, Q-k Pan, Z-h Miao, and L. Gao. 2021. An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Expert Systems with Applications 169:114495.
  • Nogueira Terra, T., and R. Ferreira dos Santos. 2012. Measuring cumulative effects in a fragmented landscape. Ecological Modelling 228:89–95.
  • Paul, J. F., J. L. Copeland, M. Charpentier, P. V. August, and J. W. Hollister. 2003. Overview of GIS applications in estuarine monitoring and assessment research. Marine Geodesy 26 (1-2):63–72.
  • Pereira, J., M. Ritt, and Ó. C. Vásquez. 2018. A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Computers & Operations Research 99:249–61.
  • Robin, C., S. Nudds, P. MacAulay, A. Godin, B. De Lange Boom, and J. Bartlett. 2016. Hydrographic Vertical Separation Surfaces (HyVSEPs) for the tidal waters of Canada. Marine Geodesy 39 (2):195–222.
  • Saji, Y., and M. Barkatou. 2021. A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem. Expert Systems with Applications 172:114639.
  • Sakib, S. 2017. Implementation of Digital IMU for Increasing the accuracy of hydrographic survey. Procedia Engineering 194:386–93.
  • Sánchez-Oro, J., and A. Duarte. 2018. Iterated Greedy algorithm for performing community detection in social networks. Future Generation Computer Systems 88:785–91.
  • Shao, W., Z. Shao, and D. Pi. 2020. Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowledge-Based Systems 194:105527.
  • Specht, M., and C. Specht. 2018. Hydrographic survey planning for the determination of territorial sea baseline on the example of selected Polish sea areas. In International Multidisciplinary Scientific GeoConference. Sofia, Bulgaria.
  • Vu, K. K., C. D'Ambrosio, Y. Hamadi, and L. Liberti. 2017. Surrogate-based methods for black-box optimization. International Transactions in Operational Research 24 (3):393–424.
  • Wang, L., Z. Zhang, Q. Zhu, and S. Ma. 2020. Ship route planning based on double-cycling genetic algorithm considering ship maneuverability constraint. IEEE Access. 8:190746–59.
  • Wang, X., S. Wang, L. Wang, H. Zheng, J. Hao, R. He, and Z. Sun. 2020. An effective iterated greedy algorithm for online route planning problem. In 2020 IEEE Congress on Evolutionary Computation (CEC).
  • Wen, Y., Z. Sui, C. Zhou, C. Xiao, Q. Chen, D. Han, and Y. Zhang. 2020. Automatic ship route design between two ports: A data-driven method. Applied Ocean Research 96:102049.
  • Wright, R. G., and M. Baldauf. 2016. Hydrographic survey in remote regions: using vessels of opportunity equipped with 3-dimensional forward-looking SONAR. Marine Geodesy 39 (6):439–57.
  • Wu, L., S. Wang, and G. Laporte. 2021. The robust bulk ship routing problem with batched cargo selection. Transportation Research Part B: Methodological 143:124–59.
  • Yazdi, A. K, et al. 2020. A binary particle swarm optimization algorithm for ship routing and scheduling of liquefied natural gas transportation. Transportation Letters 12 (4):223–32.
  • Zhang, G., H. Wang, W. Zhao, Z. Guan, and P. Li. 2021. Application of improved multi-objective ant colony optimization algorithm in ship weather routing. Journal of Ocean University of China 20 (1):45–55.
  • Zhou, Q., U. Benlic, and Q. Wu. 2020. An opposition-based memetic algorithm for the maximum quasi-clique problem. European Journal of Operational Research 286 (1):63–83.
  • Zou, W. Q., Q. K. Pan, and M. F. Tasgetiren. 2021. An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop. Applied Soft Computing 99:106945.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.