Results 31 to 40 of about 149,933 (163)
A set-covering formulation for a drayage problem with single and double container loads
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
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
Efficiency comparison of exact and approximate algorithms for solving set covering problem
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
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
Approximation of the Quadratic Set Covering problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Escoffier, Bruno, Hammer, Peter
openaire +2 more sources
Bandar Lampung merupakan kota besar di Indonesia yang akan berkembang menjadi kota metropolitan. Perkembangan kota dapat dipercepat dengan pembangunan infrastruktur pelayanan publik.
Heri Wibowo +2 more
doaj +1 more source
Allocating costs in set covering problems [PDF]
This paper deals with the problem of allocating costs in set covering situations. In particular, we focus on set covering situations where the optimal covering is given in advance. Thus, we take into account only the facilities that have to be opened and look for rules distributing their cost.
Gustavo Bergantiños +4 more
openaire +3 more sources
Binary Secretary Bird Optimization Algorithm for the Set Covering Problem
The Set Coverage Problem (SCP) is an important combinatorial optimization problem known to be NP-complete. The use of metaheuristics to solve the SCP includes different algorithms.
Broderick Crawford +7 more
doaj +1 more source
Design and Optimization of Underground Logistics Transportation Networks
With the burden of city transportation system becoming bigger and bigger, it is imperative to develop reliable and efficient underground logistics. The appropriate location of cargo transshipment centers in underground logistics system is selected using ...
Mu Ren +4 more
doaj +1 more source
Binarization of Metaheuristics: Is the Transfer Function Really Important?
In this work, an approach is proposed to solve binary combinatorial problems using continuous metaheuristics. It focuses on the importance of binarization in the optimization process, as it can have a significant impact on the performance of the ...
José Lemus-Romani +4 more
doaj +1 more source

