DESIGNING CONTAINER SHIPPING NETWORK UNDER CHANGING DEMAND AND FREIGHT RATES

Transport ◽  
2010 ◽  
Vol 25 (1) ◽  
pp. 56-57 ◽  
Author(s):  
Chao Chen ◽  
Qingcheng Zeng
Keyword(s):  
Mixed Integer ◽  
Container Shipping ◽  
Suggested Model ◽  
Analytical Methodology ◽  
Non Linear Programming ◽  
Freight Rates ◽  
Proposed Model ◽  
Empty Container Repositioning ◽  
Average Unit ◽  
Three Stages

This paper focuses on the optimization of container shipping network and its operations under changing cargo demand and freight rates. The problem is formulated as a mixed integer non-linear programming problem (MINP) with an objective of maximizing the average unit ship-slot profit at three stages using analytical methodology. The issues such as empty container repositioning, ship-slot allocating, ship sizing, and container configuration are simultaneously considered based on a series of the matrices of demand for a year. To solve the model, a bi-level genetic algorithm based method is proposed. Finally, numerical experiments are provided to illustrate the validity of the proposed model and algorithms. The obtained results show that the suggested model can provide a more realistic solution to the issues on the basis of changing demand and freight rates and arrange a more effective approach to the optimization of container shipping network structures and operations than does the model based on the average demand.

Feeder Bus Timetable Design and Vehicle Size Setting in Peak Hour Demand Conditions

2019 ◽  
Vol 2673 (10) ◽  
pp. 321-332 ◽  
Author(s):  
Xueping Dou ◽  
Qiang Meng
Keyword(s):  
Mixed Integer ◽  
Arrival Times ◽  
Non Linear Programming ◽  
Bee Colony ◽  
Proposed Model ◽  
Feeder Bus ◽  
Minlp Model ◽  
Failure Cost ◽  
Set Up ◽  
The Given

This study proposes a solution to the feeder bus timetabling problem, in which the terminal departure times and vehicle sizes are simultaneously determined based on the given transfer passengers and their arrival times at a bus terminal. The problem is formulated as a mixed integer non-linear programming (MINLP) model with the objective of minimizing the transfer waiting time of served passengers, the transfer failure cost of non-served passengers, and the operating costs of bus companies. In addition to train passengers who plan to transfer to buses, local passengers who intend to board buses are considered and treated as passengers from virtual trains in the proposed model. Passenger attitudes and behaviors toward the waiting queue caused by bus capacity constraints in peak hour demand conditions are explicitly embedded in the MINLP model. A hybrid artificial bee colony (ABC) algorithm is developed to solve the MINLP model. Various experiments are set up to account for the performance of the proposed model and solution algorithm.

scholarly journals Mixed integer nonlinear programming for three-dimensional aircraft conflict avoidance

2018 ◽  
Author(s):  
Junling Cai ◽  
Ning Zhang
Keyword(s):  
Traffic Management ◽  
Three Dimensional ◽  
Mixed Integer ◽  
Conflict Avoidance ◽  
Non Linear Programming ◽  
Proposed Model ◽  
Minlp Model ◽  
Heading Angle ◽  
Comparison Of The Results ◽  
Aircraft Conflict Avoidance

The problem of aircraft conflict avoidance for Air Traffic Management systems is studied. In the scenario, aircraft are considered to fly within a shared three-dimensional airspace and not allowed to approach close less than a minimum safe separation during their flights in order to avoid various conflicts. This paper proposes a formulation of the three-dimensional conflict avoidance problem as a Mixed Integer Non-Linear Programming (MINLP) model where aircraft are allowed to change both their heading angle and velocity simultaneously to keep the separation. The validity of the proposed model is demonstrated by a comparison of the results from the MINLP model and the previous conflict avoidance models with one maneuver of the heading angle or the velocity. The numerical studies show that the MINLP model improves the efficiency of computation and maintain the safety of flights even by using a standard global optimization solver

scholarly journals Cross-docks scheduling with multiple doors using fuzzy approach

2020 ◽  
Vol 79 (ET.2020) ◽  
pp. 1-18
Author(s):  
Mitra Movassaghi
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Programming Model ◽  
Linear Programming Model ◽  
Mixed Integer ◽  
Non Linear Programming ◽  
Cross Docking ◽  
Proposed Model ◽  
Delivery Routes ◽  
Programming Techniques

One of the most important practices in logistics is Cross-Docking which sets its goals as inventory reduction and customer satisfaction increase. Customers receive goods through docks. Docks are responsible to provide a place for goods before being delivered to the customers. Then, these materials are directly loaded into outbound trucks with little or no storage in between to send to customers in the shortest possible time. This paper is mainly aimed at introducing a mixed integer, non-linear programming model to solve scheduling several cross-docking problems. The proposed model is highly facilitated to allocate the most optimal destinations to storage doors and truck scheduling in docks while selecting the collection and delivery routes. Using optimization approaches at uncertainty conditions is also of great importance. Mathematical programming techniques vividly fail to solve transportation problems that include fuzzy objective function coefficients. A fuzzy multi-objective linear programming model is proposed to solve the transportation decision-making with fuzzy objective function coefficients.

scholarly journals Mixed integer nonlinear programming for three-dimensional aircraft conflict avoidance

2018 ◽  
Author(s):  
Junling Cai ◽  
Ning Zhang
Keyword(s):  
Traffic Management ◽  
Three Dimensional ◽  
Mixed Integer ◽  
Conflict Avoidance ◽  
Non Linear Programming ◽  
Proposed Model ◽  
Minlp Model ◽  
Heading Angle ◽  
Comparison Of The Results ◽  
Aircraft Conflict Avoidance

The problem of aircraft conflict avoidance for Air Traffic Management systems is studied. In the scenario, aircraft are considered to fly within a shared three-dimensional airspace and not allowed to approach close less than a minimum safe separation during their flights in order to avoid various conflicts. This paper proposes a formulation of the three-dimensional conflict avoidance problem as a Mixed Integer Non-Linear Programming (MINLP) model where aircraft are allowed to change both their heading angle and velocity simultaneously to keep the separation. The validity of the proposed model is demonstrated by a comparison of the results from the MINLP model and the previous conflict avoidance models with one maneuver of the heading angle or the velocity. The numerical studies show that the MINLP model improves the efficiency of computation and maintain the safety of flights even by using a standard global optimization solver

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.

scholarly journals Global Economy Crisis and its Impact on Operational Container Carrier’s Strategy

2018 ◽  
Vol 30 (2) ◽  
pp. 187-194
Author(s):  
Vladimir Jerebić ◽  
Stanislav Pavlin
Keyword(s):  
Problem Solving ◽  
Global Economy ◽  
Management Strategies ◽  
Business Environment ◽  
Market Potential ◽  
Container Shipping ◽  
Freight Rates ◽  
New Business ◽  
Cyclic Changes ◽  
Economic And Financial Crisis

The shipping market is an economic derivative of global production and trade, being precariously subject of their cyclic changes, depressions and expansions. This paper analyses the condition of global container shipping market, caused by long-lasting economic and financial crisis that begun in 2008, but is still much visible within the container industry, particularly through overcapacity and low freight rates. It also deals with major changes of maritime container carrier’s management strategies, development and application of advanced transportation, technological, technical, economical, organizational and commercial measures in order to adapt and cope with new business environment. Finally, an attempt is made to forecast the market, potential difficulties and to propose problem-solving measures.

scholarly journals An Optimized Mathematical Model for Items Supplies Planning of a Logistic System

2016 ◽  
Vol 10 (10) ◽  
pp. 133
Author(s):  
Mohammad Ali Nasiri Khalili ◽  
Mostafa Kafaei Razavi ◽  
Morteza Kafaee Razavi
Keyword(s):  
Mathematical Model ◽  
Mixed Integer ◽  
Logistics System ◽  
Proposed Model ◽  
Multiple Objective Decision Making ◽  
System Requirements ◽  
Purchasing Logistics ◽  
The Cost ◽  
The Mathematical Model ◽  
First Time

Items supplies planning of a logistic system is one of the major issue in operations research. In this article the aim is to determine how much of each item per month from each supplier logistics system requirements must be provided. To do this, a novel multi objective mixed integer programming mathematical model is offered for the first time. Since in logistics system, delivery on time is very important, the first objective is minimization of time in delivery on time costs (including lack and maintenance costs) and the cost of purchasing logistics system. The second objective function is minimization of the transportation supplier costs. Solving the mathematical model shows how to use the Multiple Objective Decision Making (MODM) can provide the ensuring policy and transportation logistics needed items. This model is solved with CPLEX and computational results show the effectiveness of the proposed model.

A Least Cost Transmission Planning Model Considering Operation Cost

2014 ◽  
Vol 15 (2) ◽  
pp. 121-128
Author(s):  
Jorge Hans Alayo
Keyword(s):  
Test System ◽  
Mixed Integer ◽  
Transmission Planning ◽  
Integer Linear Programming Problem ◽  
Transmission Expansion ◽  
Planning Models ◽  
Proposed Model ◽  
Expansion Model ◽  
Operation Cost ◽  
Linearization Techniques

Abstract Existing transmission planning models consider basic aspects of the problem. In practice, a transmission utility needs to model other important details such as operation cost of the power system. In this article, a least cost transmission expansion model is proposed considering the operation cost in order to model the trade-off between building new transmission capacity and increasing the power system’s operation cost. The proposed model is transformed into a mixed integer linear programming problem using linearization techniques and solved with CPLEX. Finally, results of the model for the Garver test system and IEEE 24-bus test system are shown.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

Sign in / Sign up

Export Citation Format

Share Document