Search results

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.

This study aims to investigate a locating-routing-allocating problems and the supply chain, including factories distributor candidate locations and retailers. The purpose of this paper is to minimize system costs and delivery time to retailers so that routing is done and the location of the distributors is located.

The problem gets closer to reality by adding some special conditions and constraints. Retail service start times have hard and soft time windows, and each customer has a demand for simultaneous delivery and pickups. System costs include the cost of transportation, non-compliance with the soft time window, construction of a distributor, purchase or rental of a vehicle and production costs. The conceptual model of the problem is first defined and modeled and then solved in small dimensions by general algebraic modeling system (GAMS) software and non-dominated sorting genetic algorithm II (NSGAII) and multiple objective particle swarm optimization (MOPSO) algorithms.

According to the solution of the mathematical model, the average error of the two proposed algorithms in comparison with the exact solution is less than 0.7%. Also, the algorithms’ performance in terms of deviation from the GAMS exact solution, is quite acceptable and for the largest problem (N = 100) is 0.4%. Accordingly, it is concluded that NSGAII is superior to MOSPSO.

In this study, since the model is bi-objective, the priorities of decision makers in choosing the optimal solution have not been considered and each of the objective functions has been given equal importance according to the weighting methods. Also, the model has not been compared and analyzed in deterministic and robust modes. This is because all variables, except the one that represents the uncertainty of traffic modes, are deterministic and the random nature of the demand in each graph is not considered.

The results of the proposed model are valuable for any group of decision makers who care optimizing the production pattern at any level. The use of a heterogeneous fleet of delivery vehicles and application of stochastic optimization methods in defining the time windows, show how effective the distribution networks are in reducing operating costs.

This study fills the gaps in the relationship between location and routing decisions in a practical way, considering the real constraints of a distribution network, based on a multi-objective model in a three-echelon supply chain. The model is able to optimize the uncertainty in the performance of vehicles to select the refueling strategy or different traffic situations and bring it closer to the state of certainty. Moreover, two modified algorithms of NSGA-II and multiple objective particle swarm optimization (MOPSO) are provided to solve the model while the results are compared with the exact general algebraic modeling system (GAMS) method for the small- and medium-sized problems.

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.

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.

Vehicle allocation problems (VAPs), which are frequently confronted in many transportation activities, primarily including but not limited to full truckload freight transportation operations, induce a significant economic impact. Despite the increasing academic attention to the field, literature still fails to match the needs of and opportunities in the growing industrial practices. In particular, the literature can grow upon the ideas on sustainability, Industry 4.0 and collaboration, which shape future practices not only in logistics but also in many other industries. This review has the potential to enhance and accelerate the development of relevant literature that matches the challenges confronted in industrial problems. Furthermore, this review can help to explore the existing methods, algorithms and techniques employed to address this problem, reveal directions and generate inspiration for potential improvements.

This study provides a literature review on VAPs, focusing on quantitative models that incorporate any of the following emerging logistics trends: sustainability, Industry 4.0 and logistics collaboration.

In the literature, sustainability interactions have been limited to environmental externalities (mostly reducing operational-level emissions) and economic considerations; however, emissions generated throughout the supply chain, other environmental externalities such as waste and product deterioration, or the level of stakeholder engagement, etc., are to be monitored in order to achieve overall climate-neutral services to the society. Moreover, even though there are many types of collaboration (such as co-opetition and vertical collaboration) and Industry 4.0 opportunities (such as sharing information and comanaging distribution operations) that could improve vehicle allocation operations, these topics have not yet received sufficient attention from researchers.

The scientific contribution of this study is twofold: (1) This study analyses decision models of each reviewed article in terms of decision variable, constraint and assumption sets, objectives, modeling and solving approaches, the contribution of the article and the way that any of sustainability, Industry 4.0 and collaboration aspects are incorporated into the model. (2) The authors provide a discussion on the gaps in the related literature, particularly focusing on practical opportunities and serving climate-neutrality targets, carried out under four main streams: logistics collaboration possibilities, supply chain risks, smart solutions and various other potential practices. As a result, the review provides several gaps in the literature and/or potential research ideas that can improve the literature and may provide positive industrial impacts, particularly on how logistics collaboration may be further engaged, which supply chain risks are to be incorporated into decision models, and how smart solutions can be employed to cope with uncertainty and improve the effectiveness and efficiency of operations.

The purpose of this paper is to investigate US noncombatant evacuation operations (NEO) in South Korea and devise planning and management procedures that improve the efficiency of those missions.

It formulates a time-staged network model of the South Korean noncombatant evacuation system as a mixed integer linear program to determine an optimal flow configuration that minimizes the time required to complete an evacuation. This solution considers the capacity and resource constraints of multiple transportation modes and effectively allocates the limited assets across a time-staged network to create a feasible evacuation plan. That solution is post-processed and a vehicle routing procedure then produces a high resolution schedule for each individual asset throughout the entire duration of the NEO.

This work makes a clear improvement in the decision-making and resource allocation methodology currently used in a NEO on the Korea peninsula. It immediately provides previously unidentifiable information regarding the scope and requirements of a particular evacuation scenario and then produces an executable schedule for assets to facilitate mission accomplishment.

The significance of this work is not relegated only to evacuation operations on the Korean peninsula; there are numerous other NEO and natural disaster related scenarios that can benefit from this approach.

The purpose of this paper is to investigate empirically how information and communication technologies (ICT) can contribute to reduction of CO₂ emissions in road freight transport and to identify opportunities for further improvements.

This research adopts a multiple case study approach with three leading UK grocery retailers as exemplars of fast-moving consumer goods retailers, conducted using multiple data collection techniques including interviews, system demonstrations, onsite observations and the use of archive information.

ICT solutions have a direct positive impact on CO₂ emissions reduction but opportunities to further reduce CO₂ emissions are perceived as lying beyond retailers’ own distribution networks. These opportunities are not fully utilised due to the complexities of collaborative ICT provisions and retailers’ reluctance to share information with competitors.

A limitation of the study is that it is exploratory and only three cases were examined. Even though these three retailers represent over 60 per cent of the UK grocery retail sector, other retailers may deploy significantly different ICT applications.

The research provides an overarching insight for businesses on how to leverage the existing and emerging information technologies for environmental and economic benefits.

While sustainability issues have received increasing attention recently, the role of ICT in freight transport for CO₂ emissions reduction has not been investigated in depth and its impact is largely unknown. This research advances understanding about how ICT contributes CO₂ emissions reductions and provides a framework for further investigation.

Cross-docking is a supply chain distribution and logistics strategy for which less-than-truckload shipments are consolidated into full-truckload shipments. Goods are stored up to a maximum of 24 hours in a cross-docking terminal. In this chapter, we build on the literature review by Ladier and Alpan (2016), who reviewed cross-docking research and conducted interviews with cross-docking managers to find research gaps and provide recommendations for future research. We conduct a systematic literature review, following the framework by Ladier and Alpan (2016), on cross-docking literature from 2015 up to 2020. We focus on papers that consider the intersection of research and industry, e.g., case studies or studies presenting real-world data. We investigate whether the research has changed according to the recommendations of Ladier and Alpan (2016). Additionally, we examine the adoption of Industry 4.0 practices in cross-docking research, e.g., related to features of the physical internet, the Internet of Things and cyber-physical systems in cross-docking methodologies or case studies. We conclude that only small adaptations have been done based on the recommendations of Ladier and Alpan (2016), but we see growing attention for Industry 4.0 concepts in cross-docking, especially for physical internet hubs.

The total capacity of ambulances in metropolitan cities is often less than the post-disaster demand, especially in the case of disasters such as earthquakes. However, because earthquakes are a rare occurrence in these cities, it is unreasonable to maintain the ambulance capacity at a higher level than usual. Therefore, the effective use of ambulances is critical in saving human lives during such disasters. Thus, this paper aims to provide a method for determining how to transport the maximum number of disaster victims to hospitals on time.

The transportation-related disaster management problem is complex and dynamic. The practical solution needs decomposition and a fast algorithm for determining the next mission of a vehicle. The suggested method is a synthesis of mathematical modeling, scheduling theory, heuristic methods and the Voronoi diagram of geometry. This study presents new elements for the treatment, including new mathematical theorems and algorithms. In the proposed method, each hospital is responsible for a region determined by the Voronoi diagram. The region may change if a hospital becomes full. The ambulance vehicles work for hospitals. For every patient, there is an estimated deadline by which the person must reach the hospital to survive. The second part of the concept is the way of scheduling the vehicles. The objective is to transport the maximum number of patients on time. In terms of scheduling theory, this is a problem whose objective function is to minimize the sum of the unit penalties.

The Voronoi diagram can be effectively used for decomposing the complex problem. The mathematical model of transportation to one hospital is the P‖ΣU_j problem of scheduling theory. This study provides a new mathematical theorem to describe the structure of an algorithm that provides the optimal solution. This study introduces the notion of the partial oracle. This algorithmic tool helps to elaborate heuristic methods, which provide approximations to the precise method. The realization of the partial oracle with constructive elements and elements proves the nonexistence of any solution. This paper contains case studies of three hospitals in Tehran. The results are close to the best possible results that can be achieved. However, obtaining the optimal solution requires a long CPU time, even in the nondynamic case, because the problem P‖ΣU_j is NP-complete.

This research suggests good approximation because of the complexity of the problem. Researchers are encouraged to test the proposed propositions further. In addition, the problem in the dynamic environment needs more attention.

If a large-scale earthquake can be expected in a city, the city authorities should have a central control system of ambulances. This study presents a simple and efficient method for the post-disaster transport problem and decision-making. The security of the city can be improved by purchasing ambulances and using the proposed method to boost the effectiveness of post-disaster relief.

The population will be safer and more secure if the recommended measures are realized. The measures are important for any city situated in a region where the outbreak of a major earthquake is possible at any moment.

This paper fulfills an identified need to study the operations related to the transport of seriously injured people using emergency vehicles in the post-disaster period in an efficient way.