多级物流配送中心选址模型及计算机求解

介绍了构建多级物流配送中心选址模型的方法以及如何运用Excel中的规划求解工具对模型进行求解。     

���˼�װ������·��ѡ���Ż��о�

应用整数规划研究航运集装箱路径选择问题,并将重箱和空箱统一在一个系统中研究。在本文模型中,以集装箱运输总利润最大化为目标函数,利润是重箱运输利润减去重、空箱运输成本。约束条件考虑到满足空集装箱需求和重集装箱需求、航线运输能力限制及空箱供给数量等。应用LINGO9.0求解模型,并通过数值仿真来证明不同参数影响下的调运策略。本文旨在为船公司提供合理的航运集装箱运输方案,从而降低船公司的集装箱运输成本,实现船公司集装箱运输效益最大化。     

Expirable parking reservations for managing morning commute with parking space constraints

When total parking supply in an urban downtown area is insufficient, morning commuters would choose their departure times not only to trade off bottleneck congestion and schedule delays, but also to secure a parking space. Recent studies found that an appropriate combination of reserved and unreserved parking spaces can spread the departures of those morning commuters and hence reduce their total travel cost. To further mitigate both traffic congestion and social cost from competition for parking, this study considers a parking reservation scheme with expiration times, where commuters with a parking reservation have to arrive at parking spaces for the reservation before a predetermined expiration time. We first show that if all parking reservations have the same expiration time, it is socially preferable to set the reservations to be non-expirable, i.e., without expiration time. However, if differentiated expiration times are properly designed, the total travel cost can be further reduced as compared with the reservation scheme without expiration time, since the peak will be further smoothed out. We explore socially desirable equilibrium flow patterns under the parking reservation scheme with differentiated expiration times. Finally, efficiencies of the reservation schemes are examined.     

Liner ship route schedule design with port time windows

This paper examines a practical tactical liner ship route schedule design problem, which is the determination of the arrival and departure time at each port of call on the ship route. When designing the schedule, the availability of each port in a week, i.e., port time window, is incorporated. As a result, the designed schedule can be applied in practice without or with only minimum revisions. This problem is formulated as a mixed-integer nonlinear nonconvex optimization model. In view of the problem structure, an efficient holistic solution approach is proposed to obtain global optimal solution. The proposed solution method is applied to a trans-Atlantic ship route. The results demonstrate that the port time windows, port handling efficiency, bunker price and unit inventory cost all affect the total cost of a ship route, the optimal number of ships to deploy, and the optimal schedule.     

A bi-objective dynamic programming approach for airline green fleet planning

Ensuring a fleet of green aircraft is a basic step in mitigating aviation pollution issues that are expected to be worsen in the coming years due to rapid air traffic growth. This study proposed a novel methodology in green fleet planning in which both profit and green performance of airline are considered simultaneously and explicitly. To do this, a Green Fleet Index (GFI) is derived as an indicator to quantify the green performance of airline’s fleet. It measures the degree of airline compliance with a standard requirement in terms of emission, noise, and fuel consumption. A bi-objective dynamic programming model is then formulated to find optimal aircraft acquisition (lease or purchase) decision by minimizing GFI and maximizing profit. Several interesting results are obtained: (1) considering environmental issue as secondary objective yields a greener fleet; (2) airline’s profit is affected, but could be recovered from environmental cost savings; (3) increasing load factor is an effective operational improvement strategy to enhance airline’s green performance and raise profit level. It is anticipated that the framework developed in this study could assist airlines to make a smart decision when considering the need to be green.     

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.     

Energy savings in transport

A decade of increasing Federal attention to urban transportation needs has culminated in the 1970 Urban Mass Transportation Assistance Act. This Act is intended to provide 10 thousand million dollars over the next 12 years in Federal assistance money to urban public transportation systems. This paper examines the needs of selected U.S. cities as a basis for (1) understanding the vast, various and complex transportation needs of urban areas throughout the country, and (2) assessing the sufficiency of these funds. The sample cities have been placed into three broad categories based on the state of development of their transportation systems. In Category I cities, the essential need is to ensure the survival of bus systems for the use of non‐drivers, or to provide some other viable alternative to the automobile; in Category II cities, the primary needs are to relieve auto congestion and to improve public transportation components, while in Category III cities, the primary need is massive investment to improve and to extend public transportation facilities. It is concluded that the presently intended Federal funding level for transportation will not meet the financial requirements of the Category III cities.     

Optimization models for differentiating quality of service levels in probabilistic network capacity design problems

This paper develops various chance-constrained models for optimizing the probabilistic network design problem (PNDP), where we differentiate the quality of service (QoS) and measure the related network performance under uncertain demand. The upper level problem of PNDP designs continuous/discrete link capacities shared by multi-commodity flows, and the lower level problem differentiates the corresponding QoS for demand satisfaction, to prioritize customers and/or commodities. We consider PNDP variants that have either fixed flows (formulated at the upper level) or recourse flows (at the lower level) according to different applications. We transform each probabilistic model into a mixed-integer program, and derive polynomial-time algorithms for special cases with single-row chance constraints. The paper formulates benchmark stochastic programming models by either enforcing to meet all demand or penalizing unmet demand via a linear penalty function. We compare different models and approaches by testing randomly generated network instances and an instance built on the Sioux–Falls network. Numerical results demonstrate the computational efficacy of the solution approaches and derive managerial insights.     

Containership scheduling with transit-time-sensitive container shipment demand

This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an ε-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method.     

Ant Colony Routing algorithm for freeway networks

Dynamic traffic routing refers to the process of (re)directing vehicles at junctions in a traffic network according to the evolving traffic conditions. The traffic management center can determine desired routes for drivers in order to optimize the performance of the traffic network by dynamic traffic routing. However, a traffic network may have thousands of links and nodes, resulting in a large-scale and computationally complex non-linear, non-convex optimization problem. To solve this problem, Ant Colony Optimization (ACO) is chosen as the optimization method in this paper because of its powerful optimization heuristic for combinatorial optimization problems. ACO is implemented online to determine the control signal – i.e., the splitting rates at each node. However, using standard ACO for traffic routing is characterized by four main disadvantages: 1. traffic flows for different origins and destinations cannot be distinguished; 2. all ants may converge to one route, causing congestion; 3. constraints cannot be taken into account; and 4. neither can dynamic link costs. These problems are addressed by adopting a novel ACO algorithm with stench pheromone and with colored ants, called Ant Colony Routing (ACR). Using the stench pheromone, the ACR algorithm can distribute the vehicles over the traffic network with less or no traffic congestion, as well as reduce the number of vehicles near some sensitive zones, such as hospitals and schools. With colored ants, the traffic flows for multiple origins and destinations can be represented. The proposed approach is also implemented in a simulation-based case study in the Walcheren area, the Netherlands, illustrating the effectiveness of the approach.