Bin Hu

Recent Publications

A Memetic Algorithm for Competitive Facility Location Problems
Chapter in Business and Consumer Analytics: New Ideas, pages 637-660, 2019, Springer.
An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands
Electronic Notes in Discrete Mathematics, volume 52, pages 245-252, 2016.
Note: INOC 2015 – 7th International Network Optimization Conference
Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior
Annals of Mathematics and Artificial Intelligence, volume 76, number 1, pages 93-119, 2016, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf
A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem
Journal of Heuristics, volume 21, number 3, pages 391-431, 2015, Springer US.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf
A New Solution Representation for the Firefighter Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Ochoa, Gabriela and Chicano, Francisco), volume 9026 of LNCS, pages 25-35, 2015, Springer.
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2015 (Ochoa, Gabriela and Chicano, Francisco), volume 9026 of LNCS, pages 48-60, 2015, Springer.
Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Computer Aided Systems Theory – EUROCAST 2015 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 9520 of LNCS, pages 342-349, 2015, Springer International Publishing Switzerland.
Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia and others), pages 99 - 100, 2015.
An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior
Conference Proceedings of Learning and Intelligent Optimization Conference (LION~8), volume 8426 of LNCS, pages 203-217, 2014, Springer.
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2014 (Blum, Christian and Ochoa, Gabriela), volume 8600 of LNCS, pages 73-84, 2014, Springer.
Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem
Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa and Christain Blum and Stefan Voß), volume 8457 of LNCS, pages 183-197, 2014, Springer.
A Memetic Algorithm for the Partition Graph Coloring Problem
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 167-169, 2013.
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem
Computer Aided Systems Theory – EUROCAST 2013 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 219-226, 2013, Springer.
A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 200-202, 2013.
A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 223-225, 2013.
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach
Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP~2013 (M. Middendorf and C. Blum), volume 7832 of LNCS, pages 121-132, 2013, Springer.
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations
Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa and others), volume 7919 of LNCS, pages 130-143, 2013, Springer.
Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents
Computer Aided Systems Theory – EUROCAST 2013 (Moreno-Díaz, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis), volume 8111 of LNCS, pages 380-387, 2013, Springer.
PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems
2013, Technical report TR 186-1-13-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 226-228, 2013.
An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz and F. Pichler and A. Quesada-Arencibia), volume 6927 of LNCS, pages 287-294, 2012, Springer.
An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem
Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pages 393-400, 2012, ACM Press.
An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia and others), pages 256-259, 2011.
A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem
2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (F. Xhafa and others), pages 356-361, 2010, Conference Publishing Services.
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 239-251, 2010, Springer.
Note: best paper award winner
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
Networks, volume 55, number 3, pages 256-275, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hu-07.pdf
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
9th International Conference on Hybrid Intelligent Systems – HIS~2009, pages 63-68, 2009.
Note: best paper award winner
Hybrid Metaheuristics for Generalized Network Design Problems
December 2008, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert and Carlos Cotta), volume 4972 of LNCS, pages 36-47, 2008, Springer.
Note: best paper award winner
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS~2008 (Fatos Xhafa and others), pages 73-77, 2008.
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem
Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz), pages 69/1-6, 2007.
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
2006, Technical report TR 186-1-06-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering
Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (Carlos Cotta and Antonio J. Fernandez and Jose E. Gallardo), 2006.
Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.