Vns | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/vns/VnsHugo Blox Builder (https://hugoblox.com)en-usFri, 01 Mar 2019 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngVnshttps://ac.tuwien.ac.at/tag/vns/Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Controlhttps://ac.tuwien.ac.at/publication/algorithmic-approaches-for-optimization-problems-in-bike-sharing-and-security-control/Fri, 01 Mar 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-approaches-for-optimization-problems-in-bike-sharing-and-security-control/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problemhttps://ac.tuwien.ac.at/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/Fri, 01 Apr 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/Hybrid Metaheuristics – Powerful Tools for Optimizationhttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-powerful-tools-for-optimization/Decomposition Based Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/decomposition-based-hybrid-metaheuristics/PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problemhttps://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-using-very-large-neighborhood-structures-for-the-3-staged-2-dimensional-cutting-stock-problem/Balancing Bicycle Sharing Systems: An Approach for the Dynamic Casehttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problemhttps://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/Optimization Challenges of the Future Federated Internethttps://ac.tuwien.ac.at/publication/optimization-challenges-of-the-future-federated-internet/Tue, 01 Oct 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-challenges-of-the-future-federated-internet/A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approachhttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operationshttps://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problemhttps://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/grasp-and-variable-neighborhood-search-for-the-virtual-network-mapping-problem/PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systemshttps://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descenthttps://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-virtual-network-mapping-problem-with-construction-heuristics-local-search-and-variable-neighborhood-descent/On Solving Constrained Tree Problems and an Adaptive Layers Frameworkhttps://ac.tuwien.ac.at/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/The Multidimensional Knapsack Problem: Structure and Algorithmshttps://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms-2/Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windowshttps://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/multiple-variable-neighborhood-search-enriched-with-ilp-techniques-for-the-periodic-vehicle-routing-problem-with-time-windows/Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-video-server-load-re-balancing-problem-by-mixed-integer-programming-and-hybrid-variable-neighborhood-search/Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templateshttps://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-an-extended-minimum-label-spanning-tree-problem-to-compress-fingerprint-templates-2/Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzenhttps://ac.tuwien.ac.at/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpraferenzen/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpraferenzen/Hybrid Metaheuristics for Generalized Network Design Problemshttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics-for-generalized-network-design-problems/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-for-generalized-network-design-problems/Parallel Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/Wed, 01 Oct 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationenhttps://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/Mon, 01 Sep 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problemhttps://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-linear-programming-approach-and-a-hybrid-variable-neighborhood-search-for-the-car-sequencing-problem-2/Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search-2/Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/Effective Neighborhood Structures for the Generalized Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Treeshttps://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-methods-and-metaheuristic-approaches-for-deriving-high-quality-fully-resolved-consensus-trees/Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithmshttps://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-consensus-trees-by-evolutionary-variable-neighborhood-search-and-hybrid-algorithms/Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-a-prize-collecting-capacity-constrained-connected-facility-location-problem/The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/The Multidimensional Knapsack Problem: Structure and Algorithmshttps://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-multidimensional-knapsack-problem-structure-and-algorithms/Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/bringing-order-into-the-neighborhoods-relaxation-guided-variable-neighborhood-search/Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACOhttps://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/neighborhood-searches-for-the-bounded-diameter-minimum-spanning-tree-problem-embedded-in-a-vns-ea-and-aco/Variable Neighborhood Descent with Self-Adaptive Neighborhood-Orderinghttps://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/Computing Generalized Minimum Spanning Trees with Variable Neighborhood Searchhttps://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-bounded-diameter-minimum-spanning-tree-problem/