Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.13509 v1 pith:HQBN3GYC submitted 2024-05-22 math.OC

classification math.OC
keywords surrogateproblemframeworkconstraintsmodelmodelsroutingassignment
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools