Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
DOI10.47475/2500-0101-2022-17205zbMath1503.90071OpenAlexW4285247781MaRDI QIDQ5040957
A. A. Petunin, P. A. Chentsov, A. G. Chentsov
Publication date: 18 October 2022
Published in: Челябинский физико-математический журнал (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/chfmj282
dynamic programmingtrajectoryprecedence constraintsdynamic constraintsrouteCNC sheet cutting machinefeasible optimal solutionmegalopolisestool path optimization problem
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Dynamic programming (90C39)
Related Items (1)
Uses Software
Cites Work
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Time-dependent routing problems: a review
- Approximability of the problem about a minimum-weight cycle cover of a graph
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- Routing under constraints: problem of visit to megalopolises
- The traveling salesman problem. I: Theoretical issues
- A memetic algorithm for the generalized traveling salesman problem
- Solution approaches to irregular nesting problems
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Hybrid optimization methods for time-dependent sequencing problems
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
