An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +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
Approximation of the Clustered Set Covering Problem [PDF]
Electronic Notes in Discrete Mathematics, 2010 Abstract We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning.
Laurent Alfandari, Jérôme Monnot
openaire +1 more source
A fast approximation algorithm for solving the complete set packing problem
, 2014 We study the complete set packing problem (CSPP) where the family of feasible subsets may include all possible combinations of objects. This setting arises in applications such as combinatorial auctions (for selecting optimal bids) and cooperative game ...
Nguyen, Tri-Dung
core +1 more source
A set-covering formulation for a drayage problem with single and double container loads
Journal of Industrial Engineering International, 2018 This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port.
A. Ghezelsoflu +3 more
doaj +1 more source
Greedy Genetic Algorithm for the Data Aggregator Positioning Problem in Smart Grids
Inteligencia Artificial, 2021 In this work, we present a metaheuristic based on the genetic and greedy algorithms to solve an application of the set covering problem (SCP), the data aggregator positioning in smart grids.
Sami Nasser Lauar, Mario Mestria
doaj +1 more source
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
, 2007 The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +5 more
core +1 more source
Efficiency comparison of exact and approximate algorithms for solving set covering problem
Advanced Engineering Research, 2017 Introduction. A quite general class of practical tasks is guided by the set covering problem: schedules building, layout of service stations, and creation of electronic circuits.
Igor S. Konovalov +2 more
doaj +1 more source
Application of Set Covering Location Problem for Organizing the Public Postal Network
Promet (Zagreb), 2016 Most countries of the European Union ensure certain obligations (criteria) which universal service providers must meet to ensure the realization of the universal service.
Dragana Šarac +4 more
doaj +1 more source
The continuous p-centre problem: An investigation into variable neighbourhood search with memory [PDF]
, 2014 A VNS-based heuristic using both a facility as well as a customer type neighbourhood structure is proposed to solve the p-centre problem in the continuous space.
Nagy, Gábor +2 more
core +1 more source