Search

Economic globalization and the rapid development of the Internet make logistics systems more and more diversified, people and enterprises have greatly increased their requirements for logistics systems, and fourth party logistics has received more and more attention from people and related enterprises. In order to further study the routing problem under uncertain stochastic environments, this paper considers the fourth party logistics routing problem from a single manufacturer to multiple distributors with uncertain times and random supplies under the complete information symmetry scenario and symmetric transportation volume decision space. Then, an uncertain stochastic programming model is established with the minimum total cost as its core objective, and the total transportation time, manufacturer's supply, and distributor's demand as constraints. In order to solve the optimal path of the above problems, this paper transforms the uncertain stochastic programming model into a classical mathematical programming model based on the distribution functions of uncertain time and random supply. Finally, two numerical examples are given to verify the effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

Environmental concerns have called for several measures to be taken within the logistics and transportation fields. Among these measures is the adoption of electric vehicles instead of diesel-operated vehicles for personal and commercial-delivery use. The optimized routing of electric vehicles for the commercial delivery of products is the focus of this paper. We study the effect of several practical challenges that are faced when routing electric vehicles. Electric vehicle routing faces the additional challenge of the potential need for recharging while en route, leading to more travel time, and hence cost. Therefore, in this work, we address the issue of electric vehicle routing problem, allowing for partial recharging while en route. In addition, the practical mandate of the time windows set by customers is also considered, where electric vehicle routing problems with soft time windows are studied. Real-life experience shows that the delivery of customers' demands might be uncertain. In addition, real-time traffic conditions are usually uncertain due to congestion. Therefore, in this work, uncertainties in customers' demands and traffic conditions are modeled and solved using fuzzy methods. The problems of fuzzy real-time, fuzzy demand, and electric vehicle routing problems with soft time windows are addressed. A mixed-integer programming mathematical model to represent the problem is developed. A novel two-phase solution approach is proposed to solve the problem. In phase I, the classical genetic algorithm (GA) is utilized to obtain an optimum/near-optimum solution for the fuzzy demand electric vehicle routing problem with soft time windows (FD-EVRPSTW). In phase II, a novel fuzzy real-time-adaptive optimizer (FRTAO) is developed to overcome the challenges of recharging and real-time traffic conditions facing FD-EVRPSTW. The proposed solution approach is tested on several modified benchmark instances, and the results show the significance of recharging and congestion challenges for routing costs. In addition, the results show the efficiency of the proposed two-phase approach in overcoming the challenges and reducing the total costs. [ABSTRACT FROM AUTHOR]

Software trustworthiness is an important research field in software engineering. In order to appropriately evaluate it, some different measurement approaches have been proposed, which have important guiding significance for improving software trustworthiness. Recently, we have investigated attributes-based approaches. That is, how to maximize trustworthy degree of some software satisfying a given threshold by adjusting every attribute value such that the cost is minimal, i.e., the sum of all attribute values is as small as possible. The work is helpful to improve the software quality under the same cost. This paper continues this work and considers a reallocation approach to dealing with the problem that the threshold and the minimal constraints of every attribute values dynamically increase. In this process, the costs of trustworthiness improvement should be ensured to be minimal. For this purpose, we firstly define a reallocation model by mathematical programming. Then we introduce the notion of growth function. Based on this, a polynomial reallocation algorithm is designed to solve the above reallocation model. Finally, we verify our work on spacecraft softwares and the results show that this work is valid. [ABSTRACT FROM AUTHOR]

Once trusted, automated vehicles (AVs) will gradually appear in urban areas. Such a transition is an opportunity in transport planning to control undesired impacts and possibly mitigate congestion at a time when both conventional vehicles (CVs) and AVs coexist. This paper deals with the complex transport decision problem of designing part of the network that is exclusive for AVs through a nonlinear programming model. The objective function minimises the costs of travel times where vehicles circulate under user equilibrium. The model evaluates the benefits of having an AVs-dedicated infrastructure and the associated costs from the detouring of CVs. Three planning strategies are explored: incremental, long-term and hybrid planning. The first creates a subnetwork evolving incrementally over time. The second reversely designs a subnetwork from the optimal solution obtained at a ratio of 90% AVs. The third limits the incremental planning towards that optimal long-term solution. The model is applied to the city of Delft, in the Netherlands. Two scenarios are analysed, with and without AV-dedicated roads, at several AV penetration rates. We find that implementing dedicated roads for AVs reduces the overall costs and congestion up to 16%. However, CV detouring is inevitable at later network stages, increasing the total distance travelled (up to 8%) and congestion in the surroundings of AV subnetworks. Concerning the planning strategies, incremental planning is appropriate for starting in the initial stages and is the strategy that most tackles CV detouring. The hybrid or the long-term strategies are more suitable to be applied after a ratio of 50% AVs, and the hybrid planning is the strategy that most reduces delay. [ABSTRACT FROM AUTHOR]

The analytic hierarchy process (AHP) is one of the most popular multi-criteria decision-making (MCDM) methods, and so is its extension fuzzy analytic hierarchy process (FAHP). However, the FAHP, unlike the AHP, easily handles the trusted weights by the consistency index (CI) or consistency ratio (CR). We need to first derive the consistent fuzzy pairwise comparison matrix (FPCM) by the transitivity axiom and then drive fuzzy weights. We also need a flexible mechanism for users to control the spread of fuzzy weights under tolerable consistency. In this paper, we propose a novel model based on mathematical programming to derive rational fuzzy weights of the FAHP and provide a parameter for decision-makers to control the spread of fuzzy weights. Three examples are used to demonstrate the proposed method and compared with others to validate and justify the proposed method. [ABSTRACT FROM AUTHOR]

The berth allocation problem determining the berthing time and position for incoming vessels in port operations has garnered increased attention within the global transportation network. This study focuses on the berth allocation problem with a continuous quay and dynamic vessel arrivals. With the overarching goal of enhancing service quality and optimizing berth utilization rates, this article proposes a mathematical programming model that minimizes the total waiting time of vessels and the overall completion time of vessel service. The formulated model is a mixed-integer linear programming problem that deterministic optimization techniques can globally solve. For large-scale problems, this study develops a genetic algorithm optimization approach to improve computational efficiency in reaching a near-optimal solution. Several numerical experiments are conducted to demonstrate the effectiveness and efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

Background: Brazil is one of the largest consumers of fertilizers and is highly dependent on the international market to meet its demand for agricultural production inputs. The complexity of the fertilizer supply chain motivated us to carry out this study on redesigning the fertilizer logistics chain and evaluate strategies for reducing logistics costs by redesigning the fertilizer mixing network in Brazil, a country that is heavily dependent on imported fertilizers for agriculture. Methods: We introduce a multi-product mixed-integer linear programming optimization model encompassing the logistics network, from import ports to mixing factories and agricultural fertilizer supply centers. This model includes logistics infrastructure and taxes, accounting for greenhouse gas emissions (specifically carbon dioxide) in fertilizer logistics. Results: The results indicate that expanding the port capacity for fertilizer importation can significantly reduce logistics costs and greenhouse gas emissions by up to 22.5%, decreasing by 23.9% compared to the baseline. We also observed that removing taxes on fertilizer importation can reduce logistics costs by approximately 11%, but it increases greenhouse gas emissions by 2.25% due to increased reliance on road transport. We identified 15 highly resilient regions for establishing mixing factories, evaluated various scenarios and determined the importance of these locations in optimizing the fertilizer supply network in the country. Moreover, the results suggest a significant potential to enhance the role of Brazil's Northern Arc region in fertilizer import flows. Conclusions: Public policies and private initiatives could be directed toward encouraging the establishment of mixing factories in the identified regions and increasing transport capacity in the Northern Arc region. Improving the logistical conditions of the fertilizer network would contribute to food security by reducing the costs of essential inputs in food production and promoting sustainability by reducing greenhouse gas emissions. [ABSTRACT FROM AUTHOR]

The aim of this study was to develop a multi-objective mathematical programming model for the trade-off of time, cost, and quality in the project-scheduling problem (PSP) by taking priorities and resource constraints as well as activity preemption into account. First, a small-sized problem instance that was a sub-project of an oil and gas construction project was used for te validation of the proposed model and algorithm. Subsequently, considering the sensitivity, complexity, and importance of oil and gas projects, the proposed model was implemented in a large-sized oil and gas construction project. Considering the NP-hardness of this problem, the NSGA-II metaheuristic algorithm was used to deal with the time, cost, and quality trade-off problem. Finally, a sensitivity analysis was implemented on the three main parameters of time, cost, and quality to investigate the effects of changes on the results. The findings show that the proposed model is more sensitive to cost changes, so an increase in project costs leads to a drastic change in the values of other objective functions. [ABSTRACT FROM AUTHOR]

In this study, we propose a novel multi-objective nonlinear mixed-integer mathematical programming model for the transit network design and frequency setting problem that aims at designing the routes and determining the frequencies of the routes to satisfy passenger demand in a transit network. The proposed model incorporates the features of real-life transit network systems and reflects the views of both passengers and the transit agency by considering the in-vehicle travel time, transfers, waiting times at the boarding and transfer stops, overcrowding and under-utilization of vehicles, and vehicle fleet size. Unlike previous studies that simplify several aspects of the transit network design and frequency setting problem, the proposed model is the first to determine routes and their frequencies simultaneously from scratch, i.e., without using line and frequency pools while considering the aforementioned issues, such as transfers and waiting. We solve the proposed model using Gurobi. We provide the results of what-if analyses conducted using a real-world public bus transport network in the city of Kayseri in Türkiye. We also present the results of computational tests implemented to validate and verify the model using Mandl benchmark instances from the literature. The results indicate that the model produces better solutions than the state-of-the-art algorithms in the literature and that the model can be used by public transit planners as a decision aid. [ABSTRACT FROM AUTHOR]

Phasor Measurement Units (PMUs) are the backbone of smart grids that are able to measure power system observability in real-time. The deployment of synchronized sensors in power networks opens up the advantage of real-time monitoring of the network state. An optimal number of PMUs must be installed to ensure system observability. For that reason, an objective function is minimized, reflecting the cost of PMU installation around the power grid. As a result, a minimization model is declared where the objective function is defined over an adequate number of constraints on a binary decision variable domain. To achieve maximum network observability, there is a need to find the best number of PMUs and put them in appropriate locations around the power grid. Hence, maximization models are declared in a decision-making way to obtain optimality satisfying a guaranteed stopping and optimality criteria. The best performance metrics are achieved using binary integer, semi-definite, and binary polynomial models to encounter the optimal number of PMUs with suitable PMU positioning sites. All optimization models are implemented with powerful optimization solvers in MATLAB to obtain the global solution point. [ABSTRACT FROM AUTHOR]

Stochastic Programming is a powerful framework that addresses decision-making under uncertainties, which is a frequent occurrence in real-world problems. To effectively solve Stochastic Programming problems, scenario generation is one of the common practices that organizes realizations of stochastic processes with finite discrete distributions, which enables the use of mathematical programming models of the original problem. The quality of solutions is significantly influenced by the scenarios employed, necessitating a delicate balance between incorporating informative scenarios and preventing overfitting. Distributions-based scenario generation methodologies have been extensively studied over time, while a relatively recent concept of problem-driven scenario generation has emerged, aiming to incorporate the underlying problem's structure during the scenario generation process. This survey explores recent literature on problem-driven scenario generation algorithms and methodologies. The investigation aims to identify circumstances under which this approach is effective and efficient. The work provides a comprehensive categorization of existing literature, supplemented by illustrative examples. Additionally, the survey examines potential applications and discusses avenues for its integration with machine learning technologies. By shedding light on the effectiveness of problem-driven scenario generation and its potential for synergistic integration with machine learning, this survey contributes to enhanced decision-making strategies in the context of uncertainties. [ABSTRACT FROM AUTHOR]

Pan-sharpening algorithms are data-and computation-intensive, and the processing performance can be poor if common serial processing techniques are adopted. This paper presents a parallel computing paradigm for pan-sharpening algorithms based on a generalized fusion model and parallel computing techniques. The developed modules, including eight typical pan-sharpening algorithms, show that the framework can be applied to implement most algorithms. The experiments demonstrate that if parallel strategies are adopted, in the best cases the fastest times required to finish the entire fusion operation (including disk input/output (I/O) and computation) are close to the time required to directly read and write the images without any computation. The parallel processing implemented on a workstation with two CPUs is able to perform these operations up to 13.9 times faster than serial execution. An algorithm in the framework is 32.6 times faster than the corresponding version in the ERDAS IMAGINE software. Additionally, no obvious differences in the fusion effects are observed between the fusion results of different implemented versions. [ABSTRACT FROM AUTHOR]

In this paper we present a stochastic route choice model for transit networks that explicitly addresses route correlation due to overlapping alternatives. The model is based on a multi-objective mathematical programming problem, the optimality conditions of which generate an extension to the Multinomial Logit models. The proposed model considers a fixed point problem for treating correlations between routes, which can be solved iteratively. We estimated the new model on the Santiago (Chile) Metro network and compared the results with other route choice models that can be found in the literature. The new model has better explanatory and predictive power that many other alternative models, correctly capturing the correlation factor. Our methodology can be extended to private transport networks. [ABSTRACT FROM AUTHOR]

In this paper, we first use the information we have on the patients of an oncology day hospital to distribute the treatment schedules they have in each of the visits to this centre. To do this, we propose a deterministic mathematical programming model in such a way that we minimise the duration of the waiting room stays of the total set of patients and taking into account the restrictions of the circuit. Secondly, we will look for a solution to the same problem under a stochastic approach. This model will explicitly consider the existing uncertainty in terms of the different times involved in the circuit, and this model also allows the reorganisation of the schedules of medical appointments with oncologists. The models are complemented by a tool that solves the problem of assigning nurses to patients. The work is motivated by the particular characteristics of a real hospital and the models are used and compared with data from this case. [ABSTRACT FROM AUTHOR]

In this work, the state estimation problem of electric power systems is represented through a mathematical programming approach. Initially, a non-linear mathematical model based on the classical method of weighted least squares is proposed to solve the state estimation problem for comparative purposes. Due to the inherent limitations that this classical model presents when dealing with errors in the set of measurements, a new mathematical model is proposed that can be used within an iterative procedure to reduce the impact of measurement errors on the estimated results. Several tests on a didactic 5-bus power system and IEEE benchmark power test systems showed the effectiveness of the proposed approach which achieved better results than the proposed classical state estimation model. The non-linear programming models proposed in this paper are implemented in the mathematical modeling language AMPL. Additionally, to validate the results of the proposed methodologies, the power system operation points are compared with the results obtained using the Matpower simulation package. The results allowed concluding that the proposed mathematical models can be successfully applied to perform state estimation studies in power systems. [ABSTRACT FROM AUTHOR]

This research addresses and analyzes the results of a six-sigma approach used to optimize the logistics costs of a pipe manufacturing company. Two mathematical models are developed for containers to control the company's logistics. The Mathematical Programming Language (MPL) software is used to generate and solve these models. The results verify that the proposed mathematical models result in the company's logistics improvement, especially in the DMAIC (define, measure, analyze, improve, and control) cycle by providing flexibility in choosing the most appropriate containers for logistics. [ABSTRACT FROM AUTHOR]

High penetration of small-scale distributed energy sources into the distribution network increase negative impacts related to power quality causing adverse conditions. This paper presents a mathematical model that maximizes distribution network hosting capacity through optimal distributed generation capacity allocation and control and grid reconfiguration. In addition to this, the model includes on-load tap changer control for stabilization of grid voltage conditions primarily in grid operating conditions related to voltage rise problems, which can limit grid hosting capacity. Moreover, the objective function allows the possibility of energy transfer between distribution and transmission grids. The proposed model considers alternative grid connection points for distributed generation and determines optimal connection points as well as install capacity while considering network operating limits. The model is cast as a multiperiod second-order cone linear program and involves aspects of active power management. The model is tested on a modified IEEE 33 bus test network. [ABSTRACT FROM AUTHOR]

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP), in which we are looking for an optimal set of delivery or collection routes from a given depot to a number of customers divided into predefined, mutually exclusive, and exhaustive clusters, visiting exactly one customer from each cluster and fulfilling the capacity restrictions. This paper deals with a more generic version of the GVRP, introduced recently and called Selective Vehicle Routing Problem (SVRP). This problem generalizes the GVRP in the sense that the customers are divided into clusters, but they may belong to one or more clusters. The aim of this work is to describe a novel mixed integer programming based mathematical model of the SVRP. To validate the consistency of the novel mathematical model, a comparison between the proposed model and the existing models from literature is performed, on the existing benchmark instances for SVRP and on a set of additional benchmark instances used in the case of GVRP and adapted for SVRP. The proposed model showed better results against the existing models. [ABSTRACT FROM AUTHOR]

The geometric programming problem (GPP) is a beneficial mathematical programming problem for modeling and optimizing nonlinear optimization problems in various engineering fields. The structural configuration of the GPP is quite dynamic and flexible in modeling and fitting the reliability optimization problems efficiently. The work's motivation is to introduce a bounded solution approach for the GPP while considering the variation among the right-hand-side parameters. The bounded solution method uses the two-level mathematical programming problems and obtains the solution of the objective function in a specified interval. The benefit of the bounded solution approach can be realized in that there is no need for sensitivity analyses of the results output. The demonstration of the proposed approach is shown by applying it to the system reliability optimization problem. The specific interval is determined for the objective values and found to be lying in the optimal range. Based on the findings, the concluding remarks are presented. [ABSTRACT FROM AUTHOR]

A method for calibrating models of agricultural production and resource use for policy analysis is proposed to leverage multidisciplinary agricultural research at the National Center for Alluvial Aquifer Research (NCAAR). An illustrative example for Sunflower County, MS, is presented to show how plot-level research can be extended to draw systemic region or basin wide implications. A hypothetical improvement in yields for dryland soybean varieties is incorporated into the model and shown to have a positive impact on aquifer outcomes and producer profits. The example illustrates that a change in one practice-crop combination can have system-wide impacts, as evidenced by the change in acreages for all crops and practices. [ABSTRACT FROM AUTHOR]

Due to globalization and increased market competition, forwarding companies must focus on the optimization of their international transport activities and on cost reduction. The minimization of the amount and cost of fuel results in increased competition and profitability of the companies as well as the reduction of environmental damage. Nowadays, these aspects are particularly important. This research aims to develop a new optimization method for road freight transport costs in order to reduce the fuel costs and determine optimal fueling stations and to calculate the optimal quantity of fuel to refill. The mathematical method developed in this research has two phases. In the first phase the optimal, most cost-effective fuel station is determined based on the potential fuel stations. The specific fuel prices differ per fuel station, and the stations are located at different distances from the main transport way. The method developed in this study supports drivers' decision-making regarding whether to refuel at a farther but cheaper fuel station or at a nearer but more expensive fuel station based on the more economical choice. Thereafter, it is necessary to determine the optimal fuel volume, i.e., the exact volume required including a safe amount to cover stochastic incidents (e.g., road closures). This aspect of the optimization method supports drivers' optimal decision-making regarding optimal fuel stations and how much fuel to obtain in order to reduce the fuel cost. Therefore, the application of this new method instead of the recently applied ad-hoc individual decision-making of the drivers results in significant fuel cost savings. A case study confirmed the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

The generation of energy from renewable sources is a fundamental aspect for the sustainable development of society, and several energy sources such as solar, biomass, biogas, and wind must be used to the maximum to meet existing needs. In Chile, there are villages that are off-grid. A real case study is presented in this research. To meet the needs of this village we have proposed a mathematical optimization model using a CPLEX optimizer to generate the necessary energy power while minimizing the cost of energy (COE). In this study, different scenarios have been evaluated with respect to the existing energy availabilities, for example, in different periods of the year, demonstrated in terms of economic costs, the viability of resources such as biomass and biogas, and the viability of the energy production of wind power given the associated high costs. Finally, the effect of the use of renewable energy in consideration of CO2 emissions is studied in our research. [ABSTRACT FROM AUTHOR]

This study developed models to solve problems of optimisation, production, and consumption in waste management based on methods of system analysis. Mathematical models of the problems of optimisation and sustainable waste management in deterministic conditions and in a fuzzy environment were formulated. The income from production was maximised considering environmental standards that apply to the field of macroeconomics and microeconomics. The proposed approach used MANAGER software to formalise and solve the problem of revenue optimisation with production waste management to optimise the production of oil products with waste management at a specific technological facility of the Atyrau oil refinery in Kazakhstan. Based on the combined application of the principles of maximin and Pareto optimality, a formulation of the problem of production optimisation with waste management was obtained and a heuristic algorithm for solving the formulated fuzzy optimisation problem with waste management was developed. [ABSTRACT FROM AUTHOR]