4 papers
Assignment-Routing Optimization: Solvers for Problems Under Constraints
Yuan Qilong, Michal Pavelka
We study the Joint Routing-Assignment (JRA) problem in which items must be assigned one-to-one to placeholders while simultaneously determining a Hamiltonian cycle visiting all nod…
An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-α Optimization
Qilong Yuan
The Joint Routing-Assignment (JRA) optimization problem simultaneously determines the assignment of items to placeholders and a Hamiltonian cycle that visits each node pair exactly…
Assignment-Routing Optimization : Efficient Heuristic Solver with Shaking Algorithm
Yuan Qilong, Michal Pavelka
This paper works on heuristic solver for joint assignment and routing optimization problem. Study on previous works shows that MIP based exact solvers can only provide efficient so…
Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
Qilong Yuan
We study a joint routing-assignment optimization problem in which a set of items must be paired one-to-one with a set of placeholders while simultaneously determining a Hamiltonian…