Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design

Maritime cabotage is a legislation published by a particular coastal country, which is used to conduct the cargo transportation between its two domestic ports. This paper proposes a two-phase mathematical programming model to formulate the liner hub-and-spoke shipping network design problem subject to the maritime cabotage legislations, i.e., the hub location and feeder allocation problem for phase I and the ship route design with ship fleet deployment problem for phase II. The problem in phase I is formulated as a mixed-integer linear programming model. By developing a hub port expanding technique, the problem in phase II is formulated as a vehicle routing problem with pickup and delivery. A Lagrangian relaxation based solution method is proposed to solve it. Numerical implementations based on the Asia–Europe–Oceania shipping services are carried out to account for the impact analysis of the maritime cabotage legislations on liner hub-and-spoke shipping network design problem.     

Integrated design and operation of remnant inventory supply chains under uncertainty

We consider the simultaneous design and operation of remnant inventory supply chains. Remnant inventory is generated when demand for various lengths of a product may be satisfied by existing inventory, or by cutting a large piece into smaller pieces. We formulate our problem as a two-stage stochastic mixed-integer program. In solving our stochastic program, we enhance the standard L-shaped method in two ways. Our computational experiments demonstrate that these enhancements are effective, dramatically reducing the solution time for large instances.     

考虑横纵向一体化的港航联盟的收益模型

随着港航业竞争的加剧,港口间的联盟与合作、港口与航运企业纵向一体化不断发展。尤其是,航运企业以收购或投资模式参与港口间的资源整合,形成了更为复杂的港航混合联盟。针对港口间的资源整合与竞争、航运企业与港口一体化等因素,构建港航混合联盟模式的收益模型,对比分析在区域港口竞争模式和港航混合联盟模式下港口和航运企业的收益变化,揭示地理位置、内陆运输成本、航运企业投资效果等因素的作用。结果表明,港航混合联盟模式能够实现整合港口和航运企业的双赢。同时,当港口与内陆的集疏运基础设施薄弱、航运企业的影响力较大时,非合作港口也会受益,此时港航横纵向混合联盟模式有利于推动整个区域港口经济的发展。     

A Lagrangian heuristic for determining the speed and bunkering port of a ship

This study addresses the problem of determining the ship speed and bunkering ports in a ship route. All of the previous research has investigated the ship speed optimization issues by assuming that the ship navigates at constant speed or by ignoring the bunkering port decision. In this study, the problem of determining the variable speed and bunkering port is formulated mathematically with a nonlinear program in order to minimize the bunker fuel, ship time costs, and carbon tax imposed on greenhouse gas emissions. This study then provides a Lagrangian heuristic by deriving a property for a relaxed problem. The performance of the heuristic is evaluated and analysed using the data obtained from the literature, real practice and random generation.     

Combined Sea and Land Transportation

An important problem today in the field of transportation is the standardization of the cargo, e.g. by using containers, and the design of the handling and transportation equipment for the specific cargo to be transported.The paper presents a method for determining the transportation system with emphasis on sea transport. Thus the cargo is to be transported by sea from the factory to customers spread over a large region, e.g. Europe. The problem is to select the ports of call, the quantities to be delivered at the ports, as well as the size and type of vessel.This problem resembles the warehouse location problem (the location of ports) but requires in addition the determination of ship size, type of ship and whether one or more ports should be called at on each journey with a single ship. A discussion is also presented as to the possibility of considering randomness in the system with respect to customer demand and weather conditions.The method used resembles that suggested by Baumol and Wolfe for the ware-house location problem. A concave function of the quantities delivered at each port is derived and this is then shown to converge to a local optimum.An example is solved to illustrate the method.     

Maritime crude oil transportation - A split pickup and split delivery problem

The maritime oil tanker routing and scheduling problem is known to the literature since before 1950. In the presented problem, oil tankers transport crude oil from supply points to demand locations around the globe. The objective is to find ship routes, load sizes, as well as port arrival and departure times, in a way that minimizes transportation costs. We introduce a path flow model where paths are ship routes. Continuous variables distribute the cargo between the different routes. Multiple products are transported by a heterogeneous fleet of tankers. Pickup and delivery requirements are not paired to cargos beforehand and arbitrary split of amounts is allowed. Small realistic test instances can be solved with route pre-generation for this model. The results indicate possible simplifications and stimulate further research.     

Methods for strategic liner shipping network design

In this paper the combined fleet-design, ship-scheduling and cargo-routing problem with limited availability of ships in liner shipping is considered. A composite solution approach is proposed in which the ports are first aggregated into port clusters to reduce the problem size. When the cargo flows are disaggregated, a feeder service network is introduced to ship the cargo within a port cluster. The solution method is tested on a problem instance containing 58 ports on the Asia–Europe trade lane of Maersk. The best obtained profit gives an improvement of more than 10% compared to the reference network based on the Maersk network.     

考虑横向整合战略的库存路径动态区域定价

库存路径和定价是供货商管理库存(Vendor Management Inventory, VMI)中三个互相制约和影响的决策问题,是降低供货商成本,提高其利润的关键。针对VMI拉式供应链中多供货商、多商品和多区域的库存路径定价问题,提出了对不同区域客户、在不同时段进行商品差异化定价策略,并设计一种共同配送车辆司机成本和燃油成本分摊方案,据此构建基于横向整合战略的库存路径动态区域定价模型。算例结果显示,在横向整合战略下,供货商商品定价会有所降低,配送车辆行驶距离显著缩短,各时段配货量更为均衡,期末库存数量显著降低。研究表明,无论供货商之间供货规模比例差异多大,开展库存路径动态区域定价,供货商联盟成员的利润均能得到显著提高,实现合作共赢的目标。     

Maritime inventory routing with multiple products: A case study from the cement industry

This paper considers a maritime inventory routing problem faced by a major cement producer. A heterogeneous fleet of bulk ships transport multiple non-mixable cement products from producing factories to regional silo stations along the coast of Norway. Inventory constraints are present both at the factories and the silos, and there are upper and lower limits for all inventories. The ship fleet capacity is limited, and in peak periods the demand for cement products at the silos exceeds the fleet capacity. In addition, constraints regarding the capacity of the ships’ cargo holds, the depth of the ports and the fact that different cement products cannot be mixed must be taken into consideration. A construction heuristic embedded in a genetic algorithmic framework is developed. The approach adopted is used to solve real instances of the problem within reasonable solution time and with good quality solutions.     

Alternative algorithms for the optimization of a simulation model of a multimodal container terminal

Multimodal container terminals (MMCTs) are very complex and consequently require synchronization and balancing of container transfers at each node. The problem being investigated is the minimization of ship delays at the port by considering handling and travelling time of containers from the time the ship arrives at port until all the containers from that ship leave the port. When dealing with export containers, the problem would be that of the handling and travelling time of the containers from when they first arrive at the port until the ship carrying the containers departs from the port. Owing to the dynamic nature of the environment, a large number of timely decisions have been reviewed in accordance with the changing conditions of the MMCTs. The model has been run and tested with a small-size problem using CPLEX. A more realistic model is extremely difficult to solve and is in fact proven to be computationally intractable (NP-hard). Metaheuristics have been developed to deal with the intractability so that near-optimal solutions could be obtained in reasonable time.     

Stowage planning in maritime container transportation

We consider a stowage-planning problem of arranging containers on a container ship in the maritime transportation system. Since containers are accessible only from the top of the stack, temporary unloading and reloading of containers, called shifting, is unavoidable if a container required to be unloaded at the current port is stacked under containers to be unloaded at later ports on the route of the ship. The objective of the stowage planning problem is to minimize the time required for shifting and crane movements on a tour of a container ship while maintaining the stability of the ship. For the problem, we develop a heuristic solution method in which the problem is divided into two subproblems, one for assigning container groups into the holds and one for determining a loading pattern of containers assigned to each hold. The former subproblem is solved by a greedy heuristic based on the transportation simplex method, while the latter is solved by a tree search method. These two subproblems are solved iteratively using information obtained from solutions of each other. To see the performance of the suggested algorithm, computational tests are performed on problem instances generated based on information obtained from an ocean container liner. Results show that the suggested algorithm works better than existing algorithms.     

Interactive fuzzy goal programming for a multi-objective closed-loop logistics network

Over the last decade, there has been increased attention to closed-loop logistics networks. Environmental legislation requires companies to be more responsible by collecting used products from customers. Companies can also benefit from savings that are related to recovering and recycling used products. Unlike previous studies, which only consider single products or a single period of time in multi-objective problems, this paper considers a multi-product multi-period closed-loop logistics network with different types of facilities. A?multi-objective mixed-integer nonlinear programming formulation is developed to minimize the total cost, the delivery time of new products, and the collection time of used products. Thus, this model better approximates real-life applications of closed-loop logistics problems. Interactive fuzzy goal programming (IFGP) is applied to solve the model for handling multiple objective problems with conflicting objectives and to address the imprecise nature of decision-makers?? aspiration levels for goals. The results from computational experiments performed here show that by changing the upper or lower bound of each objective function, one can obtain a better final solution of the problem and also can provide more options for decision makers to choose from based on their situation. Finally, the utilization rate of facilities is shown to be an important indicator when designing a logistics network.     

Supply chain models for an assembly system with preprocessing of raw materials

In this paper, we investigate the material procurement and delivery policy in a production system where raw materials enter into the assembly line from two different flow channels. The system encompasses batch production process in which the finished product demand is approximately constant for an infinite planning horizon. Two distinct types of raw materials are passed through the assembly line before to convert them into the finished product. Of the two types of raw materials, one type requires preprocessing inside the facility before the assembly operation and other group is fed straightway in the assembly line. The conversion factors are assigned to raw materials to quantify the raw material batch size required. To analyze such a system, we formulate a nonlinear cost function to aggregate all the costs of the inventories, ordering, shipping and deliveries. An algorithm using the branch and bound concept is provided to find the best integer values of the optimal solutions. The result shows that the optimal procurement and delivery policy minimizes the expected total cost of the model. Using a test problem, the inventory requirements at each stage of production and their corresponding costs are calculated. From the analysis, it is shown that the rate and direction change of total cost is turned to positive when delivery rates per batch reaches close to the optimal value and the minimum cost is achieved at the optimal delivery rate. Also, it is shown that total incremental cost is monotonically increasing, if the finished product batch size is increased, and if, inventory cost rates are increased. We examine a set of numerical examples that reveal the insights into the procurement-delivery policy and the performance of such an assembly type inventory model.     

Managing variances in manufacturing system design

The goal of this paper is to investigate how uncertainties in demand and production should be incorporated into manufacturing system design problems. We examine two problems in manufacturing system design: the resource allocation problem and the product grouping problem. In the resource allocation problem, we consider the issue of how to cope with uncertainties when we utilize two types of resources: actual processing capacity and stored capacity (inventory). A closed form solution of the optimal allocation scheme for each type of capacity is developed, and its performance is compared to that of the conventional scheme where capacity allocation and inventory control decisions are made sequentially. In the product grouping problem, we consider the issue of how we design production lines when each line is dedicated to a certain set of products. We formulate a mathematical program in which we simultaneously determine the number of production lines and the composition of each line. Two heuristics are developed for the problem.     

Newsvendor with multiple options of expediting

We consider a manufacturer facing single period inventory planning problem with uncertain demand and multiple options of expediting. The demand comes at a certain time in the future. The manufacturer may order the product in advance with a relatively low cost. She can order additional amount by expediting after the demand is realized. There are a number of expediting options, each of which corresponds to a certain delivery lead time and a unit procurement price. The unit procurement price is decreasing over delivery lead time. The selling price is also decreasing over time. In this paper, we assume that the manufacturer must deliver all products to the customer in a single shipment. The problem can be formulated as a profit maximization problem. We develop structural properties and show how the optimal solution can be identified efficiently. In addition, we compare our model with the classical newsvendor model and obtain a number of managerial insights.     

Multi-level,single-machine lot sizing and scheduling (with initial inventory)

This paper presents a mixed-integer program for the dynamic lot sizing and scheduling problem in a multi-level, single-machine environment. It turns out that in contrast to single-level problems the integration of initial inventory is a crucial aspect if generality should not be lost. It is shown how problem instances can efficiently be solved to suboptimality by using a so-called randomized regret based heuristic.     

A multi-period ordering and clearance pricing model considering the competition between new and out-of-season products

The joint management of pricing and inventory for perishable products has become an important problem for retailers. This paper investigates a multi-period ordering and clearance pricing model under consideration of the competition between new and out-of-season products. In each period, the ordering quantity of the new product and the clearance price of the out-of-season product are determined as decision variables before the demand is realized, and the unsold new product becomes the out-of-season one of the next period. We establish a finite-horizon Markov decision process model to formulate this problem and analyze its properties. A traditional dynamic program (DP) approach with two-dimensional search is provided. In addition, a myopic policy is derived in which only the profit of the current period is considered. Finally, we apply genetic algorithm (GA) to this problem and design a GA-based heuristic approach, showing by comparison among different algorithms that the GA-based heuristic approach is more performance sound than the myopic policy and much less time consuming than the DP approach.     

A mixed integer and multiple objective programming model to analyze coal handling in New England

Mandated electric generation coal conversions in New England could place a severe strain on the coal handling and transportation facilities in New England ports. This paper presents an analytical scheme leading to the development of optimal plans for the reuse and redevelopment of marine transport networks in New England. Utilizing the port inventory that provides information on existing coal handling facilities and the capability of the ports to increase capacity of existing facilities or locating new facilities, a mathematical programming model is used to determine the optimal capacity, placement and railrod and marine interface of coal handling facilities within and between the New England ports and converting power plants.Initially a mixed integer programming model with a least cost objective is formulated. It is then expanded to a multiobjective programming problem in order to provide information to the port planners and decision makers on the tradeoffs between the costs and temporal efficiency of coal transporation and handling for various locational configurations.     

考虑缺货的闭环供应链选址-库存-路径集成优化

再制造是企业实现环境友好、提升经济效益的重要策略之一;再制造的发展推动了新商业模式的出现,即产品服务系统;高效的再制造物流网络对于成功实施再制造十分重要。本文研究了基于产品服务系统下的再制造物流网络集成优化问题,即闭环供应链的选址-库存-路径的集成优化决策问题,且在库存策略中允许库存出现缺货的情况;论文基于产品服务系统模式构建了混合非线性规划模型来最小化生产、选址、配送、库存以及缺货成本,并采用了改进的禁忌搜索算法进行求解。通过与传统禁忌搜索算法的计算结果进行对比,表明本文中的算法能在可接受的时间内得到较优解。通过算例的敏感性分析得出,企业所服务的顾客如果接受再制造产品,提高回收率可以节约成本;在回收率一定时,客户在缺货情形下的制造和再制造批量比不允许缺货时要大,企业总成本比不允许缺货时要小。