Search results

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.

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.

The purpose of this paper is to focus on the reference model of a grid-like supply network that enables formulation of delivery routing and scheduling problems in the context of the periodic vehicle routing problem.

The conditions for seamless (collision-free) synchronization of periodically executed local transport processes presented in this paper guarantee cyclic execution of supply processes, thereby preventing traffic flow congestion.

Systems that satisfy this characteristic, cyclic deliveries executed along supply chains are given and what is sought is the number of vehicles needed to operate the local transport processes in order to ensure delivery from and to specific loading/unloading points on given dates. Determination of sufficient conditions guaranteeing the existence of feasible solutions that satisfy these constraints makes it possible to solve the considered class of problems online.

The computer experiments reported in this paper show the possibilities of practical application of the proposed approach in the construction of decision support systems for food supply chain management.

The aim of the present work is to develop a methodology for the synthesis of regularly structured supply networks that would ensure fixed cyclic execution of local transport processes. The proposed methodology, which implements sufficient conditions for the synchronization of local cyclic processes, allows one to develop a method for rapid prototyping of supply processes that satisfies the time windows constraints given.

This paper proposes an approach to solve the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) in the context of the Physical Internet (PI) supply chain. The main objective is to minimize the total distribution costs (transportation cost and holding cost) to supply retailers from PI hubs.

Mixed integer programming (MIP) is proposed to solve the problem in smaller instances. A random local search (RLS) algorithm and a simulated annealing (SA) metaheuristic are proposed to solve larger instances of the problem.

The results show that SA provides the best solution in terms of total distribution cost and provides a good result regarding holding cost and transportation cost compared to other heuristic methods. Moreover, in terms of total carbon emissions, the PI concept proposed a better solution than the classical supply chain.

The sustainability of the route construction applied to the PI is validated through carbon emissions.

This approach also relates to the main objectives of transportation in the PI context: reduce empty trips and share transportation resources between PI-hubs and retailers. The proposed approaches are then validated through a case study of agricultural products in Thailand.

This approach is also relevant with the reduction of driving hours on the road because of share transportation results and shorter distance than the classical route planning.

This paper addresses the VRPSPD problem in the PI context, which is based on sharing transportation and storage resources while considering sustainability.

The purpose of this paper is to introduce a three-echelon multimodal transportation problem applied to a humanitarian logistic case study that occurred in Mexico.

This study develops a methodology combining a transshipment problem and an adaptation of the multidepot heterogeneous fleet vehicle routing problem to construct a mathematical model that incorporates the use of land-based vehicles and drones. The model was applied to the case study of the Earthquake on September 19, 2017, in Mexico, using the Gurobi optimization solver.

The results ratified the relevance of the study, showing an inverse relationship between transportation costs and delivery time; on the flip side, the model performed in a shorter CPU time with medium and small instances than with large instances.

While the size of the instances limits the use of the model for big-scale problems, this approach manages to provide a good representation of a transportation network during a natural disaster using drones in the last-mile deliveries.

The present study contributes to a model that combines a vehicle routing problem with transshipment, multiple depots and a heterogeneous fleet including land-based vehicles and drones. There are multiple models present in the literature for these types of problems that incorporate the use of these transportation modes; however, to the best of the authors’ knowledge, there are still no proposals similar to this study.

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.

In difficult geographical zones (mountain, intra-cities areas, etc.), many shippers, from small and medium enterprises to individuals, may demand delivery of different food products (fresh, refrigerated, frozen, etc.) in small quantities. On the other side, carrier companies wish to use their vehicles optimally. Taking into account the perishability constraints (short-shelflife, temperature limits, etc.) of the transported food products and environmental constraints (pollution, carbon impact) while consolidating multiple kinds of food products to use vehicles optimally is not achieved by current transportation planning solutions. The purpose of this paper is to present an interoperable solution of a marketplace, formed by shippers and carriers, dedicated to the schedule of food transport orders.

This transportation planning system named Interoperable-Pathfinder, Order, Vehicle, Environment and Supervisor (I-POVES) is an interoperable multi-agent system, based on the SCEP (supervisor, customer, environment and producer) model (Archimede and Coudert, 2001). Ontologies are developed to create the planning marketplace comprising demands and offers from different sources (multiple shippers and carriers).

A hierarchy ontology for food products. A transporter system ontology. A global ontology that contains all shared concepts used by local ontologies of both shippers and carriers. I-POVES an interoperable model, which facilitates collaboration between carriers and their shippers through its active agents.

I-POVES is tested on a case study from the TECCAS Poctefa project, comprising transport and food companies from both sides of the Pyrenees (France and Spain).

There has been much work in the literature on the delivery of products, but very few on the delivery of food products. Work related to delivery of food products focuses mostly on timely delivery for avoiding its wastage. In this paper, constraints related to food products and to environment (pollution and carbon impact) of transport resources are taken into account while planning the delivery.

The purpose of this paper is to develop an original model and a solution procedure for solving jointly three main strategic fleet management problems (fleet composition, replacement and make-or-buy), taking into account interdependencies between them.

The three main strategic fleet management problems were analyzed in detail to identify interdependencies between them, mathematically modeled in terms of integer nonlinear programing (INLP) and solved using evolutionary based method of a solver compatible with a spreadsheet.

There are no optimization methods combining the analyzed problems, but it is possible to mathematically model them jointly and solve together using a solver compatible with a spreadsheet obtaining a solution/fleet management strategy answering the questions: Keep currently exploited vehicles in a fleet or remove them? If keep, how often to replace them? If remove then when? How many perspective/new vehicles, of what types, brand new or used ones and when should be put into a fleet? The relatively large scale instance of problem (50 vehicles) was solved based on a real-life data. The obtained results occurred to be better/cheaper by 10% than the two reference solutions – random and do-nothing ones.

The methodology of developing optimal fleet management strategy by solving jointly three main strategic fleet management problems is proposed allowing for the reduction of the fleet exploitation costs by adjusting fleet size, types of exploited vehicles and their exploitation periods.

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.

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.