Search results
1 – 10 of 193George Ninikas, Theodore Athanasopoulos, Vasileios Zeimpekis and Ioannis Minis
The purpose of this paper is to present the design and evaluation of an integrated system that supports planners and dispatchers to deliver enhanced courier operations. In…
Abstract
Purpose
The purpose of this paper is to present the design and evaluation of an integrated system that supports planners and dispatchers to deliver enhanced courier operations. In addition to regular deliveries and pickups, these operations include: first, mass deliveries to be served over a horizon of multiple days; and second, real-time dynamic requests (DRs) to be served within the same service period.
Design/methodology/approach
To address the aforementioned challenges, the authors developed an architecture that enhances a typical fleet management system by integrating purpose designed methods. Specifically, the authors plan mass deliveries taking into account typical routes of everyday operations. For planning DRs in real time, the authors propose an efficient insertion heuristic.
Findings
The results from testing the proposed optimization algorithms for planning mass deliveries and real-time DRs are encouraging, since the proposed algorithms outperform current practices. Testing in a practical courier environment, indicated that the enhanced planning system may improve significantly operational performance.
Research limitations/implications
The proposed optimization algorithm for the dynamic aspect of this problem comprises a heuristic approach that reaches suboptimal solutions of high quality. The development of fast optimal algorithms for solving these very interesting and practical problems is a promising area for further research.
Practical implications
The proposed integrated system addresses significant problems of hybrid courier operations in an integrated, balanced manner. The tests showed that the allocation of flexible orders within a three-day time horizon improved the cost per flexible order by 7.4 percent, while computerized routing improved the cost of initial (static) routing by 14 percent. Furthermore, the proposed method for managing DRs reduced the excess cost per served request by over 40 percent. Overall, the proposed integrated system improved the total routing costs by 16.5 percent on average compared to current practices.
Originality/value
Both the planning problems and the related solution heuristics address original aspects of practical courier operations. Furthermore, the system integration and the proposed systematic planning contribute to the originality of the work.
Details
Keywords
Mahdieh Masoumi, Amir Aghsami, Mohammad Alipour-Vaezi, Fariborz Jolai and Behdad Esmailifar
Due to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the…
Abstract
Purpose
Due to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the needs of the people. After the disaster, one of the most essential measures is to deliver relief supplies to those affected by the disaster. Therefore, this paper aims to assign demand points to the warehouses as well as routing their related relief vehicles after a disaster considering convergence in the border warehouses.
Design/methodology/approach
This research proposes a multi-objective, multi-commodity and multi-period queueing-inventory-routing problem in which a queuing system has been applied to reduce the congestion in the borders of the affected zones. To show the validity of the proposed model, a small-size problem has been solved using exact methods. Moreover, to deal with the complexity of the problem, a metaheuristic algorithm has been utilized to solve the large dimensions of the problem. Finally, various sensitivity analyses have been performed to determine the effects of different parameters on the optimal response.
Findings
According to the results, the proposed model can optimize the objective functions simultaneously, in which decision-makers can determine their priority according to the condition by using the sensitivity analysis results.
Originality/value
The focus of the research is on delivering relief items to the affected people on time and at the lowest cost, in addition to preventing long queues at the entrances to the affected areas.
Details
Keywords
Mohammad Mahdi Ershadi and Hossein Shams Shemirani
Proper planning for the response phase of humanitarian relief can significantly prevent many financial and human losses. To this aim, a multi-objective optimization model is…
Abstract
Purpose
Proper planning for the response phase of humanitarian relief can significantly prevent many financial and human losses. To this aim, a multi-objective optimization model is proposed in this paper that considers different types of injured people, different vehicles with determining capacities and multi-period logistic planning. This model can be updated based on new information about resources and newly identified injured people.
Design/methodology/approach
The main objective function of the proposed model in this paper is minimizing the unsatisfied prioritized injured people in the network. Besides, the total transportation activities of different types of vehicles are considered as another objective function. Therefore, these objectives are optimized hierarchically in the proposed model using the Lexicographic method. This method finds the best value for the first objective function. Then, it tries to optimize transportation activities as the second objective function while maintaining the optimality of the first objective function.
Findings
The performances of the proposed model were analyzed in different cases and its robust approach for different problems was shown within the framework of a case study. Besides, the sensitivity analysis of results shows the logical behavior of the proposed model against various factors.
Practical implications
The proposed methodology can be applied to find the best response plan for all crises.
Originality/value
In this paper, we have tried to use a multi-objective optimization model to guide and correct response programs to deal with the occurred crisis. This is important because it can help emergency managers to improve their plans.
Details
Keywords
Zeynep Aydınalp and Doğan Özgen
Drugs are strategic products with essential functions in human health. An optimum design of the pharmaceutical supply chain is critical to avoid economic damage and adverse…
Abstract
Purpose
Drugs are strategic products with essential functions in human health. An optimum design of the pharmaceutical supply chain is critical to avoid economic damage and adverse effects on human health. The vehicle-routing problem, focused on finding the lowest-cost routes with available vehicles and constraints, such as time constraints and road length, is an important aspect of this. In this paper, the vehicle routing problem (VRP) for a pharmaceutical company in Turkey is discussed.
Design/methodology/approach
A mixed-integer programming (MIP) model based on the vehicle routing problem with time windows (VRPTW) is presented, aiming to minimize the total route cost with certain constraints. As the model provides an optimum solution for small problem sizes with the GUROBI® solver, for large problem sizes, metaheuristic methods that simulate annealing and adaptive large neighborhood search algorithms are proposed. A real dataset was used to analyze the effectiveness of the metaheuristic algorithms. The proposed simulated annealing (SA) and adaptive large neighborhood search (ALNS) were evaluated and compared against GUROBI® and each other through a set of real problem instances.
Findings
The model is solved optimally for a small-sized dataset with exact algorithms; for solving a larger dataset, however, metaheuristic algorithms require significantly lesser time. For the problem addressed in this study, while the metaheuristic algorithms obtained the optimum solution in less than one minute, the solution in the GUROBI® solver was limited to one hour and three hours, and no solution could be obtained in this time interval.
Originality/value
The VRPTW problem presented in this paper is a real-life problem. The vehicle fleet owned by the factory cannot be transported between certain suppliers, which complicates the solution of the problem.
Details
Keywords
Yandong He, Xu Wang, Fuli Zhou and Yun Lin
This paper aims to study the vehicle routing problem with dynamic customers considering dual service (including home delivery [HD] and customer pickup [CP]) in the last mile…
Abstract
Purpose
This paper aims to study the vehicle routing problem with dynamic customers considering dual service (including home delivery [HD] and customer pickup [CP]) in the last mile delivery in which three decisions have to be made: determine routes that lie along the HD points and CP facilities; optimize routes in real time, which mode is better between simultaneous dual service (SDS, HD points and CP facilities are served simultaneously by the same vehicle); and respective dual service (RDS, HD points and CP facilities are served by different vehicles)?
Design/methodology/approach
This paper establishes a mixed integer linear programing model for the dynamic vehicle routing problem considering simultaneous dual services (DVRP-SDS). To increase the practical usefulness and solve large instances, the authors designed a two-phase matheuristic including construction-improvement heuristics to solve the deterministic model and dynamic programing to adjust routes to dynamic customers.
Findings
The computational experiments show that the CP facilities offer greater flexibility for adjusting routes to dynamic customers and that the SDS delivery system outperforms the RDS delivery system in terms of cost and number of vehicles used.
Practical implications
The results provide managerial insights for express enterprises from the perspective of operation research to make decisions.
Originality/value
This paper is among the first papers to study the DVRP-SDS. Moreover, this paper guides the managers to select better delivery mode in the last mile delivery.
Details
Keywords
S.M.T. Fatemi Ghomi and B. Asgarian
Finding a rational approach to maintain a freshness of foods and perishable goods and saving their intrinsic attributes during a distribution of these products is one of the main…
Abstract
Purpose
Finding a rational approach to maintain a freshness of foods and perishable goods and saving their intrinsic attributes during a distribution of these products is one of the main issues for distribution and logistics companies. This paper aims to provide a framework for distribution of perishable goods which can be applied for real life situations.
Design/methodology/approach
This paper proposes a novel mathematical model for transportation inventory location routing problem. In addition, the paper addresses the impact of perishable goods age on the demand of final customers. The model is optimally solved for small- and medium-scale problems. Moreover, regarding to NP-hard nature of the proposed model, two simple and one hybrid metaheuristic algorithms are developed to cope with the complexity of problem in large scale problems.
Findings
Numerical examples with different scenarios and sensitivity analysis are conducted to investigate the performance of proposed algorithms and impacts of important parameters on optimal solutions. The results show the acceptable performance of proposed algorithms.
Originality/value
The authors formulate a novel mathematical model which can be applicable in perishable goods distribution systems In this regard, the authors consider lost sale which is proportional to age of products. A new hybrid approach is applied to tackle the problem and the results show the rational performance of the algorithm.
Details
Keywords
Ömer Utku Kahraman and Erdal Aydemir
The purpose of this paper is to manage the demand uncertainty considered as lower and upper levels for a medium-scale industrial distribution planning problem in a biobjective…
Abstract
Purpose
The purpose of this paper is to manage the demand uncertainty considered as lower and upper levels for a medium-scale industrial distribution planning problem in a biobjective inventory routing problem (IRP). In order to achieve this, the grey system theory is applied since no statistical distribution from the past data and incomplete information.
Design/methodology/approach
This study is investigated with optimizing the distribution plan, which involves 30 customers of 12 periods in a manufacturing company under demand uncertainty that is considered as lower and upper levels for a biobjective IRP with using grey demand parameters as a grey integer programming model. In the data set, there are also some missing demand values for the customers. So, the seven different grey models are developed to eliminat the effects on demand uncertainties in computational analysis using a piece of developed software considering the logistical performance indicators such as total deliveries, total cost, the total number of tours, distribution capacity, average remaining capacity and solution time.
Findings
Results show that comparing the grey models, the cost per unit and the maximum number of vehicle parameters are also calculated as the new key performance indicator, and then results were ranked and evaluated in detail. Another important finding is the demand uncertainties can be managed with a new approach via logistics performance indicators using alternative solutions.
Practical implications
The results enable logistics managers to understand the importance of demand uncertainties if more reliable decisions are wanted to make with obtaining a proper distribution plan for effective use of their expectations about the success factors in logistics management.
Originality/value
The study is the first in terms of the application of grey models in a biobjective IRP with using interval grey demand data. Successful implementation of the grey approaches allows obtaining a more reliable distribution plan. In addition, this paper also offers a new key performance indicator for the final decision.
Details
Keywords
This paper aims to investigate the scheduling and loading problems of tow trains for mixed-model assembly lines (MMALs). An in-plant milk-run delivery model has been formulated to…
Abstract
Purpose
This paper aims to investigate the scheduling and loading problems of tow trains for mixed-model assembly lines (MMALs). An in-plant milk-run delivery model has been formulated to minimize total line-side inventory for all stations over the planning horizon by specifying the departure time, parts quantity of each delivery and the destination station.
Design/methodology/approach
An immune clonal selection algorithm (ICSA) combined with neighborhood search (NS) and simulated annealing (SA) operators, which is called the NSICSA algorithm, is developed, possessing the global search ability of ICSA, the ability of SA for escaping local optimum and the deep search ability of NS to get better solutions.
Findings
The modifications have overcome the deficiency of insufficient local search and deepened the search depth of the original metaheuristic. Meanwhile, good approximate solutions are obtained in small-, medium- and large-scale instances. Furthermore, inventory peaks are in control according to computational results, proving the effectiveness of the mathematical model.
Research limitations/implications
This study works out only if there is no breakdown of tow trains. The current work contributes to the in-plant milk-run delivery scheduling for MMALs, and it can be modified to deal with similar part feeding problems.
Originality/value
The capacity limit of line-side inventory for workstations as well as no stock-outs rules are taken into account, and the scheduling and loading problems are solved satisfactorily for the part distribution of MMALs.
Details
Keywords
In a kitting supply system, the occurrence of material-handling errors is unavoidable and will cause serious production losses to an assembly line. To minimize production losses…
Abstract
Purpose
In a kitting supply system, the occurrence of material-handling errors is unavoidable and will cause serious production losses to an assembly line. To minimize production losses, this paper aims to present a dynamic scheduling problem of automotive assembly line considering material-handling mistakes by integrating abnormal disturbance into the material distribution problem of mixed-model assembly lines (MMALs).
Design/methodology/approach
A multi-phase dynamic scheduling (MPDS) algorithm is proposed based on the characteristics and properties of the dynamic scheduling problem. In the first phase, the static material distribution scheduling problem is decomposed into three optimization sub-problems, and the dynamic programming algorithm is used to jointly optimize the sub-problems to obtain the optimal initial scheduling plan. In the second phase, a two-stage rescheduling algorithm incorporating removing rules and adding rules was designed according to the status update mechanism of material demand and multi-load AGVs.
Findings
Through comparative experiments with the periodic distribution strategy (PD) and the direct insertion method (DI), the superiority of the proposed dynamic scheduling strategy and algorithm is verified.
Originality/value
To the best of the authors’ knowledge, this study is the first to consider the impact of material-handling errors on the material distribution scheduling problem when using a kitting strategy. By designing an MPDS algorithm, this paper aims to maximize the absorption of the disturbance caused by material-handling errors and reduce the production losses of the assembly line as well as the total cost of the material transportation.
Details
Keywords
Juliana Emidio, Rafael Lima, Camila Leal and Grasiele Madrona
The dairy industry needs to make important decisions regarding its supply chain. In a context with many available suppliers, deciding which of them will be part of the supply…
Abstract
Purpose
The dairy industry needs to make important decisions regarding its supply chain. In a context with many available suppliers, deciding which of them will be part of the supply chain and deciding when to buy raw milk is key to the supply chain performance. This study aims to propose a mathematical model to support milk supply decisions. In addition to determining which producers should be chosen as suppliers, the model decides on a milk pickup schedule over a planning horizon. The model addresses production decisions, inventory, setup and the use of by-products generated in the raw milk processing.
Design/methodology/approach
The model was formulated using mixed integer linear programming, tested with randomly generated instances of various sizes and solved using the Gurobi Solver. Instances were generated using parameters obtained from a company that manufactures dairy products to test the model in a more realistic scenario.
Findings
The results show that the proposed model can be solved with real-world sized instances in short computational times and yielding high quality results. Hence, companies can adopt this model to reduce transportation, production and inventory costs by supporting decision making throughout their supply chains.
Originality/value
The novelty of the proposed model stems from the ability to integrate milk pickup and production planning of dairy products, thus being more comprehensive than the models currently available in the literature. Additionally, the model also considers by-products, which can be used as inputs for other products.
Details