9 citations · 10 across the 6 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2019
Conditional Markov Chain Search for the Generalised Travelling Salesman Problem for Warehouse Order Picking
Olegs Nalivajevs, Daniel Karapetyan
The Generalised Travelling Salesman Problem (GTSP) is a well-known problem that, among other applications, arises in warehouse order picking, where each stock is distributed betwee…
cs.AI2018
Algorithm Configuration: Learning policies for the quick termination of poor performers
Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle
One way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible, but without discarding the configurations that eventually do wel…
cs.AI2012★ 9 cited
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem
Mohammad Reihaneh, Daniel Karapetyan
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objec…