scholarly journals Constrained Clustering Using Column Generation

2014 ◽  
pp. 438-454 ◽  
Author(s):  
Behrouz Babaki ◽  
Tias Guns ◽  
Siegfried Nijssen
Keyword(s):  
Column Generation ◽  
Constrained Clustering

Application of Column Generation for Train-set Scheduling Problems with Regular Maintenance Constraints

2012 ◽  
Vol 132 (1) ◽  
pp. 151-159
Author(s):  
Akiyoshi Ohno ◽  
Tatsushi Nishi ◽  
Masahiro Inuiguchi ◽  
Satoru Takahashi ◽  
Kenji Ueda
Keyword(s):  
Column Generation ◽  
Scheduling Problems

Soft and Self Constrained Clustering for Group-Based Labeling

2021 ◽  
pp. 102097
Author(s):  
Shota Harada ◽  
Ryoma Bise ◽  
Hideaki Hayashi ◽  
Kiyohito Tanaka ◽  
Seiichi Uchida
Keyword(s):  
Constrained Clustering

scholarly journals Dynamic Shortest Paths Methods for the Time-Dependent TSP

Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 21
Author(s):  
Christoph Hansknecht ◽  
Imke Joormann ◽  
Sebastian Stiller
Keyword(s):  
Column Generation ◽  
Traveling Salesman Problem ◽  
Shortest Path ◽  
Valid Inequalities ◽  
Shortest Paths ◽  
Traveling Salesman ◽  
Time Dependent ◽  
Full Generality ◽  
Branching Rule ◽  
The Traveling Salesman Problem

The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with respect to time-dependent travel times are widely desired. This holds in particular for the traveling salesman problem, which is a corner stone of logistic planning. In this paper, we devise column-generation-based IP methods to solve the TDTSP in full generality, both for arc- and path-based formulations. The algorithmic key is a time-dependent shortest path problem, which arises from the pricing problem of the column generation and is of independent interest—namely, to find paths in a time-expanded graph that are acyclic in the underlying (non-expanded) graph. As this problem is computationally too costly, we price over the set of paths that contain no cycles of length k. In addition, we devise—tailored for the TDTSP—several families of valid inequalities, primal heuristics, a propagation method, and a branching rule. Combining these with the time-dependent shortest path pricing we provide—to our knowledge—the first elaborate method to solve the TDTSP in general and with fully general time-dependence. We also provide for results on complexity and approximability of the TDTSP. In computational experiments on randomly generated instances, we are able to solve the large majority of small instances (20 nodes) to optimality, while closing about two thirds of the remaining gap of the large instances (40 nodes) after one hour of computation.

scholarly journals A hybrid column generation approach for an industrial waste collection routing problem

2014 ◽  
Vol 71 ◽  
pp. 10-20 ◽  
Author(s):  
Kristian Hauge ◽  
Jesper Larsen ◽  
Richard Martin Lusby ◽  
Emil Krapper
Keyword(s):  
Column Generation ◽  
Industrial Waste ◽  
Waste Collection ◽  
Routing Problem

Column generation approach to operating theater planning with elective and emergency patients

2008 ◽  
Vol 40 (9) ◽  
pp. 838-852 ◽  
Author(s):  
Mehdi Lamiri ◽  
Xiaolan Xie ◽  
Shuguang Zhang
Keyword(s):  
Column Generation ◽  
Operating Theater ◽  
Emergency Patients
Sign in / Sign up

Export Citation Format

Share Document