Nearest route problem

DOI10.1006/JMAA.2000.6933MaRDI QIDQ1584634zbMATH OpenOpenAlexFDO

Authors Seiichi Iwamoto

Publication date 14 October 2001

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jmaa.2000.6933

zbMATH Keywords

dynamic programmingnearest route problem

Mathematics Subject Classification ID

Dynamic programming (90C39)

Review text

The author presents a straightforward dynamic programming approach for the following multistage optimization problem: given a target value, find a sequence of decisions such that the final outcome is as close as possible to the target value. The paper is illustrated by an example concerning paths in a layered network whose lengths should be as close as possible to a prescribed value (``nearest route problem).

Recommendations

• ON A ROUTING PROBLEM
• scientific article; zbMATH DE number 4051316
• Total distance approximations for routing solutions
• A solvable routing problem
• Solving the close-enough arc routing problem
• scientific article; zbMATH DE number 4095238
• Shortest and longest path problems
• scientific article; zbMATH DE number 4181146
• The vehicle routing problem

Cites work

• A note on two problems in connexion with graphs
• Associative dynamic programs
• Dynamic programming. Sequential scientific management
• Graphs, dynamic programming, and finite games
• scientific article; zbMATH DE number 3425974 (Why is no real title available?)
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3902605 (Why is no real title available?)
• scientific article; zbMATH DE number 3786461 (Why is no real title available?)
• scientific article; zbMATH DE number 53073 (Why is no real title available?)
• scientific article; zbMATH DE number 3345411 (Why is no real title available?)
• Quasilinearization and invariant imbedding. With applications to chemical engineering and adaptive control

Cited in

(1)

• Stochastic optimization of forward recursive functions

This page was built for publication: Nearest route problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584634)