Yazar "Cokyasar, Taner" seçeneğine göre listele

Listeleniyor 1 - 4 / 4
  • [ X ]
    Öğe
    Additive manufacturing capacity allocation problem over a network
    (Taylor & Francis Inc, 2023) Cokyasar, Taner; Jin, Mingzhou
    The use of Additive Manufacturing (AM) for low demand volumes, such as spare parts, has recently attracted considerable attention from researchers and practitioners. This study defines the AM Capacity Allocation Problem (AMCAP) to design an AM supply network and choose between printing upon demand and sourcing through an alternative option for each part in a given set. A mixed-integer nonlinear program was developed to minimize the production, transportation, alternative sourcing, and lead time costs. We developed a cut generation algorithm to find optimal solutions in finite iterations by exploring the convexity of the nonlinear waiting time for AM products at each AM facility. Numerical experiments show the effectiveness of the proposed algorithm for the AMCAP. A case study was conducted to demonstrate that the optimal AM deployment can save almost 20% of costs over situations that do not use any AM. The case also shows that AM can realize its maximum benefits when it works in conjunction with an alternative option, e.g., inventory holding, and its capacity is strategically deployed. Since AM is a new technology and is rapidly evolving, this study includes a sensitivity analysis to see the effects of improved AM technology features, such as machine cost and build speed. When the build speed increases, the total cost decreases quickly, but the number of AM machines will increase first then decrease later when more parts are assigned to the AM option.
  • [ X ]
    Öğe
    Dynamic Ride-Matching for Large-Scale Transportation Systems
    (Sage Publications Inc, 2022) Cokyasar, Taner; de Souza, Felipe; Auld, Joshua; Verbas, Omer
    Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem's network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.
  • [ X ]
    Öğe
    Joint routing of conventional and range-extended electric vehicles in a large metropolitan network
    (Pergamon-Elsevier Science Ltd, 2022) Subramanyam, Anirudh; Cokyasar, Taner; Larson, Jeffrey; Stinson, Monique
    Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional internal combustion engines. This combination is particularly advantageous for time-constrained delivery routing in dense urban areas, where battery recharging along routes can be too time-consuming to economically justify the use of all-electric vehicles. However, switching from electric to conventional fossil fuel modes also results in higher costs and emissions and lower efficiency. This paper analyzes this heterogeneous vehicle routing problem and describes two solution methods: an exact branch-price-and-cut algorithm and an iterated tabu search metaheuristic. From a methodological perspective, we find that the exact algorithm consistently obtains tight lower bounds that also serve to certify the metaheuristic solutions as near-optimal. From a policy standpoint, we examine a large-scale real-world case study concerning parcel deliveries in the Chicago metropolitan area and quantify various operational metrics including energy costs and vehicle miles traveled. We find that by deploying roughly 20% of range -extended vehicles with a modest all-electric range of 33 miles, parcel distributors can save energy costs by up to 17% while incurring less than 0.5% increase in vehicle miles traveled. Increasing the range to 60 miles further reduces costs by only 4%, which can alternatively be achieved by decreasing the average service time by 1 minute or increasing driver working time by 1 hour. Our study reveals several key areas of improvement on which vehicle manufacturers, distributors, and policy makers can focus their attention.
  • [ X ]
    Öğe
    Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery
    (Sage Publications Inc, 2023) Cokyasar, Taner; Subramanyam, Anirudh; Larson, Jeffrey; Stinson, Monique; Sahin, Olcay
    Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities-Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI-and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.