Search results

In this paper, the authors introduced a real world new problem, the multi-trip vehicle routing problem with time windows and the possible use of a less-than-truckload carrier to satisfy customer demands. The purpose of this paper is to develop a heuristic algorithm to route the private trucks with time windows and to make a selection between truckload and less-than-truckload carriers by minimizing a total cost function.

Both mathematical model and heuristic algorithm are developed for routing the private trucks with time windows and for selecting of less-than-truckload carriers by minimizing the total cost function.

In all, 40 test problems were examined with the heuristics. Computational results show that the algorithm obtains the optimal or near-optimal solutions efficiently in terms of time and accuracy.

The research described in this paper differs from the previous one on fleet planning or vehicle routing, in that it modifies the Clarke and Wright method by shifting the performance measure from a distance to cost and also incorporates the fixed cost of different types of trucks into the model. In addition, the authors simultaneously consider the multiple trip vehicle routing problems with time windows and the selection of less-than-truckload carriers that is an integrated scenario of real-world application. To the best of the authors’ knowledge, this scenario has not been considered in the literature.

This research is designed to optimize the business process of a green tea dealer, who is a key supply chain partner of the Sri Lankan tea industry. The most appropriate trips for each vehicle in multiple trip routing systems are identified to minimize the total cost by considering the traveling distance.

The study has followed the concepts in vehicle routing problems and mixed-integer programming mathematical techniques. The model was coded with the Python programming language and was solved with the CPLEX Optimization solver version 12.10. In total, 20 data instances were used from the subjected green tea dealer for the validation of the model.

The result of the numerical experiment showed the ability to access supply over the full capacity of the available fleet. The model achieved optimal traveling distance for all the instances, with the capability of saving 17% of daily transpiration cost as an average.

This study contributes to the three index mixed-integer programing model formulation through in-depth analysis and combination of several extensions of vehicle routing problem.

This study contributes to the three index mixed-integer programming model formulation through in-depth analysis and combination of several extensions of the vehicle routing problem.

The proposed model provides a cost-effective optimal routing plan to the green tea dealer, which satisfies all the practical situations by following the multiple trip vehicle routing problems. Licensee green tea dealer is able to have an optimal fleet size, which is always less than the original fleet size. Elimination of a vehicle from the fleet has the capability of reducing the workforce. Hence, this provides managerial implication for the optimal fleet sizing and route designing.

Developing an optimization model for a tea dealer in Sri Lankan context is important, as this a complex real world case which has a significant importance in export economy of the country and which has not been analyzed or optimized through any previous research effort.

Waste production and related environmental problems have caused urban services management many problems in collecting, transporting and disposal of waste. The purpose of this study is to design a new model for municipal waste collection vehicle routing problems with time windows and energy generating from waste. To this purpose, a bi-objective model is presented with the objectives of increasing the income of waste recycles and energy generation from waste and reducing emissions from environmental pollutants.

A bi-objective model is presented with the objectives of increasing income of recycles trade and energy generation and reducing emissions from environmental pollutants. Concerning the complexity of the model and its inability to solve large-scale problems, non-dominated sorting genetic algorithms and multi-objective particle swarm optimization algorithms are applied.

In this research, an integrated approach to urban waste collection modeling that coordinates the various activities of waste management in the city of Kermanshah and energy generation from waste are provided. Besides, this study calculates the criteria that show the environmental effects of municipal waste. The proposed model helps to collect municipal wastes in the shortest possible time in addition to reducing the total cost, revenues from the sale of recycled materials and energy production.

The proposed model boosts the current understanding of the waste management and energy generation of waste. The paper adds additional value by unveiling some key future research directions. This guidance may demonstrate possible existing and unexplored gaps so that researchers can direct future research to develop new processes.

This paper aims to propose two solution approaches to determine the number of ground transport vehicles that are required to ensure the on-time delivery of military equipment between origin and destination node pairs in some geographic region, which is an important logistics problem at the US Transportation Command.

The author uses a mathematical program and a traditional heuristic to provide optimal and near-optimal solutions, respectively. The author also compares the approaches for random, small-scale problems to assess the quality and computational efficiency of the heuristic solution, and also uses the heuristic to solve a notional, large-scale problem typical of real problems.

This work helps analysts identify how many ground transport vehicles are needed to meet cargo delivery requirements in any military theater of operation.

This research assumes all problem data is deterministic, so it does not capture variations in requirements or transit times between nodes.

This work provides prescriptive details to military analysts and decision-makers in a timely manner. Prior to this work, insights for this type of problem were generated using time-consuming simulation taking about a week and often involving trial-and-error.

This research provides new methods to solve an important logistics problem. The heuristic presented in this paper was recently used to provide operational insights about ground vehicle requirements to support a geographic combatant command and to inform decisions for railcar recapitalization within the US Army.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.

The paper aims to study the challenges and solutions of city logistics in the new retail era. The new retail, which is characterized by omni-channel, fragmented orders and decentralized 2C distribution, is becoming the mainstream of the retail industry worldwide. In order to achieve a comprehensive breakthrough in new retail, the change of order fulfillment mode is the most noteworthy issue. The aim of this paper is to design a city logistics operation model for new retail and verify its feasibility and efficiency.

A physical internet (PI) enabled two-tier city logistics solution is proposed by redefining the key facilities in city logistics with the PI concept. A “Container-as-a-Warehouse” operation mode is designed to provide a more flexible store and transfer solution. A mathematical model of the proposed solution is established. An adaptive large neighborhood search (ALNS) is designed based upon an iterative procedure, which ensures consistent and optimal results.

To quantitatively assess the feasibility of the proposed solution, a computational experiment is designed to compare the performance of the proposed model against the conventional two-tier city logistics operation. The effects of geographical location pattern, utilization of PI-hub as well as the fluctuation of customer orders are analyzed. The results show that the PI-enabled city logistics is more advantageous than the conventional solution.

This study does not consider the impact of new technologies in city logistics; for example, the replenishment problem of unmanned vending machines and the charging problem of electric vehicles.

The proposed PI-enabled solution and analysis results in this paper have positive guiding significance for future practical application.

Based on the concept of PI, this paper proposes an innovative and practical operation model to solve the city logistics challenges.

This paper discusses a case of truck sharing as an application of the sharing economy. This case study examines a real mixed feed company with multiple factories. In this company’s operation, bulk trucks located in a factory had not previously been shared for delivery with other factories to their pre-assigned customers of stock farms. Therefore, this paper suggests a new delivery system that facilitates truck-sharing and analyzes its effects on the transport cost and trucks’ CO₂ emissions. To this end, this paper develops vehicle routing models to represent the current delivery practice and the new truck-shared delivery (TSD). In addition, models are developed for a carbon control policy of an emission trading scheme (ETS) and the effects of the ETS on truck-sharing are investigated. Numerical analysis is conducted to identify the effects of the TSD and the carbon control policy and draw practical implications.

The purpose of this study was to create an air movement operations planning model to rapidly generate air mission request (AMR) assignment and routing courses of action (COA) in order to minimize unsupported AMRs, aircraft utilization and routing cost.

In this paper, the US Army Aviation air movement operations planning problem is modeled as a mixed integer linear program (MILP) as an extension of the dial-a-ride problem (DARP). The paper also introduces a heuristic as an extension of a single-vehicle DARP demand insertion algorithm to generate feasible solutions in a tactically useful time period.

The MILP model generates optimal solutions for small problems (low numbers of AMRs and small helicopter fleets). The heuristic generates near-optimal feasible solutions for problems of various sizes (up to 100 AMRs and 10 helicopter team fleet size) in near real time.

Due to the inability of the MILP to produce optimal solutions for mid- and large-sized problems, this research is limited in commenting on the heuristic solution quality beyond the numerical experimentation. Additionally, the authors make several simplifying assumptions to generalize the average performance and capabilities of aircraft throughout a flight.

This research is the first to solve the US Army Aviation air movement operations planning problem via a single formulation that incorporates multiple refuel nodes, minimization of unsupported demand by priority level, demand time windows, aircraft team utilization penalties, aircraft team time windows and maximum duration and passenger ride time limits.

This article tells the story of the very successful implementation of a computer delivery planning system for daily route scheduling. The system was installed in early 1984 at a distribution centre of one of the largest supermarket groups in the UK, Argyll Stores, and helped to achieve a vehicle fleet reduction of almost 40 per cent. The article concentrates on how this success was achieved. After outlining the background, we describe the advance planning and preparation for implementation. The difficulties and setbacks which occurred after going “live” are detailed together with how they were overcome.

The purpose of this paper is to predict or even control the food safety risks during the distribution of perishable foods. Considering the food safety risks, the distribution route of perishable foods is reasonably arranged to further improve the efficiency of cold chain distribution and reduce distribution costs.

This paper uses the microbial growth model to identify a food safety risk coefficient to describe the characteristics of food safety risks that increase over time. On this basis, with the goal of minimizing distribution costs, the authors establish a vehicle routing problem with a food safety Risk coefficient and a Time Window (VRPRTW) for perishable foods. Then, the Weight-Parameter Whale Optimization Algorithm (WPWOA) which introduces inertia weight and dynamic parameter into the native whale optimization algorithm is designed for solving this model. Moreover, benchmark functions and numerical simulation are used to test the performance of the WPWOA.

Based on numerical simulation, the authors obtained the distribution path of perishable foods under the restriction of food safety risks. Moreover, the WPWOA can significantly outperform other algorithms on most of the benchmark functions, and it is faster and more robust than the native WOA and avoids premature convergence.

This study indicates that the established model and the algorithm are effective to control the risk of perishable food in distribution process. Besides, it extends the existing literature and can provide a theoretical basis and practical guidance for the vehicle routing problem of perishable foods.