scholar.google.com › citations
Kazutoshi Sakakibara: Adaptive optimization by dynamic programming heuristics for logistics planning in dynamic environments. SII 2013: 472-476.
This paper presents a novel dynamic method that transforms path planning into an optimal control problem and solves it dynamically through adaptive dynamic ...
Experimental work demonstrates that the modified algorithm works on problems with multiperiod travel times, with results that are almost as good as the original ...
Missing: heuristics | Show results with:heuristics
We show experimentally that the approach provides near-optimal solutions for deterministic problems, and outperforms standard rolling-horizon methods on ...
Jul 31, 2024 · This paper proposes a dynamic scheduling method for logistics supply chain based on adaptive ant colony algorithm.
This paper describes LS/ATN, Living Systems®Adaptive Transportation Networks, an agent-based solution we have developed to solve transportation problems.
An optimization control strategy is based on adaptive dynamic programming (ADP), focusing on minimizing the cumulative delay time for a cohort of delayed ...
This paper considers a novel optimization problem for a vehicle delivery planning and proposes its effective heuristics based on dynamic programming techniques.
This research modelled the behavior of freight carriers and an Urban Consolidation Center (UCC) operator using Multi-Agent Simulation-Adaptive Dynamic ...
Missing: planning | Show results with:planning
Jun 24, 2024 · In this study, we suggest an approximate Dynamic Programming algorithm, with a look ahead strategy, that uses the fix and optimize method as the imbedded ...