Heuristic guided simulator for the operational planning of the transport of sugar cane

This paper presents a computational tool for the operational planning of the transportation of sugar cane to mills. A simulation model was developed to serve as a basis for a heuristic which automatically allocates the equipment available at a mill to the different collection points so that the sugar cane available can be loaded for delivery with the minimal amount of equipment. The program is user-friendly, and compatible with Windows. The approach used emphasises the flexibility of the model and the interactiveness possible during the planning process. Successful trial tests with real data are reported.     

Introducing cost-plus-loss analysis into a hierarchical forestry planning environment

Cost-plus-loss analysis of data for forestry planning has often been carried out for highly simplified planning situations. In this study, we suggest an advance in the cost-plus-loss methodology that aims to capture the hierarchical structure and iterative nature of planning by the large forest owner. The simulation system that is developed to simulate the planning process of the forest owner includes the tactical and operational levels of a continuous planning process. The system is characterized by annual re-planning of the tactical plan with a planning horizon of ten year and with the option to reassess data for selected stands before operational planning. Operational planning is done with a planning horizon of two years and the first year of the plan is considered to have been executed before moving the planning process one year forward. The annual cycle is repeated 10 times, simulating decisions made over a ten-year time horizon. The optimizing planning models of the system consider wood flow requirements, available harvest resources, seasonal variation of ground conditions and spatiality. The data used are evaluated according to standard procedures in cost-plus-loss analysis. Results from a test case indicate high decision losses when planning at both levels is based on the type of data prevalent in the stand databases of Swedish companies. The losses can be reduced substantially if higher-quality data are introduced before operational planning. In summary, the results indicate that the method makes it possible to analyze where in the planning process one needs better data and their value.     

A bi-objective hierarchical program scheduling problem and its solution based on NSGA-III

In enterprise project management systems, a program at the tactical level coordinates and manages multiple projects at the operational level. There are close relationships between multiple projects in a program, which are typically manifested as shared resources and precedence relationships. Most research efforts have concentrated on the resource sharing by projects, while the precedence relationships between projects have yet to be comprehensively investigated. In this paper, a bi-objective hierarchical resource-constrained program scheduling problem proposed, where both resource sharing and precedence relationships between projects are considered in a distributed environment. The problem contains two different sub-problems at the operational level and the tactical level, and they are modeled in the same way as two bi-objective multi-mode scheduling problems. Shared resources are allocated from the tactical level to the operational level, and once they are allocated to a project, they can only be re-allocated to other projects once the current project is finished. Subsequently, a two-phase algorithm based on NSGA-III is developed. The algorithm runs at the operational level and the tactical level in turn. According to the Pareto fronts of projects that are submitted from the operational level, the bi-objective program planning at the tactical level is conducted under the constraints of precedence relationships and shared resources. The results of computational simulations demonstrate the satisfactory performance of the improved algorithm. By coordinating the local optimization of projects and the global optimization of the program in a hierarchical framework, the method proposed in this paper provides an effective integrated scheduling method for decision-makers at various levels of a program.

     

A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste

This paper proposes a hybrid approach for solving the multi-objective model related to the minimisation of sugar cane waste collection costs and/or the maximisation of produced energy by this waste, with the aid of strategies for solving multi-objective problems, which transform the problem into a set of single-objective problems. This approach combines the predictor-corrector primal-dual interior-point and branch-and-bound methods in order to solve these single-objective problems. The model consists in identifying the sugar cane varieties with the lowest waste collection costs, while simultaneously it aims to obtain the greatest amount of produced energy by this waste. The hybrid methods are implemented in C++ programming language, and tests are performed to determine the efficient solutions in Pareto optimal sense of the multi-objective model and compare the performance of the hybrid method using the integrality test and without considering it. The mathematical results confirm that the proposed hybrid method for solving the aforementioned models presents good computational performance and reliable solutions.     

A decision support system to manage the supply chain of sugar cane

In this work the authors present a Decision Support System (DSS) for planning daily operations in the sugar cane supply chain. The supply chain model is based on a mixed integer linear programming model. The model objective is to minimize transportation costs while assuring cane supply to the sugar mill. The model determines the fields to harvest, the cutting-loading-transport means for such operation, and the roster for each employee. The DSS has been tested under Cuban conditions but easily can be adapted to different situations updating the parameters of the model. Reported savings represent an 8 % of the fuel cost.     

Sugar cane transportation in Cuba,a case study

In this study the authors present a mixed integer linear programming model to solve the problem of cost minimization of sugar cane removal and its transport from the fields to the sugar mill at operational level. The complexity of the problem is basically determined by the system approach which results in the generation of a great number of variables and constraints that refer to the following operational dimensions: (a) need for continuous supply to the sugar mill; (b) cutting means used in cane harvesting; (c) transportation vehicles and (d) providing routes, which are characterized by the existence of storage facilities at the beginning of the railroads. The results demonstrate the model is not only useful to minimize transportation cost, but also for scheduling daily cane road transport and harvesting quotas of cutting means.     

Forest planning at the tactical level

Forest management and planning can involve large tracts of land involving numerous areal units. One approach to plan activities for a forested region over decades involves breaking down decision making into three components: strategic, tactical, and operational. Each level of the management hierarchy can involve the development and application of optimization models. These models typically aid in exploring management alternatives as well as multi-objective tradeoffs. Even though a strategic model can provide support for long term management at a broad scale, solutions may not be feasible at an operational level. Tactical level modeling helps to bridge solutions reached at a strategic level using operational planning information. This paper presents several tactical level planning models that have been developed as a part of a research effort supported by the US Forest Service. These models have been utilized in land use management and planning by the US Forest Service through a specially developed spatial decision support system.     

An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations

This study develops a mathematical model for helicopter mission planning during a disaster relief operation. The decisions inherent in the problem decompose hierarchically into two sub-problems where tactical decisions are made at the top level, and the operational routing and loading decisions are made at the base level. Consistency between the decomposed problems is achieved with an iterative coordination procedure which transfers anticipated information from the base level to improve the top level decisions. The existence of conflicting multiple objectives in this hierarchical structure requires the development of a multi-criteria analysis, and an interactive procedure is designed with the top level decision-maker to assess the preference of alternative non-dominated solutions.     

Operational Research and Corporate Planning in Railway Management

The current corporate planning process in Westrail is described and the roles played by operational research and mathematical modelling identified. They do not include forecasting the future. Instead of the "predict and prepare paradigm" a planning approach that tries to design the future has been adopted. The organisation is described in terms of how it has evolved, what it now is, and the key features of its environment. The three stages of planning are described-strategic, tactical and operational. These provide the means for management control of the railway. Environmental assessments linked to goal setting activities are incorporated within the planning process. The significance of operational research in planning, in particular mathematical modelling, is also described. Instead of finding problems to which existing techniques can be applied, O.R. is used to provide effective operational and planning systems as a means of assisting management to design the future for the organisation.     

Column generation based heuristic for tactical planning in multi-period vehicle routing

The periodic vehicle routing problem (PVRP) consists in establishing a planning of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. The tactical planning model considered here restricts its attention to scheduling visits and assigning them to vehicles while leaving sequencing decisions for an underlying operational model. The objective is twofold: to optimize regional compactness of the routes in a desire to specialize routes to restricted geographical area and to balance the workload evenly between vehicles. Approximate solutions are constructed using a truncated column generation procedure followed by a rounding heuristic. This mathematical programming based procedure can deal with problems with 50–80 customers over five working days which is the range of size of most PVRP instances treated in the literature with meta-heuristics. The paper highlights the importance of alternative optimization criteria not accounted for in standard operational models and provides insights on the implementation of a column generation based rounding heuristic.     

Planning Activities in a Network of Logistic Platforms with Shared Resources

This paper has been motivated by the study of a real application, the transshipment container terminal of Gioia Tauro in Italy. The activities in a container terminal concern with the movement of containers from/to mother vessels and feeders and with the handling and storage of containers in the yard. For such type of applications both operational (e.g., scheduling) and tactical (e.g., planning) models, currently available in the literature, are not useful in terms of operations management and resources optimization. Indeed, the former models are too detailed for the complexity of the systems, while the latter are not able to capture the operational constraints in representing those activities which limit the nominal capacity. Herein, the container terminal, or more in general a service or production system, is represented as a network of complex substructures or platforms. The idea is to formalize the concept of platform capacity, which is used to represent the operational aspects of the container terminal in a mathematical model for the tactical planning. The problem, which consists in finding an allocation of resources in each platform in order to minimize the total delay on the overall network and on the time horizon, is modelled by a mathematical programming formulation for which we carry out a computational analysis using CPLEX-MIP solver. Moreover, we present a dynamic programming based heuristic to solve larger instances in short computational time. On all but one of the smaller instances, the heuristic solutions are also optimal. On the larger instances, the maximum gap, i.e. the percentage deviation, between the heuristic solutions and the best solutions computed by CPLEX-MIP within the time limit of 3600 s, has been 6.3%.     

A stochastic bi-objective location model for strategic reverse logistics

In this paper we propose a comprehensive model for reverse logistics planning where many real-world features are considered such as the existence of several facility echelons, multiple commodities, choice of technology and stochasticity associated with transportation costs and waste generation. Moreover, we adopt a bi-objective model for the problem. First, the cost for building and operating the network is to be minimized. Second, the obnoxious effect caused by the reverse network facilities is also to be minimized. A two-stage stochastic bi-objective mixed-integer programming formulation is proposed, in which the strategic decisions are considered in the first stage and the tactical/operational decisions in the second one. A set of different scenarios is considered, and the extensive form of the deterministic equivalent problem is presented. This model is tested with a case study based on some data from the Spanish province of Cordoba. Nondominated solutions are obtained by combining the two different objectives and by using a general solver.     

Furniture supply chain tactical planning optimization using a time decomposition approach

We study the supply chain tactical planning problem of an integrated furniture company located in the Province of Québec, Canada. The paper presents a mathematical model for tactical planning of a subset of the supply chain. The decisions concern procurement, inventory, outsourcing and demand allocation policies. The goal is to define manufacturing and logistics policies that will allow the furniture company to have a competitive level of service at minimum cost. We consider planning horizon of 1 year and the time periods are based on weeks. We assume that customer’s demand is known and dynamic over the planning horizon. Supply chain planning is formulated as a large mixed integer programming model. We developed a heuristic using a time decomposition approach in order to obtain good solutions within reasonable time limit for large size problems. Computational results of the heuristic are reported. We also present the quantitative and qualitative results of the application of the mathematical model to a real industrial case.     

Cane Railway Scheduling via Constraint Logic Programming: Labelling Order and Constraints in a Real-Life Application

In Australia, cane transport is the largest unit cost in the manufacturing of raw sugar, making up around 35% of the total manufacturing costs. Producing efficient schedules for the cane railways can result in significant cost savings. This paper presents a study using Constraint Logic Programming (CLP) to solve the cane transport scheduling problem. Tailored heuristic labelling order and constraints strategies are proposed and encouraging results of application to several test problems and one real-life case are presented. The preliminary results demonstrate that CLP can be used as an effective tool for solving the cane transport scheduling problem, with a potential decrease in development costs of the scheduling system. It can also be used as an efficient tool for rescheduling tasks which the existing cane transport scheduling system cannot perform well.     

Operational research in health services planning

Some of the characteristics which distinguish social planning from planning in the private sector, or in publicly owned industry, are identified. A survey of OR investigations (both tactical and strategic) in the area of health services planning supports the case that the mainstream OR contribution does violence to the nature of the system under study. In particular, problems are formulated in terms of (or transformed into) single objectives, to be optimized; aspects of the social world are subject to wholesale quantification, with resulting distortion; models make implausible data demands; project definition and execution reinforce the ‘scientisation’ of political debate; problems are formulated on the assumption of a single hierarchically powerful decision-maker; and problems are formulated as if they must be solved in toto at one point in time. It is suggested that we should look to the converse of these qualities for new directions in the application of operational research in social planning. Some examples are given of techniques and approaches, drawn both from within health services planning and from other areas, which exhibit these alternative characteristics.     

Design of insurance contracts using stochastic programming in forestry planning

This work addresses a tactical planning problem faced by a forestry firm, deciding which timber units to harvest and what roads to build to obtain the greatest possible benefits. We include uncertainty in prices by means of utility theory. This enables solutions to be found that the firm finds preferable to those obtained when risk aversion is ignored and makes it possible to design insurance contracts that benefit the firm while also being attractive to an insurer. Two types of contract are designed; one dependent on the firm’s operating result and the other independent of it. Metrics are then developed to quantify the benefits conferred by a contract, demonstrating that the latter contract type dominates the former. These results are then illustrated by applying them to a simplified planning problem of a forest owned by the Chilean forestry operator Millalemu.     

Tactical Planning for a Cutting Stock System

Wood processing on a centralized conversion site can be considered as a cutting stock problem. The multiperiod optimization of the production system is a very hard problem to solve. A balance has to be made between value recovery optimization and service rate maximization. In this research a decision support system was designed and built to support production planning. Strategic, tactical and operational planning are covered, but here the focus is primarily on tactical planning.     

An integrated optimization model for managing the global value chain of a chemical commodities manufacturer

The realization of supply chain management concepts goes along with the introduction of comprehensive software systems for supporting decisions at the strategic, tactical, and operational planning level. Moreover, in industry the focus has shifted from a pure logistics-oriented view towards the integration of pricing and revenue issues into cross-functional value chain planning models. This paper presents a practical decision support tool for global value chain planning in the production of chemical commodities. The proposed linear optimization model consists of various modules that reflect sales, distribution, production, and procurement activities within a company-internal value chain. The objective of the model is to maximize profit by coordinating all activities within the supply chain. The model formulation is related to a real industry case. It is shown how the model can be used to support decision making from sales to procurement by volume and value.