Design-balanced capacitated multicommodity network design with heterogeneous assets

Management of assets plays an essential role in determination of service plans operated by carriers in the transportation and logistics system. In this paper, we introduce certain issues related to management of heterogeneous assets in the well-known design-balanced capacitated multicommodity network design, where design-balanced requirements are explicitly defined based on heterogeneous assets.Taking vehicles as an example of heterogeneous assets, we first present an arc-based formulation for the proposed problem and discuss two associated subproblems. We then propose a tabu search based metaheuristic for this problem. Over a wide range of network design instances, we respectively compare our approach with CPLEX with one-hour and ten-hour time limits. Computational results demonstrate that the proposed approach performs very well in terms of solution quality and computing time, especially for large instances.     

狂欢化的诗性与人性童话--论金波《乌丢丢的奇遇》的文体开放性与复调对话结构

将巴赫金的理论移植入金波童话新作<乌丢丢的奇遇>,向人们展示这部童话的魅力,不仅抑制了外在的权威话语,并独创了这种既诗又童话的开放文体,即诗性童话.通过运用复调理论的解读,发现作家不仅在作品中表现了多种平等意识的多声部复调对话,而且还塑造了一个复调的人,在童话中真正复归人性.     

Storage constrained vendor managed inventory models with unequal shipment frequencies

We consider a supply chain where a vendor manages its multiple retailers' stocks under a vendor managed inventory (VMI) contract that specifies upper stock limits at the retailers' premises and overstock costs for exceeding those limits. We formulate a mixed integer nonlinear program that minimizes total supply chain costs and allows unequal shipment frequencies to the retailers. We develop an algorithm to solve its relaxed version which provides a lower bound cost solution. We propose a cost efficient heuristic procedure to generate delivery schedules to the retailers. We conduct a sensitivity analysis to provide insights on the performance of the proposed heuristic. Results show that our heuristic finds optimal or near optimal solutions, and it proposes substantial savings compared to the total supply-chain cost in the cases where there is no VMI and where there is VMI but with equal shipment frequencies to retailers.     

A heuristic model for the sequence-dependent lot scheduling problem

This paper presents a heuristic algorithm for finding a good solution for the sequence-dependent lot scheduling problem. Unlike available methods, the algorithm eliminates the need for creating new artificial problems and implementing feasibility tests. It also eliminates the tedious task of translating setup relationships into a mathematical programming formulation. The result is a conceptually simple solution technique that is practically motivated and easily implemented for use on the shop floor. Comparison of algorithm performance with published results demonstrates the efficacy of the approach.     

邓小平“南巡谈话”的社会历史发展观初探——邓小平“南巡谈话”20周年纪念

本文通过历史的发展与生产力标准、历史的发展与实事求是和人民在历史发展中的地位等几个方面初步探讨了邓小平＂南巡谈话＂的社会历史发展观,并对正确的社会历史发展观的价值、意义作了一定的认识和讨论。     

佳色功名两不朽 诗人意兴托风情——《游仙窟》的文学特质与美学价值

通过对唐传奇中的名篇《游仙窟》的分析 ,可以发现 ,唐传奇主要表现了一种普遍的“青楼意识” ,它具有独具的文化特质、美学价值。其情节进程的展开、整体的结构形式都具有独特的意义。思想的表达及写作的独特性更使其具有现代西方小说的显著特征。诗散皆备形式等更对后世文学产生了颇大的影响。     

Traffic engineering and congestion control for open shortest path first networks

Open shortest path first (OSPF) is the most widely used intra-domain Internet routing protocol. The OSPF protocol directs the Internet traffic along the shortest paths that are defined by the links weight. Traffic engineering is responsible for improving the network performance, for instance, the objective function that minimizes the maximal link utilization which is usually adopted to avoid the network congestion. This paper formulates the model of OSPF routing, and further evaluates the performance of different approaches. We also propose a heuristic algorithm to solve the routing problems by optimizing OSPF weights. Computational results indicated that the proposed algorithm could lead to good load balancing, and make efficient utilization of network resources.     

Minimization of maximum lateness under linear deterioration

This paper considers a single-machine scheduling problem to minimize the maximum lateness. The processing time of each job is a linear function of the time when the job starts processing. This problem is known to be -hard in the literature. In this paper, we design a branch-and-bound algorithm for deriving exact solutions by incorporating several properties concerning dominance relations and lower bounds. These properties produce synergic effects in accelerating the solution finding process such that the algorithm can solve problems of 100 jobs within 1 min on average. To compose approximate solutions, we revise a heuristic algorithm available in the literature and propose several hybrid variants. Numerical results evince that the proposed approaches are very effective in successfully reporting optimal solutions for most of the test cases.     

“Comments are disabled for this video”: A technological affordances approach to understanding source credibility assessment of CSR information on YouTube

Scarce research has focused on the technological aspects of social media in CSR communication. Many public relations practitioners are reluctant to interact online although social media platforms such as YouTube provide two-way communication interface. Using the MAIN model, this study explored how bandwagon cues (more likes/dislikes) and interaction cues (enable/disable commenting) influence the perceived source credibility assessment (trustworthiness, goodwill, and competence) of CSR information on YouTube. Through a 2 × 2 factorial experiment (N = 204), no interaction effects were found in general; but a main effect of the enabling comment interface existed toward the perceived trustworthiness of the company regardless of likes/dislikes received on the CSR video, which further leads to individual’s attitudes toward the company’s CSR efforts. The finding paves a way for an explanation of the effectiveness of enabling the commenting function of using YouTube to enhance CSR communication.     

运输路径问题的一个新启发式算法

在解运输路径问题时常常使用Clarke和Wright提出的启发式算法(下称C.W.算法)。本文对Clarke和Wright算法进行改进。改进算法的计算复杂性虽不如C.W.算法,但计算的数值结果在大多数情况下比C.W.算法的结果更好。