A hybrid heuristic for the set covering problem

Sundar, Shyam; Singh, Alok

doi:10.1007/s12351-010-0086-y

Cited by 28 publications

(20 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is well-known that there are some heuristic algorithms for SCP and WSCP [22,23,[25][26][27][28], and their worst-case approximate ratio is not very good. The problem (IP) is more complicated since the constraints coefficient matrices of SCP and WSCP are a 0-1 matrix, but the constraint coefficient matrix of the problem (IP) is no longer a 0-1 matrix.…”

Section: Mathematical Model and Basic Propertiesmentioning

confidence: 99%

“…Since the problem studied in this paper is an extension of the set-covering problem, to demonstrate the effectiveness of the algorithm proposed in this paper, we compare its performance with that of the greedy algorithm stated in [23] and [27] on a typical extreme example of the set-covering problem (many researchers use this example to estimate the performance of the greedy algorithm) [23].…”

Section: Comparing With the Greedy Algorithm For A Set-covering Problemmentioning

confidence: 99%

“…When this example is solved by greedy algorithms, we obtain the approximate solution S = {1, 2, …, K} with the value of [23,27]. However, the hybrid heuristic algorithm can get the exact solution.…”

Section: Comparing With the Greedy Algorithm For A Set-covering Problemmentioning

confidence: 99%

See 2 more Smart Citations

Optimal Selection of Movable Shelves under Cargo-to-Person Picking Mode

Li¹,

Zhang²,

Zhang³

2017

Int. j. simul. model.

View full text Add to dashboard Cite

In recent years, some e-commerce companies such as Amazon have adopted the cargo-to-person picking mode to improve their pickup efficiency. Under this mode, a shelf can store several types of goods and a type of goods can be placed on some shelves. When orders arrive, the warehouse robots move one shelf or more containing the ordered items to a fixed platform, and the pickers select the items from the shelves. It is very important to decide which shelves should be moved to increase picking efficiency. This paper addresses the problem of optimal movable-shelf selection for the cargoto-person picking mode. The goal of this study is to minimize the total time (costs) of moving the selected shelves to finish a batch of orders. We model this problem using 0-1 linear programming and show that the problem is NP-hard. Furthermore, we propose a three-stage hybrid heuristic algorithm with polynomial complexity to solve it. We conduct numerical experiments to show the efficiency of this algorithm.

show abstract

Section: Mathematical Model and Basic Propertiesmentioning

confidence: 99%

Section: Comparing With the Greedy Algorithm For A Set-covering Problemmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Selection of Movable Shelves under Cargo-to-Person Picking Mode

Li¹,

Zhang²,

Zhang³

2017

Int. j. simul. model.

View full text Add to dashboard Cite

show abstract

“…As an NP-hard combinatorial optimization problem, the set covering problem has been extensively studied (Groiez et al, 2014). The proposed solutions can be divided into two classes: exact algorithms and heuristic algorithms (Sundar and Singh, 2012). Exact algorithms aim to find the optimal solution, while heuristic algorithms aim to find a good or near-optimal solution in a reasonable time.…”

Section: Crew Schedulingmentioning

confidence: 99%

“…Problems which are typically encountered in the real world are generally too large to be solved exactly in an acceptable computation time. For this reason, heuristic algorithms such as greedy algorithms, genetic algorithms, simulated annealing, ant colony optimization, particle swarm optimization and artificial bee colony (Sundar and Singh, 2012) have been the focus of more and more research. For all of their simplicity, greedy algorithms don't in general produce sufficiently good solutions due to their myopic nature.…”

Section: Crew Schedulingmentioning

confidence: 99%

A scheme for determining vehicle routes based on Arc-based service network design

Jiang

Bai

Atkin

et al. 2016

INFOR: Information Systems and Operational Research

View full text Add to dashboard Cite

A note on versions:The version presented here may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the repository url above for details on accessing the published version and note that access may require a subscription. Abstract-In freight transportation, less-than-truckload carriers often need to assign each vehicle a cyclic route so that drivers can come back home after a certain period of time. However, the NodeArc model for service network design addresses decisions on each arc and does not determine routes directly, although the vehicle balancing constraint ensures that the number of outgoing vehicles equals the number of incoming vehicles at each node. How to transform the optimized service network into a set of vehicle routes remains an important problem that has not yet been studied. In this paper, we propose a three-phase scheme to address this problem. In the first stage, we present an algorithm based on the depth-first search to find all of the different cyclic routes in a service network design solution. In the second stage, we propose to prune poor cyclic routes using real-life constraints so that a collection of acceptable vehicle routes can be obtained before route assignment. Some of the pruning can also be done in the first stage to speed up the proposed algorithm. In the third stage, we formulate the problem of selecting a set of cyclic routes to cover the entire network as a weighted set covering problem. The resulting model is formulated as an integer program and solved with IBM ILOG CPLEX solver. Experimental results on benchmark instances for service network design indicate the effectiveness of the proposed scheme which gives high-quality solutions in an efficient way.

show abstract

Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem

Gao

Weise

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A hybrid heuristic for the set covering problem

Cited by 28 publications

References 29 publications

Optimal Selection of Movable Shelves under Cargo-to-Person Picking Mode

Optimal Selection of Movable Shelves under Cargo-to-Person Picking Mode

A scheme for determining vehicle routes based on Arc-based service network design

Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem

Contact Info

Product

Resources

About