pith. sign in

arxiv: 2405.13509 · v1 · pith:HQBN3GYCnew · submitted 2024-05-22 · 🧮 math.OC

Learn to formulate: A surrogate model framework for generalized assignment problem with routing constraints

classification 🧮 math.OC
keywords surrogateproblemframeworkconstraintsmodelmodelsroutingassignment
0
0 comments X
read the original abstract

The generalized assignment problem with routing constraints, e.g. the vehicle routing problem, has essential practical relevance. This paper focuses on addressing the complexities of the problem by learning a surrogate model with reduced variables and reconstructed constraints. A surrogate model framework is presented with a class of surrogate models and a learning method to acquire parameters. The paper further provides theoretical results regarding the representational power and statistical properties to explore the effectiveness of this framework. Numerical experiments based on two practical problem classes demonstrate the accuracy and efficiency of the framework. The resulting surrogate models perform comparably to or surpass the state-of-the-art heuristics on average. Our findings provide empirical evidence for the effectiveness of utilizing size-reduced and reconstructed surrogate models in producing high-quality solutions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Hierarchical Decision Making with Structured Policies: A Principled Design via Inverse Optimization

    cs.LG 2026-06 unverdicted novelty 5.0

    A hierarchical RL-OC method uses inverse optimization to derive structured lower-level policies from demonstrations, claiming superior efficiency and quality over end-to-end RL and existing hierarchical baselines on t...