Mathematical properties and constraints representation for bottom-up approaches to the evaluation of GHG mitigation policies

Bottom-up models, including MARKAL, MESSAGE and AIM, are widely used when analyzing the effect of greenhouse gas (GHG) abatement policies. These bottom-up models are mostly formulated as a linear programming (LP) optimization model to find both the minimal cost combination of abatement technologies and energy flows while satisfying demands. It is not unusual that the bottom-up modeling involves a great number of technical, industrial, socioeconomic and environmental constraints. Investigating representative constraints needed for analyzing GHG abatement policies, this study proposes how to implement these constraints in bottom-up modeling.     

An epsilon-optimal algorithm considering greenhouse gas emissions for the management of a ship’s bunker fuel

This paper provides an algorithm to minimize the fixed ordering, purchase, and inventory-carrying costs associated with bunker fuel together with ship time costs; and environmental costs associated with greenhouse gas emissions. It determines the optimum ship speed, bunkering ports, and amounts of bunker fuel for a given ship’s route. To solve the problem, we use an epsilon-optimal algorithm by deriving a property. The algorithm is illustrated by applying it to typical sample data obtained and the effects of bunker prices, carbon taxes, and ship time costs on the ship speed are analyzed. The results indicate that the ship speed and CO₂ emissions are highly sensitive to the factors considered.     

Carsharing’s life-cycle impacts on energy use and greenhouse gas emissions

This paper examines the life-cycle inventory impacts on energy use and greenhouse gas (GHG) emissions as a result of candidate travelers adopting carsharing in US settings. Here, households residing in relatively dense urban neighborhoods with good access to transit and traveling relatively few miles in private vehicles (roughly 10% of the U.S. population) are considered candidates for carsharing. This analysis recognizes cradle-to-grave impacts of carsharing on vehicle ownership levels, travel distances, fleet fuel economy (partly due to faster turnover), parking demand (and associated infrastructure), and alternative modes. Results suggest that current carsharing members reduce their average individual transportation energy use and GHG emissions by approximately 51% upon joining a carsharing organization. Collectively, these individual-level effects translate to roughly 5% savings in all household transport-related energy use and GHG emissions in the U.S. These energy and emissions savings can be primarily attributed to mode shifts and avoided travel, followed by savings in parking infrastructure demands and fuel consumption. When indirect rebound effects are accounted for (assuming travel-cost savings is then spent on other goods and services), net savings are expected to be 3% across all U.S. households.     

The Pollution-Routing Problem

The amount of pollution emitted by a vehicle depends on its load and speed, among other factors. This paper presents the Pollution-Routing Problem (PRP), an extension of the classical Vehicle Routing Problem (VRP) with a broader and more comprehensive objective function that accounts not just for the travel distance, but also for the amount of greenhouse emissions, fuel, travel times and their costs. Mathematical models are described for the PRP with or without time windows and computational experiments are performed on realistic instances. The paper sheds light on the tradeoffs between various parameters such as vehicle load, speed and total cost, and offers insight on economies of ‘environmental-friendly’ vehicle routing. The results suggest that, contrary to the VRP, the PRP is significantly more difficult to solve to optimality but has the potential of yielding savings in total cost.     

Closed-loop Inventory Routing Problem for returnable transport items

Increasing concerns on supply chain sustainability have given birth to the concept of closed-loop supply chain. Closed-loop supply chains include the return processes besides forward flows to recover the value from the customers or end-users. Vendor Managed Inventory (VMI) systems ensure collaborative relationships between a vendor and a set of customers. In such systems, the vendor takes on the responsibility of product deliveries and inventory management at customers. Product deliveries also include reverse flows of returnable transport items. The execution of the VMI policy requires vendor to deal with a Closed-loop Inventory Routing Problem (CIRP) consisting of its own forward and backward routing decisions, and inventory decisions of customers. In CIRP literature, traditional assumptions of disregarding reverse logistic operations, knowing beforehand distribution costs between nodes and customers demand, and managing single product restrict the usage of the proposed models in current food logistics systems. From this point of view, the aim of this research is to enhance the traditional models for the CIRP to make them more useful for the decision makers in closed-loop supply chains. Therefore, we propose a probabilistic mixed-integer linear programming model for the CIRP that accounts for forward and reverse logistics operations, explicit fuel consumption, demand uncertainty and multiple products. A case study on the distribution operations of a soft drink company shows the applicability of the model to a real-life problem. The results suggest that the proposed model can achieve significant savings in total cost and thus offers better support to decision makers.     

A ‘Less-flexibility-first’ Heuristic for the Placement of Inland Vessels in a Lock

Abstract

Inland vessels move goods along waterways (canals and rivers) and they visit ports. Because of their tidal nature, vessels make use of locks to enter ports or waterways. From a port management point of view, fast access to and from the port and high utilization of locks are important objectives. Where the former relates to low inbound and outbound waiting times, the latter relates to the placement of as many vessels as possible in the lock before its operation. This article includes a case study that relates to the operation of the Van Cauwelaert lock in the port of Antwerp, Belgium. Lock operation policy is as follows: vessels wait in front of the lock for a port administrator to assign places in the lock based on knowledge of the vessels’ dimensions. As such, there is no FIFO-discipline, but a ‘group-FIFO’-discipline, i.e. if n vessels are allowed into the lock, they are the first n vessels in the arrival queue. A heuristic algorithm is formulated for the placement of vessels in the lock. This algorithm supports the decision where to place the vessel in the lock, aiming to place as many vessels as possible from the arrival queue. At the same time, it supports the decision to start a locking operation or not, based on information about vessels that are announced but which have not yet arrived at the lock's entrance. The heuristic is called a ‘less-flexibility-first’-heuristic as it looks for pseudo-placements, showing which flexibility is left for the remaining vessels after placing a vessel. This article describes the implementation of the heuristic and provides numerical examples. A comparison is made between the heuristic results and daily practice, based on real-life vessel movements through the Van Cauwelaert lock in 2002.     

Estimating the environmental costs of port related emissions: The case of Kaohsiung

This study estimates the emission costs of ships and trucks in the Port of Kaohsiung, Taiwan, focusing mainly on particular matter and volatile organic compounds. By calculating annual ship and truck emissions we find that the major contributors are tankers, container ships and bulk ships and trucks. Using a bottom-up methodology, the combined environmental costs of ships and trucks are estimated to be over $123 million per year.