Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
DOI10.47475/2500-0101-2022-17205zbMATH Open1503.90071OpenAlexW4285247781MaRDI QIDQ5040957FDOQ5040957
Authors: A. A. Petunin, A. G. Chentsov, P. A. Chentsov 
Publication date: 18 October 2022
Published in: Челябинский физико-математический журнал (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/chfmj282
Recommendations
- Routing under constraints: problem of visit to megalopolises
- On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
- scientific article; zbMATH DE number 3876922
- An application of optimal transport paths to urban transport networks
- Optimal routing in a transportation network
- A computationally efficient iterative solution of the multidestination optimal dynamic routing problem
- Optimal Dynamic Routing in Multidestination Networks
- Sequential search and its application to vehicle-routing problems
- Multiobjective routing problems
- Optimal schedules for problems with various routes
dynamic programmingtrajectoryprecedence constraintsdynamic constraintsrouteCNC sheet cutting machinefeasible optimal solutionmegalopolisestool path optimization problem
Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Solution approaches to irregular nesting problems
- The traveling salesman problem. I: Theoretical issues
- Title not available (Why is that?)
- Approximability of the problem about a minimum-weight cycle cover of a graph
- Robust mixed-integer linear programming models for the irregular strip packing problem
- A new generalization of the traveling salesman problem
- Time-dependent routing problems: a review
- Title not available (Why is that?)
- A memetic algorithm for the generalized traveling salesman problem
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- Routing under constraints: problem of visit to megalopolises
- 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
Cited In (7)
- On sequential traversal of sets
- About routing in the sheet cutting
- The routing problems with optimization of the starting point: dynamic programming
- Some applications of optimization routing problems with additional constraints
- Routing under constraints: problem of visit to megalopolises
- Two-stage dynamic programming in the routing problem with decomposition
- On the question of the optimization of permutations in the problem with dynamic constraints
Uses Software
This page was built for publication: Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5040957)
