HU Yannan

J-GLOBAL         Last updated: Dec 8, 2018 at 05:04
 
Avatar
Name
HU Yannan
E-mail
yannanhunagoya-u.jp
URL
http://www.co.cm.is.nagoya-u.ac.jp/~yannanhu/index_en.html
Affiliation
Nagoya University
Section
Graduate School of Informatics Department of Mathematical Informatics 2
Job title
Assistant Professor
Research funding number
00778326

Research Areas

 
 

Academic & Professional Experience

 
Apr 2014
 - 
Feb 2016
Research Fellow, Japan Society for the Promotion of Science (JSPS)
 
Mar 2016
 - 
Mar 2017
Assistant Professor, Graduate School of Information Science Department of Computer Science and Mathematical Informatics Mathematical Modeling and Analysis, Nagoya University
 
Apr 2017
 - 
Today
Assistant Professor, Graduate School of Informatics Department of Mathematical Informatics 2, Nagoya University
 
Apr 2017
 - 
Today
Graduate School of Informatics, Nagoya University
 

Education

 
Apr 2013
 - 
Feb 2016
Graduate School, Division of Information Science, Nagoya University
 

Misc

 
Efficient Overlap Detection and Construction Algorithms for the Bitmap Shape Packing Problem
Y. Hu, S. Fukatsu, H. Hashimoto, S. Imahori, M. Yagiura
The Journal of the Operations Research Society of Japan   61(1) 132-150   Jan 2018   [Refereed]
A Partition-Based Heuristic Algorithm for the Rectilinear Block Packing Problem
Y. Hu, H. Hashimoto, S. Imahori, T. Uno, M. Yagiura
Journal of the Operations Research Society of Japan   59 110-129   Jan 2016   [Refereed]
A Heuristic Algorithm for the Container Loading Problem with Complex Loading Constraints
H. Iwasawa, Y. Hu, H. Hashimoto, S. Imahori, M. Yagiura
Journal of Advanced Mechanical Design, Systems, and Manufacturing   10 12 pages   2016   [Refereed]
In this paper, we propose a heuristic algorithm for a container loading problem for logistic platforms, which is the problem for the Challenge Renault/ESICUP 2015. The three-dimensional container loading problem involves packing a set of cuboid it...
A Column Generation Approach to the Airline Crew Pairing Problem to Minimize the Total Person-days
W. Wu, Y. Hu, H. Hashimoto, T. Ando, T. Shiraki, M. Yagiura
Journal of Advanced Mechanical Design, Systems, and Manufacturing   10 11 pages   2016   [Refereed]
In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not v...
Efficient Implementations of Construction Heuristics for the Rectilinear Block Packing Problem
Y. Hu, H. Hashimoto, S. Imahori, M. Yagiura
Computers and Operations Research   53 206-222   2015   [Refereed]

Conference Activities & Talks

 
A Tabu search algorithm for the multi-vehicle covering tour problem
Y. Takada, Y. Takeuchi, Y. Hu, H. Hashimoto, M. Yagiura
12th Metaheuristics International Conference   4 Jul 2017   
Efficient Implementations of an Iterated Local Search Algorithm for the Multi-Vehicle Covering Tour Problem
Yuta Takeuchi, Yosuke Takada, Yannan Hu, Hideki Hashimoto, Mutsunori Yagiura
International Symposium on Scheduling   23 Jun 2017   
Modeling and Analysis with Real-World Data for Global Production Planning and Location of Automobile Assembly Plants
Kie Funahashi, Wei Wu, Yannan Hu, Hiromichi Goko, Mihiro Sasaki, and Mutsunori Yagiura
International Symposium on Scheduling   23 Jun 2017   
Online Product Shipping Using Heuristic Algorithms Based on Column Generation
Mayu Ito, Wei Wu, Yannan Hu, Hiromichi Goko, Mihiro Sasaki, and Mutsunori Yagiura
International Symposium on Scheduling   23 Jun 2017   
A New Solution Representation for the Rectilinear Block Packing Problem
K. Matsushita, Y. Hu, H. Hashimoto, S. Imahori, M. Yagiura
The IEEE International Conference on Industrial Engineering and Engineering Management   4 Dec 2016   

Research Grants & Projects

 
Research on algorithms for 2D and 3D packing problems
Grants-in-Aid for Scientific Research
Project Year: Apr 2014 - Feb 2016
Two-dimensional and three dimensional packing problems belong to a class of combinatorial optimization problems. These problems are related to real-world applications and they have been studied for a long time from both theoretical and practical ...