Network Design for Shipping Service of Large-Scale Intermodal Liners

2012 ◽  
Vol 2269 (1) ◽  
pp. 42-50 ◽  
Author(s):  
Qiang Meng ◽  
Shuaian Wang ◽  
Zhiyuan Liu
Keyword(s):  
Network Design ◽  
Large Scale ◽  
Programming Model ◽  
Transportation Network ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Mixed Integer ◽  
Hub And Spoke ◽  
Shipping Company ◽  
Proposed Model

A model was developed for network design of a shipping service for large-scale intermodal liners that captured essential practical issues, including consistency with current services, slot purchasing, inland and maritime transportation, multiple-type containers, and origin-to-destination transit time. The model used a liner shipping hub-and-spoke network to facilitate laden container routing from one port to another. Laden container routing in the inland transportation network was combined with the maritime network by defining a set of candidate export and import ports. Empty container flow is described on the basis of path flow and leg flow in the inland and maritime networks, respectively. The problem of network design for shipping service of an intermodal liner was formulated as a mixed-integer linear programming model. The proposed model was used to design the shipping services for a global liner shipping company.

scholarly journals A Refueling Scheme Optimization Model for the Voyage Charter with Fuel Price Fluctuation and Ship Deployment Consideration

2017 ◽  
Vol 5 (3) ◽  
pp. 267-278 ◽  
Author(s):  
Peng Jia ◽  
Weilun Zhang ◽  
E Wenhao ◽  
Xueshan Sun
Keyword(s):  
Programming Model ◽  
Optimal Solution ◽  
Arma Model ◽  
Maritime Transportation ◽  
Mixed Integer ◽  
Fuel Price ◽  
Shipping Company ◽  
Significant Difference ◽  
Nonlinear Programming Model ◽  
Operation Cycle

Abstract Due to the long operation cycle of maritime transportation and frequent fluctuations of the bunker fuel price, the refueling expenditure of a chartered ship at different time or ports of call make significant difference. From the perspective of shipping company, an optimal set of refueling schemes for a ship fleet operating on different voyage charter routes is an important decision. To address this issue, this paper presents an approach to optimize the refueling scheme and the ship deployment simultaneously with considering the trend of fuel price fluctuations. Firstly, an ARMA model is applied to forecast a time serials of the fuel prices. Then a mixed-integer nonlinear programming model is proposed to maximize total operating profit of the shipping company. Finally, a case study on a charter company with three bulk carriers and three voyage charter routes is conducted. The results show that the optimal solution saves the cost of 437,900 USD compared with the traditional refueling scheme, and verify the rationality and validity of the model.

scholarly journals Mathematical Analysis and an Exact Solution Combined with Preprocessing Method for Resynchronizing of Bus Timetable Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-10
Author(s):  
Yinghui Wu ◽  
Yifan Zhu ◽  
Tianyu Cao
Keyword(s):  
Large Scale ◽  
Programming Model ◽  
Solution Space ◽  
Mixed Integer ◽  
Preprocessing Method ◽  
Proposed Model ◽  
Long Time ◽  
Bus Networks ◽  
Transfer Stations ◽  
Timetable Problem

Bus timetabling is a subproblem of bus network planning, and it determines departure time of each trip of lines to make vehicles from different lines synchronously arrive at transfer stations. Due to the well-designed coordination of bus timetables, passengers can make a smooth transfer without waiting a long time for connecting buses. This paper addresses the planning level of resynchronizing of bus timetable problem allowing modifications to initial timetable. Timetable modifications consist of shifts in the departure times and headways. A single-objective mixed-integer programming model is proposed for this problem to maximize the number of total transferring passengers benefiting from smooth transfers. We analyze the mathematical properties of this model, and then a preprocessing method is designed to reduce the solution space of the proposed model. The numerical results show that the reduced model is effectively solved by branch and bound algorithm, and the preprocessing method has the potential to be applied for large-scale bus networks.

scholarly journals Charging Network Planning for Electric Bus Cities: A Case Study of Shenzhen, China

2019 ◽  
Vol 11 (17) ◽  
pp. 4713 ◽  
Author(s):  
Yuping Lin ◽  
Kai Zhang ◽  
Zuo-Jun Max Shen ◽  
Lixin Miao
Keyword(s):  
Large Scale ◽  
Programming Model ◽  
Cost Minimization ◽  
Transportation Network ◽  
Power Grid ◽  
Mixed Integer ◽  
Charging Infrastructure ◽  
Second Order Cone ◽  
Charging Stations

In 2017, Shenzhen replaced all its buses with battery e-buses (electric buses) and has become the first all-e-bus city in the world. Systematic planning of the supporting charging infrastructure for the electrified bus transportation system is required. Considering the number of city e-buses and the land scarcity, large-scale bus charging stations were preferred and adopted by the city. Compared with other EVs (electric vehicles), e-buses have operational tasks and different charging behavior. Since large-scale electricity-consuming stations will result in an intense burden on the power grid, it is necessary to consider both the transportation network and the power grid when planning the charging infrastructure. A cost-minimization model to jointly determine the deployment of bus charging stations and a grid connection scheme was put forward, which is essentially a three-fold assignment model. The problem was formulated as a mixed-integer second-order cone programming model, and a “No R” algorithm was proposed to improve the computational speed further. Computational studies, including a case study of Shenzhen, were implemented and the impacts of EV technology advancements on the cost and the infrastructure layout were also investigated.

Identifying Critical Links in Transportation Network Design Problems for Maximizing Network Accessibility

2020 ◽  
Vol 2674 (2) ◽  
pp. 237-251
Author(s):  
Yufeng Zhang ◽  
Alireza Khani
Keyword(s):  
Network Design ◽  
Large Scale ◽  
Programming Model ◽  
Transportation Network ◽  
Time Budget ◽  
Relaxation Method ◽  
Design Problems ◽  
Network Design Problems ◽  
Critical Links ◽  
Travel Time Budget

A significant amount of research has been performed on network accessibility evaluation, but studies on incorporating accessibility maximization into network design problems have been relatively scarce. This study aimed to bridge the gap by proposing an integer programming model that explicitly maximizes the number of accessible opportunities within a given travel time budget. We adopted the Lagrangian relaxation method for decomposing the main problem into three subproblems that can be solved more efficiently using dynamic programming. The proposed method was applied to several case studies, which identified critical links for maximizing network accessibility with limited construction budget, and also illustrated the accuracy and efficiency of the algorithm. This method is promisingly scalable as a solution algorithm for large-scale accessibility-oriented network design problems.

scholarly journals A Branch-and-Price Algorithm for the Liner Shipping Network Design Problem

2020 ◽  
Vol 1 (4) ◽  
Author(s):  
Kristian Thun ◽  
Henrik Andersson ◽  
Magnus Stålhane
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Computational Study ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Specific Class ◽  
Branch And Price ◽  
Price Algorithm

AbstractMaritime transportation is the backbone of the global economy and one of its most important segments is liner shipping. To design a liner shipping network is notoriously difficult but also very important since an efficient network can be the difference between prosperity and bankruptcy. In this paper, we propose a branch-and-price algorithm for the liner shipping network design problem, which is the problem of designing a set of cyclic services and to deploy a specific class of vessels to each service so that all demand can flow through the network at minimal cost. The proposed model can create services with a complex structure and correctly calculate the transshipment cost. The formulation of the master problem strengthens a known formulation with valid inequalities. Because of multiple dependencies between ports that are not necessarily adjacent and no defining state at any of the ports, the subproblem is formulated and solved as a mixed integer linear program. Strategies to improve the solution time of the subproblem are proposed. The computational study shows that the algorithm provides significantly tighter lower bounds in the root node than existing methods on a set of small instances.

scholarly journals Container Slot Co-Allocation Planning with Joint Fleet Agreement in a Round Voyage for Liner Shipping

2013 ◽  
Vol 66 (4) ◽  
pp. 589-603 ◽  
Author(s):  
Jihong Chen ◽  
Shmuel Yahalom
Keyword(s):  
Large Scale ◽  
Economies Of Scale ◽  
Programming Model ◽  
Liner Shipping ◽  
Shipping Industry ◽  
Round Trip ◽  
Factors Affecting ◽  
Proposed Model ◽  
Allocation Planning

In the liner shipping market carriers share container slots to offer better service and realize economies of scale. This paper studies slot co-allocation planning for a joint fleet in a round trip for a shipping alliance in the liner shipping industry. In particular, a conceptual model is developed based on joint fleet and slot co-allocation management. The factors affecting slot co-allocation planning are explored in detail. A large-scale integer programming model is formulated to guide carriers in an alliance in pursuing an optimal slot co-allocation strategy. In contrast to the existing research, this approach leads to a more accurate representation of the situation for cooperative services in the liner shipping market. Extensive numerical experiments based on a true Asia-Europe cooperative route of COSCO and HANJIN show that the proposed model can be efficiently solved by LINGO11.0 for the case study. The computational results suggest that the mechanism and model can be used to benefit carriers in making better decisions in shipping cooperation services.

scholarly journals Transportation Network Design considering Morning and Evening Peak-Hour Demands

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Hua Wang ◽  
Gui-Yuan Xiao ◽  
Li-Ye Zhang ◽  
Yangbeibei Ji
Keyword(s):  
Network Design ◽  
Programming Model ◽  
Transportation Network ◽  
User Equilibrium ◽  
Network Design Problem ◽  
Mixed Integer ◽  
Network Efficiency ◽  
Demand Distribution ◽  
Traffic Characteristics ◽  
Evening Peak

Previous studies of transportation network design problem (NDP) always consider one peak-hour origin-destination (O-D) demand distribution. However, the NDP based on one peak-hour O-D demand matrix might be unable to model the real traffic patterns due to diverse traffic characteristics in the morning and evening peaks and impacts of network structure and link sensitivity. This paper proposes an NDP model simultaneously considering both morning and evening peak-hour demands. The NDP problem is formulated as a bilevel programming model, where the upper level is to minimize the weighted sum of total travel time for network users travelling in both morning and evening commute peaks, and the lower level is to characterize user equilibrium choice behaviors of the travelers in two peaks. The proposed NDP model is transformed into an equivalent mixed integer linear programming (MILP), which can be efficiently solved by optimization solvers. Numerical examples are finally performed to demonstrate the effectiveness of the developed model. It is shown that the proposed NDP model has more promising design effect of improving network efficiency than the traditional NDP model considering one peak-hour demand and avoids the misleading selection of improved links.

scholarly journals Hierarchical hub location model and hybrid algorithm for integration of urban and rural public transport

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877326 ◽  
Author(s):  
Wei Zhong ◽  
Zhicai Juan ◽  
Fang Zong ◽  
Huishuang Su
Keyword(s):  
Public Transport ◽  
Rural Areas ◽  
Programming Model ◽  
Transportation Network ◽  
Transportation Cost ◽  
Capacity Constraint ◽  
Mixed Integer ◽  
Hub Location ◽  
Hub And Spoke ◽  
Total Cost

Integration of urban and rural infrastructure is critical to integrating urban and rural public transport. A public transport hub is an important element of infrastructure, and it is the key facilities that serve as transferring points between cities and towns. The location of hub is related to the convenience of travel for urban and rural residents and the closeness of economic interactions between urban and rural areas. In this article, considering the background of the integration of urban and rural public transport, from the perspective of public transport hubs in urban and central town, a multi-level hub-and-spoke network is designed, and the location of integration of urban and rural public transport hub is determined. Based on the connection associated with central towns and the capacity constraints of hubs and to achieve the minimum total cost, this article proposes a mixed-integer programming model that employs a genetic and tabu search hybrid optimization algorithm to validate and analyze, which used the urban and rural public transport data from a specified area of Shandong province in China. The results indicate that the model can simultaneously determine locations for hubs in cities and central towns while minimizing total cost. The hub capacity constraint significantly influences the location of two-level hubs. The hub capacity constraint in the model can reduce the transportation cost for an entire network and optimize the transportation network. This study on urban and rural public transport hub location in a hub-and-spoke network not only reduces the transportation cost of the network but also completes and supplements the location theory of integration of urban and rural public transport.

scholarly journals A stochastic location and allocation model for critical items to response large-scale emergencies: A case of Turkey

2016 ◽  
Vol 7 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Erkan Celik ◽  
Nezir Aydin ◽  
Alev Taskin Gumus
Keyword(s):  
Large Scale ◽  
Programming Model ◽  
Mixed Integer ◽  
Distribution Centers ◽  
Allocation Model ◽  
Proposed Model ◽  
Stochastic Mixed Integer Programming ◽  
Stochastic Location ◽  
Relief Organizations

This paper aims to decide on the number of facilities and their locations, procurement for pre and post-disaster, and allocation to mitigate the effects of large-scale emergencies. A two-stage stochastic mixed integer programming model is proposed that combines facility location- prepositioning, decisions on pre-stocking levels for emergency supplies, and allocation of located distribution centers (DCs) to affected locations and distribution of those supplies to several demand locations after large-scale emergencies with uncertainty in demand. Also, the use of the model is demonstrated through a case study for prepositioning of supplies in probable large-scale emergencies in the eastern and southeastern Anatolian sides of Turkey. The results provide a framework for relief organizations to determine the location and number of DCs in different settings, by using the proposed model considering the main parameters, as; capacity of facilities, probability of being affected for each demand points, severity of events, maximum distance between a demand point and distribution center. 

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

Sign in / Sign up

Export Citation Format

Share Document