A general endogenous grid method for multi-dimensional models with non-convexities and constraints

The endogenous grid method (EGM) significantly speeds up the solution of stochastic dynamic programming problems by simplifying or completely eliminating root-finding. We propose a general and parsimonious EGM extended to handle (1) multiple continuous states and choices, (2) multiple occasionally binding constraints, and (3) non-convexities such as discrete choices. Our method enjoys the speed gains of the original one-dimensional EGM, while avoiding expensive interpolation on multi-dimensional irregular endogenous grids. We explicitly define a broad class of models for which our solution method is applicable, and illustrate its speed and accuracy using a consumption–saving model with both liquid assets and illiquid pension assets and a discrete retirement choice.     

Monitoring as a partially observable decision problem

Monitoring is an important and costly activity in resource management problems such as containing invasive species, protecting endangered species, preventing soil erosion, and regulating contracts for environmental services. Recent studies have viewed optimal monitoring as a Partially Observable Markov Decision Process (POMDP), which provides a framework for sequential decision making under stochastic resource dynamics and uncertainty about the resource state. We present an overview of the POMDP framework and its applications to resource monitoring. We discuss the concept of the information content provided by monitoring systems and illustrate how information content affects optimal monitoring strategies. Finally, we demonstrate how the timing of monitoring in relation to resource treatment and transition can have substantial effects on optimal monitoring strategies.     

Sustainable hub location under mixed uncertainty

This paper addresses a novel sustainable hub location problem (SHLP) in which two new environmental-based cost functions accounting for air and noise pollution of vehicles are incorporated. To cope with uncertain data incorporated in the model, a mixed possibilistic–stochastic programming approach is proposed to construct the crisp counterpart. A simulated annealing (SA) and an imperialist competitive algorithm (ICA) with a new solution representation are developed to solve real-sized instances whose performances are compared with a proposed lower bound. Finally, some computational experiments are provided to demonstrate the effectiveness of the proposed model and solution approaches.     

Maximizing benefits in project selection: a hybrid approach

Charitable foundations and government programmes should endeavour to allocate their limited resources to best serve their constituents. Yet, mathematical programming techniques are rarely used despite overwhelming evidence of their superiority in selecting projects that yield higher levels of total benefits. We present a novel ‘hybrid selection model’ that combines binary linear programming and heuristic rank-based models applied to two case studies. The first case focuses on providing services to women and shows a hybrid model would have selected the top three ‘signature’ projects and maintained an above-average overall project benefit while securing a 180% improvement in the number of projects funded, a 66% improvement in the number of women served and a 132% improvement in the total benefit achieved. In the second case, we apply the hybrid approach to data from the US government’s largest forest preservation programme and demonstrate that the hybrid approach could allow the programme to select up to 11 top-scoring projects while still achieving a 97% gain in the total overall benefit compared to their traditional method. These case studies show that the hybrid approach has the potential to be applied in a variety of settings and improve how foundations and programmes achieve their goals.     

The generalized lock scheduling problem: An exact approach

The present paper introduces an integrated approach to solving the generalized lock scheduling problem. Three interrelated sub problems can be discerned: ship placement, chamber assignment and lockage operation scheduling. In their turn, these are closely related to the 2D bin packing problem, the assignment problem and the (parallel) machine scheduling problem respectively. In previous research, the three sub problems mentioned were considered separately, often using (heuristic) interaction between them to obtain better solutions. A mixed integer linear programming model is presented and applied to instances from both inland locks and locks in a tide independent port. The experiments show that small instances incorporating a wide range of real-life constraints can be solved to optimality.     

Locating a Biorefinery in Northern Spain: Decision Making and Economic Consequences

Biofuels are emerging as a prominent renewable and sustainable energy sources in developed countries. In this sense, this paper presents a case study in which a biorefinery has to be sited in Northern Spain. Thus, the strategic decision of locating such a facility is deeply investigated through strategic policy evaluation. Then, tactical decisions ranging from purchasing and transportation policies to storage protocols are carried out. Only local and limited biomass can be harvested for supplying the biorefinery through a heterogeneous vehicle fleet. Moreover two different and mutually exclusive storage strategies are evaluated: direct supply from crops to biorefinery and using intermediate-collectors. Additionally, crop exploitation factors and biorefinery sizes are used to generate several scenarios in which the strategic decision of location as well as all the tactic decisions are made. Some mixed integer linear programming models are proposed to figure out all relevant decision problems.The results suggest that the Northwest study area as the best option to locate the biorefinery and recommend the intermediate-collector storage strategy. Moreover, the key information about critical biomass, crops and times are also provided.     

Airline new route selection using compromise programming - The case of Taiwan-Europe

The decision to launch a new route has a huge effect on the outcomes of airlines in the market. In order to find potential destinations for airlines, this paper utilizes a compromise programming method for selecting direct flight routes. The selection framework comprises two objective functions, with one maximizing total revenue and the other minimizing total cost. A case studying Taiwan-European region destinations is interpreted in the analysis. The results indicate that four potential routes, including Madrid, Milan, Munich and Zurich should be added to the airlines’ service destinations. Therefore, this research suggested that the airport authority could apply incentives scheme to attract carriers to open new routes and add flight frequencies to strengthen its competitiveness.     

Pareto efficient allocation of an in-motion wireless charging infrastructure for electric vehicles in a multipath network

Electric vehicles (EV) use an eco-friendly technology that limits the greenhouse gas emissions of the transport sector, but the limited battery capacity and the density of the battery are the major barriers to the widespread adoption of EV. To mitigate this, a good method seems to be the innovative wireless charging technology called ‘On-Line EV (OLEV)’, which is a contactless electric power transfer technology. This EV technology has the potential to charge the vehicle’s battery dynamically while the vehicle is in motion. This system helps to reduce not only the size of the battery but also its cost, and it also contributes to extending the driving range before the EV has to stop. The high cost of this technology requires an optimal location of the infrastructure along the route. For this reason, the objective of this paper is to study the problem of the location of the wireless charging infrastructure in a transport network composed of multiple routes between the origin and the destination. To find a strategic solution to this problem, we first and foremost propose a nonlinear integer programming solution to reach a compromise between the cost of the battery, which is related to its capacity, and the cost of installing the power transmitters, while maintaining the quality of the vehicle’s routing. Second, we adapt the multi-objective particle swarm optimization (MPSO) approach to our problem, as the particles were robust in solving nonlinear optimization problems. Since we have a multi-objective problem with two binary variables, we combine the binary and discrete versions of the particle swarm optimization approach with the multi-objective one. The port of Le Havre is presented as a case study to illustrate the proposed methodology. The results are analyzed and discussed in order to point out the efficiency of our resolution method.     

数控仿真软件在数控教学中的应用——以车削零件加工为例

为了提高《数控机床与编程》课程的教学质量,把数控仿真软件应用引入到课堂教学,并结合车削零件加工,展示数控仿真软件整体加工过程,结果极大提高学生课堂的兴趣,提高了教学效果,也提高学生的数控编程能力和数控机床操作能力,保证了教学质量。     

A fuzzy goal programming approach to analyse sustainable development goals of India

Energy policy, environmental planning and economic development play a key role in sustainable development. Sustainable development requires suitable and strategic policies satisfying multiple and conflicting objectives. Fuzzy goal programming (FGP) is a well-known approach in multi-criteria decision-making for its practical application. In this article, a FGP approach is proposed to analyse environmental, energy and sustainability goals of India by the year 2030 with reference to the key economic sectors of India. The presented model analyses the improvement opportunities, requirement of efforts and implementation of the sustainable development plans. Numerical illustration is also provided for validation and application of the proposed model.