2013
DOI: 10.1007/978-3-642-40316-3_18
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Clustering of Cabinets at FttCab

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…First the nodes were clustered in groups and then a ring is created through these groups (see [14]). In our current research we are developing a method to solve both steps together, within reasonable calculation times.…”
Section: E (Capacitated) Vehicle Routing Problem (Cvrp)mentioning
confidence: 99%
“…First the nodes were clustered in groups and then a ring is created through these groups (see [14]). In our current research we are developing a method to solve both steps together, within reasonable calculation times.…”
Section: E (Capacitated) Vehicle Routing Problem (Cvrp)mentioning
confidence: 99%
“…Our approach is presented in (in press) [15] and (unpublished) [16]. Assuming a minimum penetration of customers within 1 km and the need for rings that have all disjoint paths, we found this to be too complex to solve in one step.…”
Section: Migration Stepsmentioning
confidence: 99%