Search results

This paper introduces a new heuristic algorithm that aims to solve the military route vulnerability problem, which involves assessing the vulnerability of military cargo flowing over roads and railways subject to enemy interdiction.

Graph theory, a heuristic and a binary integer program are used in this paper.

This work allows transportation analysts at the United States Transportation Command to identify a relatively small number of roads or railways that, if interdicted by an enemy, could disrupt the flow of military cargo within any theater of operation.

This research does not capture aspects of time, such as the reality that cargo requirements and enemy threats may fluctuate each day of the contingency.

This work provides military logistics planners and decision-makers with a vulnerability assessment of theater distribution routes, including insights into which specific roads and railways may require protection to ensure the successful delivery of cargo from ports of debarkation to final destinations.

This work merges network connectivity and flow characteristics with enemy threat assessments to identify militarily-useful roads and railways most vulnerable to enemy interdictions. A geographic combatant command recently used this specific research approach to support their request for rapid rail repair capability.

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.

The purpose of this paper is to help optimize sustainment logistics for US Army brigade combat teams, which may face challenges in transporting their assigned assets.

This paper develops a simulation framework with an integrated integer programming optimization model. The integer-programming model optimizes sustainment outcomes of supported battalions on a daily basis, whereas the simulation framework analyzes risk associated with shortfalls that may arise over the entire duration of a conflict.

This work presents a scenario reflecting the steady resupply of an infantry brigade combat team during combat operations and presents an in-depth risk analysis for possible fleet compositions.

The risk curves obtained allow decision-makers and commanders to optimize vehicle fleet design in advance of a conflict.

Environmental issues have become an important concern in modern supply chain management. The structure of closed-loop supply chain (CLSC) networks, which considers both forward and reverse logistics, can greatly improve the utilization of materials and enhance the performance of the supply chain in coping with environmental impacts and cost control.

A biobjective mixed-integer programming model is developed to achieve the balance between environmental impact control and operational cost reduction. Various factors regarding the capacity level and the environmental level of facilities are incorporated in this study. The scenario-based method and the Epsilon method are employed to solve the stochastic programming model under uncertain demand.

The proposed stochastic mixed-integer programming (MIP) model is an effective way of formulating and solving the CLSC network design problem. The reliability and precision of the Epsilon method are verified based on the numerical experiments. Conversion efficiency calculation can achieve the trade-off between cost control and CO₂ emissions. Managers should pay more attention to activities about facility operation. These nodes might be the main factors of costs and environmental impacts in the CLSC network. Both costs and CO₂ emissions are influenced by return rate especially costs. Managers should be discreet in coping with cost control for CO₂ emissions barely affected by return rate. It is advisable to convert the double target into a single target by the idea of “Efficiency of CO₂ Emissions Control Reduction.” It can provide managers with a way to double-target conversion.

We proposed a biobjective optimization problem in the CLSC network considering environmental impact control and operational cost reduction. The scenario-based method and the Epsilon method are employed to solve the mixed-integer programming model under uncertain demand.

Disaster management and humanitarian logistics (HT) play crucial roles in large-scale events such as earthquakes, floods, hurricanes and tsunamis. Well-organized disaster response is crucial for effectively managing medical centres, staff allocation and casualty distribution during emergencies. To address this issue, this study aims to introduce a multi-objective stochastic programming model to enhance disaster preparedness and response, focusing on the critical first 72 h after earthquakes. The purpose is to optimize the allocation of resources, temporary medical centres and medical staff to save lives effectively.

This study uses stochastic programming-based dynamic modelling and a discrete-time Markov Chain to address uncertainty. The model considers potential road and hospital damage and distance limits and introduces an a-reliability level for untreated casualties. It divides the initial 72 h into four periods to capture earthquake dynamics.

Using a real case study in Istanbul’s Kartal district, the model’s effectiveness is demonstrated for earthquake scenarios. Key insights include optimal medical centre locations, required capacities, necessary medical staff and casualty allocation strategies, all vital for efficient disaster response within the critical first 72 h.

This study innovates by integrating stochastic programming and dynamic modelling to tackle post-disaster medical response. The use of a Markov Chain for uncertain health conditions and focus on the immediate aftermath of earthquakes offer practical value. By optimizing resource allocation amid uncertainties, the study contributes significantly to disaster management and HT research.

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 paper aims to investigate the location of regional and international hub ports in liner shipping by proposing a hierarchical hub location problem.

This paper develops a mixed-integer linear programming model for the authors’ proposed problem. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of this model.

The results show that one international hub port (i.e. Rotterdam) and one regional hub port (i.e. Zeebrugge) are opened in Europe. Two international hub ports (i.e. Sokhna and Salalah) are located in Western Asia, where no regional hub port is established. One international hub port (i.e. Colombo) and one regional hub port (i.e. Cochin) are opened in Southern Asia. One international hub port (i.e. Singapore) and one regional hub port (i.e. Jakarta) are opened in Southeastern Asia and Australia. Three international hub ports (i.e. Hong Kong, Shanghai and Yokohama) and two regional hub ports (i.e. Qingdao and Kwangyang) are opened in Eastern Asia.

This paper proposes a hierarchical hub location problem, in which the authors distinguish between regional and international hub ports in liner shipping. Moreover, scale economies in ship size are considered. Furthermore, the proposed problem introduces the main ports.

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.

This paper recommends new criteria for selecting seaports of embarkation during military deployments. Most importantly, this research compares the current port selection criterion, which is to select the seaport with the shortest inland transport time from the deploying installation, to the proposed port selection criteria, which are to select the seaport based on the shortest combined inland and oceanic transit time to the destination theater.

The authors construct an original integer program to select seaports that minimize the expected delivery timeline for a set of notional, but realistic, deployment requirements. The integer program is solved considering the current as well as the proposed port selection criteria. The solutions are then compared using paired-samples t-tests to assess the statistical significance of the port selection criteria.

This work suggests that the current port selection criterion results in a 10–13% slower delivery of deploying forces as compared to the proposed port selection criteria.

This work assumes deterministic inland transit times, oceanic transit times, and seaport processing rates. Operational fluctuations in transit times and processing rates are not expected to change the findings from this research.

This research provides evidence that the current port selection criterion for selecting seaports for military units deploying from the Continental United States is suboptimal. More importantly, logistics planners could use these recommended port selection criteria to reduce the expected delivery timelines during military deployments.

Several military doctrinal references suggest that planners select seaports based on habitual installation-to-port pairings, especially for early deployers. This work recommends a change to the military's current port selection process based on empirical analyses that show improvements to deployment timelines.