253 research outputs found
Robustness and Adaptiveness Analysis of Future Fleets
Making decisions about the structure of a future military fleet is a
challenging task. Several issues need to be considered such as the existence of
multiple competing objectives and the complexity of the operating environment.
A particular challenge is posed by the various types of uncertainty that the
future might hold. It is uncertain what future events might be encountered; how
fleet design decisions will influence and shape the future; and how present and
future decision makers will act based on available information, their personal
biases regarding the importance of different objectives, and their economic
preferences. In order to assist strategic decision-making, an analysis of
future fleet options needs to account for conditions in which these different
classes of uncertainty are exposed. It is important to understand what
assumptions a particular fleet is robust to, what the fleet can readily adapt
to, and what conditions present clear risks to the fleet. We call this the
analysis of a fleet's strategic positioning. This paper introduces how
strategic positioning can be evaluated using computer simulations. Our main aim
is to introduce a framework for capturing information that can be useful to a
decision maker and for defining the concepts of robustness and adaptiveness in
the context of future fleet design. We demonstrate our conceptual framework
using simulation studies of an air transportation fleet. We capture uncertainty
by employing an explorative scenario-based approach. Each scenario represents a
sampling of different future conditions, different model assumptions, and
different economic preferences. Proposed changes to a fleet are then analysed
based on their influence on the fleet's robustness, adaptiveness, and risk to
different scenarios
Robustness and Adaptability Analysis of Future Military Air Transportation Fleets
Making decisions about the structure of a future military fleet is challenging. Several issues need to be considered, including multiple competing objectives and the complexity of the operating environment. A particular challenge is posed by the various types of uncertainty that the future holds. It is uncertain what future events might be encountered and how fleet design decisions will influence these events. In order to assist strategic decision-making, an analysis of future fleet options needs to account for conditions in which these different uncertainties are exposed. It is important to understand what assumptions a particular fleet is robust to, what the fleet can readily adapt to, and what conditions present risks to the fleet. We call this the analysis of a fleetās strategic positioning. Our main aim is to introduce a framework that captures information useful to a decision maker and defines the concepts of robustness and adaptability in the context of future fleet design. We demonstrate our conceptual framework by simulating an air transportation fleet problem. We account for uncertainty by employing an explorative scenario-based approach. Each scenario represents a sampling of different future conditions and different model assumptions. Proposed changes to a fleet are then analysed based on their influence on the fleetās robustness, adaptability, and risk to different scenarios
Simultaneous Planning of Liner Ship Speed Optimization, Fleet Deployment, Scheduling and Cargo Allocation with Container Transshipment
Due to a substantial growth in the world waterborne trade volumes and drastic
changes in the global climate accounted for CO2 emissions, the shipping
companies need to escalate their operational and energy efficiency. Therefore,
a multi-objective mixed-integer non-linear programming (MINLP) model is
proposed in this study to simultaneously determine the optimal service
schedule, number of vessels in a fleet serving each route, vessel speed between
two ports of call, and flow of cargo considering transshipment operations for
each pair of origin-destination. This MINLP model presents a trade-off between
economic and environmental aspects considering total shipping time and overall
shipping cost as the two conflicting objectives. The shipping cost comprises of
CO2 emission, fuel consumption and several operational costs where fuel
consumption is determined using speed and load. Two efficient evolutionary
algorithms: Nondominated Sorting Genetic Algorithm II (NSGA-II) and Online
Clustering-based Evolutionary Algorithm (OCEA) are applied to attain the
near-optimal solution of the proposed problem. Furthermore, six problem
instances of different sizes are solved using these algorithms to validate the
proposed model.Comment: 28 pages, 10 figure
Rough-Cut Capacity Planning in Multimodal Freight Transportation Networks
A main challenge in transporting cargo for United States Transportation Command (USTRANSCOM) is in mode selection or integration. Demand for cargo is time sensitive and must be fulfilled by an established due date. Since these due dates are often inflexible, commercial carriers are used at an enormous expense, in order to fill the gap in organic transportation asset capacity. This dissertation develops a new methodology for transportation capacity assignment to routes based on the Resource Constrained Shortest Path Problem (RCSP). Routes can be single or multimodal depending on the characteristics of the network, delivery timeline, modal capacities, and costs. The difficulty of the RCSP requires use of metaheuristics to produce solutions. An Ant Colony System to solve the RCSP is developed in this dissertation. Finally, a method for generating near Pareto optimal solutions with respect to the objectives of cost and time is developed
Multi-objective sustainable location-districting for the collection of municipal solid waste : two case studies
This paper presents a multi-objective location-districting optimization model for sustainable collection of municipal solid waste, motivated by strategic waste management decisions in Iran. The model aims to design an efficient system for providing municipal services by integrating the decisions regarding urban area districting and the location of waste collection centers. Three objectives are minimized, given as 1) the cost of establishing collection centers and collecting waste, 2) a measure of destructive environmental consequences, and 3) a measure of social dissatisfaction. Constraints are formulated to enforce an exclusive assignment of urban areas to districts and that the created districts are contiguous. In addition, constraints make sure that districts are compact and that they are balanced in terms of the amount of waste collected. A multi-objective local search heuristic using the farthest-candidate method is implemented to solve medium and large-scale numerical instances, while small instances can be solved directly by commercial software. A set of randomly generated test instances is used to test the effectiveness of the heuristic. The model and the heuristic are then applied to two case studies from Iran. The obtained results indicate that waste collection costs can be reduced by an estimated 20-30 %, while significantly improving the performance with respect to environmental and social criteria. Thus, the provided approach can provide important decision support for making strategic choices in municipal solid waste management. Keywords: multi-objective optimization, local search, best-worst methodpublishedVersio
OPTIMIZATION OF RAILWAY TRANSPORTATION HAZMATS AND REGULAR COMMODITIES
Transportation of dangerous goods has been receiving more attention in the realm of academic and scientific research during the last few decades as countries have been increasingly becoming industrialized throughout the world, thereby making Hazmats an integral part of our life style. However, the number of scholarly articles in this field is not as many as those of other areas in SCM. Considering the low-probability-and-high-consequence (LPHC) essence of transportation of Hazmats, on the one hand, and immense volume of shipments accounting for more than hundred tons in North America and Europe, on the other, we can safely state that the number of scholarly articles and dissertations have not been proportional to the significance of the subject of interest. On this ground, we conducted our research to contribute towards further developing the domain of Hazmats transportation, and sustainable supply chain management (SSCM), in general terms.
Transportation of Hazmats, from logistical standpoint, may include all modes of transport via air, marine, road and rail, as well as intermodal transportation systems. Although road shipment is predominant in most of the literature, railway transportation of Hazmats has proven to be a potentially significant means of transporting dangerous goods with respect to both economies of scale and risk of transportation; these factors, have not just given rise to more thoroughly investigation of intermodal transportation of Hazmats using road and rail networks, but has encouraged the competition between rail and road companies which may indeed have some inherent advantages compared to the other medium due to their infrastructural and technological backgrounds. Truck shipment has ostensibly proven to be providing more flexibility; trains, per contra, provide more reliability in terms of transport risk for conveying Hazmats in bulks.
In this thesis, in consonance with the aforementioned motivation, we provide an introduction into the hazardous commodities shipment through rail network in the first chapter of the thesis. Providing relevant statistics on the volume of Hazmat goods, number of accidents, rate of incidents, and rate of fatalities and injuries due to the incidents involving Hazmats, will shed light onto the significance of the topic under study. As well, we review the most pertinent articles while putting more emphasis on the state-of-the-art papers, in chapter two. Following the discussion in chapter 3 and looking at the problem from carrier companyās perspective, a mixed integer quadratically constraint problem (MIQCP) is developed which seeks for the minimization of transportation cost under a set of constraints including those associating with Hazmats. Due to the complexity of the problem, the risk function has been piecewise linearized using a set of auxiliary variables, thereby resulting in an MIP problem. Further, considering the interests of both carrier companies and regulatory agencies, which are minimization of cost and risk, respectively, a multiobjective MINLP model is developed, which has been reduced to an MILP through piecewise linearization of the risk term in the objective function. For both single-objective and multiobjective formulations, model variants with bifurcated and nonbifurcated flows have been presented. Then, in chapter 4, we carry out experiments considering two main cases where the first case presents smaller instances of the problem and the second case focuses on a larger instance of the problem.
Eventually, in chapter five, we conclude the dissertation with a summary of the overall discussion as well as presenting some comments on avenues of future work
Multi-objective Dual-Sale Channel Supply Chain Network Design Based on NSGA-II
[[abstract]]In this study, we propose a two-echelon multi-objective dual-sale channel supply chain network (DCSCN) model. The goal is to determine (i) the set of installed DCs, (ii) the set of customers the DC should work with, how much inventory each DC should order and (iv) the distribution routes for physical retailers or online e-tailers (all starting and ending at the same DC). Our model overcomes the drawback by simultaneously tackling location and routing decisions. In addition to the typical costs associated with facility location and the inventory-related costs, we explicitly consider the pivotal routing costs between the DCs and their assigned customers. Therefore, a multiple objectives location-routing model involves two conflicting objectives is initially proposed so as to permit a comprehensive trade-off evaluation. To solve this multiple objectives programming problem, this study integrates genetic algorithms, clustering analysis, Non-dominated Sorting Genetic Algorithm II (NSGA-II). NSGA-II searches for the Pareto set. Several experiments are simulated to demonstrate the possibility and efficacy of the proposed approach.[[notice]]č£ę£å®ē¢[[incitationindex]]EI[[booktype]]ē“
A Hybrid Tabu/Scatter Search Algorithm for Simulation-Based Optimization of Multi-Objective Runway Operations Scheduling
As air traffic continues to increase, air traffic flow management is becoming more challenging to effectively and efficiently utilize airport capacity without compromising safety, environmental and economic requirements. Since runways are often the primary limiting factor in airport capacity, runway operations scheduling emerge as an important problem to be solved to alleviate flight delays and air traffic congestion while reducing unnecessary fuel consumption and negative environmental impacts. However, even a moderately sized real-life runway operations scheduling problem tends to be too complex to be solved by analytical methods, where all mathematical models for this problem belong to the complexity class of NP-Hard in a strong sense due to combinatorial nature of the problem. Therefore, it is only possible to solve practical runway operations scheduling problem by making a large number of simplifications and assumptions in a deterministic context. As a result, most analytical models proposed in the literature suffer from too much abstraction, avoid uncertainties and, in turn, have little applicability in practice. On the other hand, simulation-based methods have the capability to characterize complex and stochastic real-life runway operations in detail, and to cope with several constraints and stakeholdersā preferences, which are commonly considered as important factors in practice.
This dissertation proposes a simulation-based optimization (SbO) approach for multi-objective runway operations scheduling problem. The SbO approach utilizes a discrete-event simulation model for accounting for uncertain conditions, and an optimization component for finding the best known Pareto set of solutions. This approach explicitly considers uncertainty to decrease the real operational cost of the runway operations as well as fairness among aircraft as part of the optimization process. Due to the problemās large, complex and unstructured search space, a hybrid Tabu/Scatter Search algorithm is developed to find solutions by using an elitist strategy to preserve non-dominated solutions, a dynamic update mechanism to produce high-quality solutions and a rebuilding strategy to promote solution diversity. The proposed algorithm is applied to bi-objective (i.e., maximizing runway utilization and fairness) runway operations schedule optimization as the optimization component of the SbO framework, where the developed simulation model acts as an external function evaluator. To the best of our knowledge, this is the first SbO approach that explicitly considers uncertainties in the development of schedules for runway operations as well as considers fairness as a secondary objective.
In addition, computational experiments are conducted using real-life datasets for a major US airport to demonstrate that the proposed approach is effective and computationally tractable in a practical sense. In the experimental design, statistical design of experiments method is employed to analyze the impacts of parameters on the simulation as well as on the optimization componentās performance, and to identify the appropriate parameter levels. The results show that the implementation of the proposed SbO approach provides operational benefits when compared to First-Come-First-Served (FCFS) and deterministic approaches without compromising schedule fairness. It is also shown that proposed algorithm is capable of generating a set of solutions that represent the inherent trade-offs between the objectives that are considered. The proposed decision-making algorithm might be used as part of decision support tools to aid air traffic controllers in solving the real-life runway operations scheduling problem
āMake no little plansā: Impactful research to solve the next generation of transportation problems
The transportation science research community has contributed to numerous practical and intellectual innovations and improvements over the last decades. Technological advancements have broadened and amplified the potential impacts of our field.
At the same time, the world and its communities are facing greater and more serious
challenges than ever before. In this paper, we call upon the transportation science
research community to work on a research agenda that addresses some of the most
important of these challenges. This agenda is guided by the sustainable development
goals outlined by the United Nations and organized into three areas: (1) well-being,
(2) infrastructure, and, (3) natural environment. For each area, we identify current
and future challenges as well as research directions to address those challenges
- ā¦