Search results

This study aims to minimize the transportation-related cost in distribution while utilizing a heterogeneous fixed fleet to deliver distinct demand at different geographical locations with a proper workload balancing approach. An increased cost in distribution is a major problem for many companies due to the absence of efficient planning methods to overcome operational challenges in distinct distribution networks. The problem addressed in this study is to minimize the transportation-related cost in distribution while using a heterogeneous fixed fleet to deliver distinct demand at different geographical locations with a proper workload balancing approach which has not gained the adequate attention in the literature.

This study formulated the transportation problem as a vehicle routing problem with a heterogeneous fixed fleet and workload balancing, which is a combinatorial optimization problem of the NP-hard category. The model was solved using both the simulated annealing and a genetic algorithm (GA) adopting distinct local search operators. A greedy approach has been used in generating an initial solution for both algorithms. The paired t-test has been used in selecting the best algorithm. Through a number of scenarios, the baseline conditions of the problem were further tested investigating the alternative fleet compositions of the heterogeneous fleet. Results were analyzed using analysis of variance (ANOVA) and Hsu’s MCB methods to identify the best scenario.

The solutions generated by both algorithms were subjected to the t-test, and the results revealed that the GA outperformed in solution quality in planning a heterogeneous fleet for distribution with load balancing. Through a number of scenarios, the baseline conditions of the problem were further tested investigating the alternative fleet utilization with different compositions of the heterogeneous fleet. Results were analyzed using ANOVA and Hsu’s MCB method and found that removing the lowest capacities trucks enhances the average vehicle utilization with reduced travel distance.

The developed model has considered both planning of heterogeneous fleet and the requirement of work load balancing which are very common industry needs, however, have not been addressed adequately either individually or collectively in the literature. The adopted solution methodologies to solve the NP-hard distribution problem consist of metaheuristics, statistical analysis and scenario analysis are another significant contribution. The planning of distribution operations not only addresses operational-level decision, through a scenario analysis, but also strategic-level decision has also been considered.

The planning of distribution operations not only addresses operational-level decisions, but also strategic-level decisions conducting a scenario analysis.

The purpose of this paper is twofold: first to carry out a comprehensive literature review for state of the art regarding airline schedule planning and second to identify some new research directions that might help academic researchers and practitioners.

The authors mainly focus on the research work appeared in the last three decades. The search process was conducted in database searches using four keywords: “Flight scheduling,” “Fleet assignment,” “Aircraft maintenance routing” (AMR), and “Crew scheduling”. Moreover, the combination of the keywords was used to find the integrated models. Any duplications due to database variety and the articles that were written in non-English language were discarded.

The authors studied 106 research papers and categorized them into five categories. In addition, according to the model features, subcategories were further identified. Moreover, after discussing up-to-date research work, the authors suggested some future directions in order to contribute to the existing literature.

The presented categories and subcategories were based on the model characteristics rather than the model formulation and solution methodology that are commonly used in the literature. One advantage of this classification is that it might help scholars to deeply understand the main variation between the models. On the other hand, identifying future research opportunities should help academic researchers and practitioners to develop new models and improve the performance of the existing models.

This study proposed some considerations in order to enhance the efficiency of the schedule planning process practically, for example, using the dynamic Stackelberg game strategy for market competition in flight scheduling, considering re-fleeting mechanism under heterogeneous fleet for fleet assignment, and considering the stochastic departure and arrival times for AMR.

In the literature, all the review papers focused only on one category of the five categories. Then, this category was classified according to the model formulation and solution methodology. However, in this work, the authors attempted to propose a comprehensive review for all categories for the first time and develop new classifications for each category. The proposed classifications are hence novel and significant.

The purpose of this paper is to improve the tactical planning of the stakeholders of the midstream liquefied natural gas (LNG) supply chain, using an optimisation approach. The results can contribute to enhance the proactivity on significant investment decisions.

A decision support tool (DST) is proposed to minimise the operational cost of a fleet of vessels. Mixed integer linear programming (MILP) used to perform contract assignment combined with a genetic algorithm solution are the foundations of the DST. The aforementioned methods present a formulation of the maritime transportation problem from the scope of tramp shipping companies.

The validation of the DST through a realistic case study illustrates its potential in generating quantitative data about the cost of the midstream LNG supply chain and the annual operations schedule for a fleet of LNG vessels.

The LNG transportation scenarios included assumptions, which were required for resource reasons, such as omission of stochasticity. Notwithstanding the assumptions made, it is to the authors’ belief that the paper meets its objectives as described above.

Potential practitioners may exploit the results to make informed decisions on the operation of LNG vessels, charter rate quotes and/or redeployment of existing fleet.

The research has a novel approach as it combines the creation of practical management tool, with a comprehensive mathematical modelling, for the midstream LNG supply chain. Quantifying future fleet costs is an alternative approach, which may improve the planning procedure of a tramp shipping company.

The objective of this work is to provide a novel aircraft allocation model for fractional business aviation. This model may provide decision-makers with alternative routing solutions that take into consideration preventive maintenance and failure prognostics information. The expected results are more efficient routing solutions when compared to conventional planning models, to help decision-makers improve operations and maintenance planning.

The model is a mixed integer linear problem formulation addressing and considering preventive maintenance and failure prognostics for optimal operations. Numerical experiments were performed using both field and synthetic data to validate the proposed method. All instances are solved using branch, price and cut algorithms from open-source software.

The results obtained in this study show that the use of failure prognostics information in aircraft routing can provide improvements in overall planning. By choosing slightly longer flight legs, the flight cost will increase, but putting an aircraft with a higher risk of failure on a leg inbound to a maintenance base can reduce maintenance and overall operating cost.

The model and method provide decision-makers with routing solutions that consider new aspects of planning, not used in previous works, such as failure. Most of the literature focuses on solving routing problems for large commercial airlines. Considering that, few solutions are found in literature for fractional business operators, which have their own operational particularities, such as a company managing a fleet of aircraft belonging to multiple shareowners. In such operation, clients may not always fly in the aircraft that they are shareowners, but an aircraft from the fractional fleet of the same category. Here, the company managing the aircraft guarantees that an aircraft will be ready to attend client demands in minimum time. One of the major differences from other models of operation is the dynamic nature of its flight demands, thus requiring flexible and agile planning limiting the available time to find a routing solution.

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 formulate and solve a new emergency evacuation planning problem. This problem addresses the needs of both able and disabled persons who are evacuated from multiple pick-up locations and transported using a heterogeneous fleet of vehicles.

The problem is formulated using a mixed integer linear programming model and solved using a heuristic algorithm. The authors analyze the selected heuristic with respect to key parameters and use it to address theoretical and practical case studies.

Evacuating people with disabilities has a significant impact on total evacuation time, due to increased loading/unloading times. Additionally, increasing the number of large capacity vehicles adapted to transport individuals with disabilities benefits total evacuation time.

The mathematical model is of high complexity and it is not possible to obtain exact solutions in reasonable computational times. The efficiency of the heuristic has not been analyzed with respect to optimality.

Solving the problem by a heuristic provides a fast solution, a requirement in emergency evacuation cases, especially when the state of the theater of the emergency changes dynamically. The parametric analysis of the heuristic provides valuable insights in improving an emergency evacuation system.

Efficient population evacuation studied in this work may save lives. This is especially critical for disabled evacuees, the evacuation of whom requires longer operational times.

The authors consider a population that comprises able and disabled individuals, the latter with varying degrees of disability. The authors also consider a heterogeneous fleet of vehicles, which perform multiple trips during the evacuation process.

The purpose of this paper is to propose going one step further in the simulation tools related to agriculture by integrating fleets of mobile robots for the execution of precision agriculture techniques. The proposed new simulation environment allows the user to define different mobiles robots and agricultural implements.

With this computational tool, the crop field, the fleet of robots and the different sensors and actuators that are incorporated into each robot can be configured by means of two interfaces: a configuration interface and a graphical interface, which interact with each other.

The system presented in this article unifies two very different areas – robotics and agriculture – to study and evaluate the implementation of precision agriculture techniques in a 3D virtual world. The simulation environment allows the users to represent realistic characteristics from a defined location and to model different variabilities that may affect the task performance accuracy of the fleet of robots.

This simulation environment, the first in incorporating fleets of heterogeneous mobile robots, provides realistic 3D simulations and videos, which grant a good representation and a better understanding of the robot labor in agricultural activities for researchers and engineers from different areas, who could be involved in the design and application of precision agriculture techniques. The environment is available at the internet, which is an added value for its expansion in the agriculture/robotics family.

This paper studies a supply chain consisting of multiple suppliers and a single buyer. It considers the case where a set of heterogeneous trucks is used for transporting products, and develops a mathematical model that coordinates the supply chain. The purpose of this paper is to minimise the costs of producing and delivering a product as well as carbon emissions resulting from transportation. In addition, the authors analyse how imposing a tax on carbon emissions impacts the delivery of products from the suppliers to the buyer.

It is assumed that heterogeneous vehicles are used for transporting products, which have different performance and cost attributes. A mathematical model that considers both operating costs and carbon emissions from transportation is developed. The impact of vehicle attributes on lot sizing and routing decisions is studied with the help of numerical examples and a sensitivity analysis.

The analysis shows that considering carbon emissions in coordinating a supply chain leads to changes in the routing of vehicles. It is further shown that if carbon emissions lead to costs, routes are changed in such a way that vehicles travel long distances empty or with a low vehicle load to reduce fuel consumption and therewith emissions.

Several areas for future work are highlighted. The study of alternative supply chain structures, for example structures which include logistics service providers, or the investigation of different functional relationships between vehicle load and emission generation offer possibilities for extending the model.

The paper is one of the first to study the use of heterogeneous vehicles in an inventory model of a supply chain, and one of the few supply chain inventory models that consider ecological aspects.

This study aims to examine ship loading strategies during large-scale military deployments. Ships are usually loaded to a stowage goal of about 65% of the ship's capacity. The authors identify how much cargo to load onto ships for each sailing and propose lower stowage goals that could improve the delivery of forces during the deployment.

The authors construct several mixed integer programs to identify optimal ship loading strategies that minimize delivery timelines for notional, but realistic, problem variables. The authors study the relative importance of these variables using experimental designs, regressions, correlations and chi-square tests of the empirical results.

The research specifies the conditions during which ships should be light loaded, i.e. loaded to less than 65% of total capacity. Empirical results show cargo delivered up to 16% faster with a light-loaded strategy compared to fully loaded ships.

This work assumes deterministic sailing times and ship loading times. Also, all timing aspects of the problem are estimated to the nearest natural number of days.

This research provides important new insights about optimal ship loading strategies, which were not previously quantified. More importantly, logistics planners could use these insights to reduce sealift delivery timelines during military deployments.

Most ship routing and scheduling problems minimize costs as the primary goal. This research identifies the situations in which ships transporting military forces should be light loaded, thereby trading efficiency for effectiveness, to enable faster overall delivery of unit equipment to theater seaports.

This study focuses on a specific method of meat production that involves carcass purchase and meat production by packing facilities with a novel two-stage model that simultaneously considers location-routing and inventory-production operating decisions. The considered problem aims to reduce variable and fixed transportation and production costs, inventory holding cost and the cost of opening cold storage facilities.

The proposed model encompasses a two-stage model consisting of a single-echelon and a three-echelon many-to-many network with deterministic demand. The proposed model is a mixed-integer linear programming (MILP) model which was tested with the general algebraic modelling system (GAMS) software for a real-world case study in Iran. A sensitivity analysis was performed to examine the effect of retailers' holding capacity and supply capacity at carcass suppliers.

In this research, the number of products transferred at each level, the number of products held, the quantity of red meat produced, the required cold storage facilities and the required vehicles were optimally specified. The outcomes indicated a two percent (2%) decrease in cost per kg of red meat. Eventually, the outcomes of the first and second sensitivity analysis indicated that reduced retailers' holding capacity and supply capacity at carcass suppliers leads to higher total costs.

This research proposes a novel multi-period location-inventory-routing problem for the red meat supply chain in an emerging economy with a heterogeneous vehicle fleet and logistics decisions. The proposed model is presented in two stages and four-echelon including carcass suppliers, packing facilities, cold storage facilities and retailers.