20 research outputs found

    A Multiobjectivization Approach for Vehicle Routing Problems

    Get PDF

    An Incremental Approach for Storage and Delivery Planning Problems

    Get PDF
    We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation

    An Incremental approach for storage and delivery planning problems optimization in supply chain management /

    No full text
    Tyt. z nagłówka.Bibliogr. s. 22–23.We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation.Dostępny również w formie drukowanej.KEYWORDS: simultaneous optimization, logistic terminal, consolidate shipment, mixed integer programming, relax-and-fix

    A new numerical scheme for constrained total variation flows and its convergence

    Get PDF
    In this paper, we propose a new numerical scheme for a spatially discrete model of constrained total variation flows, which are total variation flows whose values are constrained in a Riemannian manifold. The difficulty of this problem is that the underlying function space is not convex and it is hard to calculate the minimizer of the functional with the manifold constraint. We overcome this difficulty by “localization technique" using the exponential map and prove the finite-time error estimate in general situation. Finally, we show a few numerical results for the cases that the target manifolds are S2 and SO(3)

    Multi-agent Simulation Model of Urban Traffic Using Mathematical Optimization

    No full text

    Optimization in Supply Chain Management An Incremental Approach for Storage and Delivery Planning Problems

    No full text
    Abstract. We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation

    地方自治体における低炭素型エネルギーシステム計画モデルの開発

    No full text
    corecore