Browsing by Subject "Combinatorial optimization"
Now showing items 1-20 of 72
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
(2015-05)
Article
Open AccessThis paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ... -
A boolean rule-based approach for manufacturability-aware cell routing
(2014-03-01)
Article
Open AccessAn approach for cell routing using gridded design rules is proposed. It is technology-independent and parameterizable for different fabrics and design rules, including support for multiple-patterning lithography. The core ... -
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem
(Elsevier, 2017-12-16)
Article
Open AccessThis paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the ... -
A heuristic approach to the design of optimal cross-docking boxes
(Institute of Electrical and Electronics Engineers (IEEE), 2021-09-03)
Article
Open AccessMultinational companies frequently work with manufacturers that receive large orders for different products (or product varieties: size, shape, color, texture, material), to serve thousands of different final destinations ... -
A hybrid algorithm combining path scanning and biased random sampling for the Arc Routing Problem
(2011)
Conference report
Open AccessThe Arc Routing Problem is a kind of NP-hard routing problems where the demand is located in some of the arcs connecting nodes and should be completely served fulfilling certain constraints. This paper presents a hybrid ... -
A hybrid multi-start metaheuristic scheduler for astronomical observations
(Elsevier, 2023-11)
Article
Open AccessIn this paper, we investigate Astronomical Observations Scheduling which is a type of Multi-Objective Combinatorial Optimization Problem, and detail its specific challenges and requirements and propose the Hybrid Accumulative ... -
A novel model for arc territory design: promoting Eulerian districts
(2015-01-01)
Article
Open AccessThe problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be ... -
A Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics
(2011-01)
Article
Open AccessThis paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical ... -
A production scheduling service for manufacturing short-run series on machining shops
(Universitat Politècnica de Catalunya, 2019-09-29)
Master thesis
Restricted access - author's decisionThe scheduling process on every production line is of principal importance as it directly affects the productivity of a company. For decades now, operational research has offered managers tools to automate their scheduling ... -
A simulation-based optimisation for the stochastic green capacitated p-median problem
(OmniaScience, 2022-12)
Article
Open AccessPurpose: This paper aims to propose a new model called the stochastic green capacitated p-median problem with a simulation-based optimisation approach. An integer linear programming mathematical model is built considering ... -
A skeleton for the Tabu search metaheuristic with applications to problems in software engineering
(2001-06)
Research report
Open AccessWe present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-known meta-heuristic that has proved successful for sub-optimally solving hard combinatorial optimization problems. Recently ... -
A Survey on graph layout problems
(2000-10)
Research report
Open AccessIn this paper we survey results on several graph layout problems from an algorithmic point of view. Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout ... -
Algorithms for combinatorial optimization with an application to feature selection
(Universitat Politècnica de Catalunya, 2024-10-21)
Bachelor thesis
Open AccessL'objectiu d'aquest projecte és desenvolupar un algorisme versàtil que resolgui problemes d'optimització combinatòria (tot i estar especialitzat en Selecció de Variables) i implementar-lo en el llenguatge Julia. El camp ... -
Ant colony optimization theory : a survey
(2005-11)
Article
Restricted access - publisher's policyResearch on a new metaheuristic for optimization is often initially focused on proof-of-concept applications. It is only after experimental work has shown the practical interest of the method that researchers try to deepen ... -
AntNetAlign: A software package for network alignment
(Elsevier, 2023-03)
Article
Open AccessIn this paper we introduce AntNetAlign, an open-source tool (written in C++) that implements an Ant Colony Optimization (ACO) for solving the Network Alignment (NA) problem, a well-known hard optimization problem with ... -
AntNetAlign: Ant colony optimization for network alignment
(2023-01)
Article
Open AccessNetwork Alignment (NA) is a hard optimization problem with important applications such as, for example, the identification of orthologous relationships between different proteins and of phylogenetic relationships between ... -
Bartering integer commodities with exogenous prices
(2013-11)
Research report
Open AccessThe analysis of markets with indivisible goods and xed exogenous prices has played an important role in economic models, especially in relation to wage rigidity and unemployment. This paper provides a novel mathematical ... -
Behavioral Issues in Portfolio Decision Analysis
(Universitat Politècnica de Catalunya / Technical University Munich, 2011)
Master thesis (pre-Bologna period)
Restricted access - author's decision
Covenantee: Technische Universität MünchenIn this paper we address the question of how people make decisions in the context of a knapsack problem, which is a simplified version of a portfolio project management problem. We expect people to be influenced by the ... -
Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems
(Sociedad Española de Estadística e Investigación Operativa, 2004-06)
Article
Open AccessCurrently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory ... -
Computational improvements of microaggregation algorithms for the anonymization of large-scale datasets
(Universitat Politècnica de Catalunya, 2017-01)
Bachelor thesis
Open AccessThe technical contents of this work fall within the field of statistical disclosure control (SDC), which concerns the postprocessing of the demographic portion of the statistical results of surveys containing sensitive ...
