1,447 research outputs found

    Models and Algorithms for Inbound and Outbound Truck to Door Scheduling

    Get PDF
    Cross-docking is a logistic strategy that facilitates rapid movement of consolidated products between suppliers and retailers within a supply chain. It is also a warehousing strategy that aims at reducing or eliminating storage and order picking, two of which are known to be major costly operations of any typical warehouse. This strategy has been used in the retailing, manufacturing, and automotive industries. In a cross-dock, goods are unloaded from incoming trucks, consolidated according to their destinations, and then, loaded into outgoing trucks with little or no storage in between. In this thesis, we address an integrated cross-dock door assignment and truck scheduling problem in which the assignment and sequencing of incoming trucks to strip doors and outgoing trucks to stack doors is optimized to minimize the total time to process all trucks. We present a mixed integer programming formulation to model this problem and some valid inequalities to strengthen the formulation. We also present two metaheuristics to obtain high quality solutions in reasonable CPU times. These algorithms use a mix of composite dispatching rules, constructive heuristics, local search heuristics which are embedded into a greedy randomized adaptive search procedure (GRASP) and an iterated local search (ILS). Results of computational experiments are presented to assess the performance of the proposed algorithms, in comparison with a general purpose solver

    On green routing and scheduling problem

    Full text link
    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

    Simple and practical optimization approach based to solve a truck load and delivery problem at long haul distances with heterogenous products

    Get PDF
    This paper proposes an optimization based approach for solving the logistic processes of deliveries scheduling and product accommodation during loading with a heterogeneous fleet of vehicles. The approach focuses on the case of products with “low density values” and high heterogeneous volume and weight, and with traveling large distances to different zones, in which transportation costs constitute a important proportion of total logistic costs. The proposed approach consists of a two-phase strategy: The first uses a “Cutting Stock Problem” formulation to define utilization areas inside trucks assigned to each product family. This task is achieved by minimizing the long-haul transportation costs as a function of the vehicle size, considering a set of predefined solutions for feasible and efficient loading obtained as a result of the accumulated experience. The second phase consists of Bin Packing Problem version with a known number of bins, which were previously determined in the first phase of the approach. In this phase, different orders from a set of customers are assigned to each truck by obeying the predefined utilization areas per product category obtained in the first phase while minimizing the number of visits of each truck. The results show that the model addresses the analyzed problem in an efficient manner, which is reflected in reasonable resolution times and costs from a practical implementation perspective. Additionally, it is observed that long-haul delivery costs and vehicle utilization tend to improve with the increase of the utilized number of patterns even when the execution time is incremented.MaestríaMagister en Ingeniería Civi

    Two-Echelon Vehicle and UAV Routing for Post-Disaster Humanitarian Operations with Uncertain Demand

    Full text link
    Humanitarian logistics service providers have two major responsibilities immediately after a disaster: locating trapped people and routing aid to them. These difficult operations are further hindered by failures in the transportation and telecommunications networks, which are often rendered unusable by the disaster at hand. In this work, we propose two-echelon vehicle routing frameworks for performing these operations using aerial uncrewed autonomous vehicles (UAVs or drones) to address the issues associated with these failures. In our proposed frameworks, we assume that ground vehicles cannot reach the trapped population directly, but they can only transport drones from a depot to some intermediate locations. The drones launched from these locations serve to both identify demands for medical and other aids (e.g., epi-pens, medical supplies, dry food, water) and make deliveries to satisfy them. Specifically, we present two decision frameworks, in which the resulting optimization problem is formulated as a two-echelon vehicle routing problem. The first framework addresses the problem in two stages: providing telecommunications capabilities in the first stage and satisfying the resulting demands in the second. To that end, two types of drones are considered. Hotspot drones have the capability of providing cell phone and internet reception, and hence are used to capture demands. Delivery drones are subsequently employed to satisfy the observed demand. The second framework, on the other hand, addresses the problem as a stochastic emergency aid delivery problem, which uses a two-stage robust optimization model to handle demand uncertainty. To solve the resulting models, we propose efficient and novel solution approaches

    Production scheduling and mine fleet assignment using integer programming

    Get PDF
    Production Scheduling, extraction sequence of mining blocks in different production periods to maximize profit over the life of the mine and subjected to different constraints, is an important aspect of any mining activity. Mine production scheduling problem can be solved using various approaches, but the best approach is one which can give an optimal result. Production scheduling solely cannot result in a proper planning thus, fleet assignment problem needs to be incorporated into production scheduling problem to have a realistic mine plan. Proper fleet assignment ensures that the fleet is not under or over utilized. Fleet assignment problem is integer type programming since, size of fleet cannot be a floating number. In this thesis, production scheduling and fleet assignment problem are solved using branch and cut algorithm. Production schedule for 4736 blocks from a case study of coal mine is done with a production period of 5 years. Solution time for solving the production scheduling problem was 48.14 hours with an NPV value of Rs 4.45938x1011. Short terms production scheduling is done for one year and the NPV value obtained was Rs 7.59796x1010 with a solution time of 57.539 minutes. Fleet assignment is done for first year and is observed that the size of dumper fleet can be reduced to 30 thus saving huge amount of initial capital investment

    Optimal Planning of Container Terminal Operations

    No full text
    Due to globalization and international trade, moving goods using a mixture of transportation modes has become a norm; today, large vessels transport 95% of the international cargos. In the first part of this thesis, the emphasis is on the sea-land intermodal transport. The availability of different modes of transportation (rail/road/direct) in sea-land intermodal transport and container flows (import, export, transhipment) through the terminal are considered simultaneously within a given planning time horizon. We have also formulated this problem as an Integer Programming (IP) model and the objective is to minimise storage cost, loading and transportation cost from/to the customers. To further understand the computational complexity and performance of the model, we have randomly generated a large number of test instances for extensive experimentation of the algorithm. Since, CPLEX was unable to find the optimal solution for the large test problems; a heuristic algorithm has been devised based on the original IP model to find near „optimal‟ solutions with a relative error of less than 4%. Furthermore, we developed and implemented Lagrangian Relaxation (LR) of the IP formulation of the original problem. The bounds derived from LR were improved using sub-gradient optimisation and computational results are presented. In the second part of the thesis, we consider the combined problems of container assignment and yard crane (YC) deployment within the container terminal. A new IP formulation has been developed using a unified approach with the view to determining optimal container flows and YC requirements within a given planning time horizon. We designed a Branch and Cut (B&C) algorithm to solve the problem to optimality which was computationally evaluated. A novel heuristic approach based on the IP formulation was developed and implemented in C++. Detailed computational results are reported for both the exact and heuristic algorithms using a large number of randomly generated test problems. A practical application of the proposed model in the context of a real case-study is also presented. Finally, a simulation model of container terminal operations based on discrete-event simulation has been developed and implemented with the view of validating the above optimisation model and using it as a test bed for evaluating different operational scenarios

    Hybrid Vehicle-drone Routing Problem For Pick-up And Delivery Services Mathematical Formulation And Solution Methodology

    Get PDF
    The fast growth of online retail and associated increasing demand for same-day delivery have pushed online retail and delivery companies to develop new paradigms to provide faster, cheaper, and greener delivery services. Considering drones’ recent technological advancements over the past decade, they are increasingly ready to replace conventional truck-based delivery services, especially for the last mile of the trip. Drones have significantly improved in terms of their travel ranges, load-carrying capacity, positioning accuracy, durability, and battery charging rates. Substituting delivery vehicles with drones could result in $50M of annual cost savings for major U.S. service providers. The first objective of this research is to develop a mathematical formulation and efficient solution methodology for the hybrid vehicle-drone routing problem (HVDRP) for pick-up and delivery services. The problem is formulated as a mixed-integer program, which minimizes the vehicle and drone routing cost to serve all customers. The formulation captures the vehicle-drone routing interactions during the drone dispatching and collection processes and accounts for drone operation constraints related to flight range and load carrying capacity limitations. A novel solution methodology is developed which extends the classic Clarke and Wright algorithm to solve the HVDRP. The performance of the developed heuristic is benchmarked against two other heuristics, namely, the vehicle-driven routing heuristic and the drone-driven routing heuristic. Anticipating the potential risk of using drones for delivery services, aviation authorities in the U.S. and abroad have mandated necessary regulatory rules to ensure safe operations. The U.S. Federal Aviation Administration (FAA) is examining the feasibility of drone flights in restricted airspace for product delivery, requiring drones to fly at or below 400-feet and to stay within the pilot’s line of sight (LS). Therefore, a second objective of this research is considered to develop a modeling framework for the integrated vehicle-drone routing problem for pick-up and delivery services considering the regulatory rule requiring all drone flights to stay within the pilot’s line of sight (LS). A mixed integer program (MIP) and an efficient solution methodology were developed for the problem. The solution determines the optimal vehicle and drone routes to serve all customers without violating the LS rule such that the total routing cost of the integrated system is minimized. Two different heuristics are developed to solve the problem, which extends the Clarke and Wright Algorithm to cover the multimodality aspects of the problem and to satisfy the LS rule. The first heuristic implements a comprehensive multimodal cost saving search to construct the most efficient integrated vehicle-drone routes. The second heuristic is a light version of the first heuristic as it adopts a vehicle-driven cost saving search. Several experiments are conducted to examine the performance of the developed methodologies using hypothetical grid networks of different sizes. The capability of the developed model in answering a wide variety of questions related to the planning of the vehicle-drone delivery system is illustrated. In addition, a case study is presented in which the developed methodology is applied to provide pick-up and delivery services in the downtown area of the City of Dallas. The results show that mandating the LS rule could double the overall system operation cost especially in dense urban areas with LS obstructions

    Modelling of integrated vehicle scheduling and container storage problems in unloading process at an automated container terminal

    Get PDF
    Effectively scheduling vehicles and allocating storage locations for containers are two important problems in container terminal operations. Early research efforts, however, are devoted to study them separately. This paper investigates the integration of the two problems focusing on the unloading process in an automated container terminal, where all or part of the equipment are built in automation. We formulate the integrated problem as a mixed-integer programming (MIP) model to minimise ship’s berth time. We determine the detailed schedules for all vehicles to be used during the unloading process and the storage location to be assigned for all containers. A series of experiments are carried out for small-sized problems by using commercial software. A genetic algorithm (GA) is designed for solving large-sized problems. The solutions from the GA for the small-sized problems are compared with the optimal solutions obtained from the commercial software to verify the effectiveness of the GA. The computational results show that the model and solution methods proposed in this paper are efficient in solving the integrated unloading problem for the automated container terminal
    corecore