Abstract
AbstractA dynamic model of a logistic node of a transportation network is presented and a performance index comprising transportation and inventory costs is considered. The optimization problem is solved considering a class of policies called full capacity. The derivation of optimal dispatching rules by integer programming or dynamic programming is usually intractable in realistic scenarios. For this reason, a neuro-dynamic programming (NDP) approach is pursued. Several simulation results are discussed, in particular for what concerns the role of transportation costs in the characterization of the optimal policies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
