Finding blocks and other patterns in a random coloring of ℤ

2005 ◽  
Vol 28 (1) ◽  
pp. 37-75 ◽  
Author(s):  
Heinrich Matzinger ◽  
Silke W.W. Rolles
Keyword(s):  
Random Coloring

Random coloring method in the combinatorial problem of Erdős and Lovász

2011 ◽  
Vol 40 (2) ◽  
pp. 227-253 ◽  
Author(s):  
Dmitry A. Shabanov
Keyword(s):  
Combinatorial Problem ◽  
Random Coloring

scholarly journals The Threshold for the Full Perfect Matching Color Profile in a Random Coloring of Random Graphs

10.37236/9066 ◽  
2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Debsoumya Chakraborti ◽  
Mihir Hasabnis
Keyword(s):  
Bipartite Graph ◽  
Random Graph ◽  
Random Graphs ◽  
Perfect Matching ◽  
Color Profile ◽  
Matching Color ◽  
Random Coloring

Consider a graph $G$ with a coloring of its edge set $E(G)$ from a set $Q = \{c_1,c_2, \ldots, c_q\}$. Let $Q_i$ be the set of all edges colored with $c_i$. Recently, Frieze defined a notion of the perfect matching color profile denoted by $\mathrm{mcp}(G)$, which is the set of vectors $(m_1, m_2, \ldots, m_q)$ such that there exists a perfect matching $M$ in $G$ with $|Q_i \cap M| = m_i$ for all $i$. Let $\alpha_1, \alpha_2, \ldots, \alpha_q$ be positive constants such that $\sum_{i=1}^q \alpha_i = 1$. Let $G$ be the random bipartite graph $G_{n,n,p}$. Suppose the edges of $G$ are independently colored with color $c_i$ with probability $\alpha_i$. We determine the threshold for the event $\mathrm{mcp}(G) = \{(m_1, \ldots, m_q) \in [0,n]^q : m_1 + \cdots + m_q = n\},$ answering a question posed by Frieze. We further extend our methods to find the threshold for the same event in a randomly colored random graph $G_{n,p}$.  

Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization

2021 ◽  
Author(s):  
Miao Yu ◽  
Viswanath Nagarajan ◽  
Siqian Shen
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Column Generation ◽  
Cutting Planes ◽  
Care Delivery ◽  
Routing Problem ◽  
Linear Programming Relaxations ◽  
Integer Solutions ◽  
Elementary Shortest Path ◽  
Random Coloring

We consider a variant of the vehicle routing problem (VRP) where each customer has a unit demand and the goal is to minimize the total cost of routing a fleet of capacitated vehicles from one or multiple depots to visit all customers. We propose two parallel algorithms to efficiently solve the column-generation-based linear-programming relaxation for this VRP. Specifically, we focus on algorithms for the “pricing problem,” which corresponds to the resource-constrained elementary shortest path problem. The first algorithm extends the pulse algorithm for which we derive a new bounding scheme on the maximum load of any route. The second algorithm is based on random coloring from parameterized complexity which can be also combined with other techniques in the literature for improving VRPs, including cutting planes and column enumeration. We conduct numerical studies using VRP benchmarks (with 50–957 nodes) and instances of a medical home care delivery problem using census data in Wayne County, Michigan. Using parallel computing, both pulse and random coloring can significantly improve column generation for solving the linear programming relaxations and we can obtain heuristic integer solutions with small optimality gaps. Combining random coloring with column enumeration, we can obtain improved integer solutions having less than 2% optimality gaps for most VRP benchmark instances and less than 1% optimality gaps for the medical home care delivery instances, both under a 30-minute computational time limit. The use of cutting planes (e.g., robust cuts) can further reduce optimality gaps on some hard instances, without much increase in the run time. Summary of Contribution: The vehicle routing problem (VRP) is a fundamental combinatorial problem, and its variants have been studied extensively in the literature of operations research and computer science. In this paper, we consider general-purpose algorithms for solving VRPs, including the column-generation approach for the linear programming relaxations of the integer programs of VRPs and the column-enumeration approach for seeking improved integer solutions. We revise the pulse algorithm and also propose a random-coloring algorithm that can be used for solving the elementary shortest path problem that formulates the pricing problem in the column-generation approach. We show that the parallel implementation of both algorithms can significantly improve the performance of column generation and the random coloring algorithm can improve the solution time and quality of the VRP integer solutions produced by the column-enumeration approach. We focus on algorithmic design for VRPs and conduct extensive computational tests to demonstrate the performance of various approaches.

Random coloring evolution on graphs

2010 ◽  
Vol 26 (2) ◽  
pp. 369-376
Author(s):  
Xin Xing Chen ◽  
Jian Gang Ying
Keyword(s):  
Random Coloring
Sign in / Sign up

Export Citation Format

Share Document