Results 31 to 40 of about 1,530,542 (289)
Ingeniería, 2015 This paper attempts to solve the School Bus Routing Problem with Time Windows that consists of finding the best set of routes to pick up students distributed geographically with constraints as capacity, time windows and maximum travel time. We formulated
Eduyn Ramiro Lopez Santana +1 more
doaj +1 more source
A Three-Stage Optimization Method for Assembly Line Balancing Problem
IEEE Access, 2020 Considering the characteristics of multimodels production pattern on assembly line, the assembly line balancing problem which is non-deterministic polynomial hard becomes more challenging to complete. In this article, we propose a reformulation of simple
Qidong Yin, Xiaochuan Luo
doaj +1 more source
Solving a robust airline crew pairing problem with column generation [PDF]
, 2013 In this study, we solve a robust version of the airline crew pairing problem. Our concept of robustness was partially shaped during our discussions with small local airlines in Turkey which may have to add a set of extra flights into their schedule at ...
Birbil, Ş. İlker +6 more
core +1 more source
A column generation approach to the airline crew pairing problem to minimize the total person-days
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 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 violate ...
Wei WU +5 more
doaj +1 more source
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
IEEE Access, 2020 The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors.
Mehdi Mrad +3 more
doaj +1 more source
Recoverable Robustness by Column Generation [PDF]
, 2011 Real-life planning problems are often complicated by the occurrence of disturbances, which imply that the original plan cannot be followed anymore and some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against common disturbances. Well-known approaches to create plans that take possible,
Bouman, P. C. +2 more
openaire +6 more sources
Raw Material Purchasing Optimization Using Column Generation
Applied SciencesThe raw material purchasing (RMP) problem is to determine the purchasing quantities of raw materials in given periods or cycles. Raw material purchasing optimization is crucial for large-scale steel plants because it is closely related to the supply of ...
Zhen Gao +3 more
doaj +1 more source
IEEE Access, 2017 This paper presents a region-based relaxed multiple kernel collaborative representation method for the spatial-spectral classification of hyperspectral images. The proposed method consists of three steps.
Jianjun Liu +3 more
doaj +1 more source
Constrained Clustering Using Column Generation [PDF]
, 2014 In recent years, it has been realized that many problems in data mining can be seen as pure optimisation problems. In this work, we investigate the problem of constraint-based clustering from an optimisation point of view. The use of constraints in clustering is a recent development and allows to encode prior beliefs about desirable clusters.
Babaki, Behrouz +2 more
openaire +3 more sources
Binary Matrix Factorisation via Column Generation
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic. Due to the hardness of this problem, most previous attempts rely on heuristic techniques.
Kovacs, RA, Gunluk, O, Hauser, R
openaire +3 more sources