检索结果-内蒙古大学图书馆

Cruise itineraries optimal scheduling

OPTIMIZATION LETTERS 2021年第5期15卷 1665-1689页

作者： Di Pillo, Gianni Fabiano, Marcello Lucidi, Stefano Roma, Massimo ACTOR SRL Spin Off SAPIENZA Univ Rome Rome Italy SAPIENZA Univ Rome Dept Comp Control & Management Engn A Ruberti Rome Italy

A cruise company faces three decision problems: at a strategic level, to decide in which maritime area and in which season window to locate each ship of its fleet;at a tactical level, given a ship in a maritime area and in a season window, to decide which cruises to offer to the customers;at an operational level, to determine the day-by-day itinerary, in terms of transit ports, arrival and departure times and so on. This paper focuses on the tactical level, namely on the Cruise Itineraries Optimal Scheduling (CIOS), aiming at determining a scheduling of cruises with the objective to maximize the revenue provided by a given ship placed in a specified maritime area, in a selected season window, taking into account a number of constraints. In particular, we refer to luxury cruises, implying several additional considerations to be taken into account. We propose an integer linear programming (ILP) model for such a CIOS problem. This model has been experimented by a major luxury cruise company to schedule the itineraries of its fleet in many geographical areas all over the world. A commercial solver has been used to solve the ILP problem. Here we report, as illustrative examples, the results obtained on some of these real instances to show the computational viability of the proposed approach.

关键词： Cruises optimal scheduling integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Hub-and-spoke network design for container shipping in inland waterways

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年 223卷

作者： Zhou, Saiqi Ji, Bin Song, Yalong Yu, Samson S. Zhang, Dezhi Van Woensel, Tom Cent South Univ Sch Traff & Transportat Engn Changsha 410075 Hunan Peoples R China Deakin Univ Sch Engn Waurn Ponds Vic 3216 Australia Eindhoven Univ Technol Dept Ind Engn & Innovat Sci Eindhoven Netherlands

The enormous growth in the volume of river transportation and the upgrade of inland waterways make inland shipping more and more important in transportation and logistics. This work proposes a hub-and-spoke network design (HSND) for container shipping in inland waterways based on the tree-like structure river. Firstly, the characteristics of the hub-and-spoke network in the inland waterways are presented in detail. Then, an integer linear programming model is proposed to simultaneously determine the optimal hub location, feeder port allocation, and fleet deployment to minimize the total cost of ships, transportation, and transshipment. A decomposition-based math-heuristic method and an enhanced genetic algorithm are then proposed to solve the HSND. A case study based on the traffic on the Yangtze River and extensive computational experiments are conducted to verify the effectiveness of the proposed models and methods. In addition, the impacts of the number of hub ports and the economies of scale resulting from the hub-and-spoke network are investigated from the economic and network structure perspectives, which leads to some managerial insights.

关键词： Hub-and-spoke network design Inland waterway container shipping integer linear programming model Decomposition-based math-heuristic Enhanced genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Ship routing in inland waterway liner transportation with foldable and standard empty containers repositioning

引用

OCEAN ENGINEERING 2023年第Part2期285卷

作者： Li, De-Chang Yang, Hua-Long Dalian Maritime Univ Transportat Engn Coll Dalian 116026 Peoples R China

This paper addresses the container ship routing problem in inland waterway liner transportation. Given estimated weekly full container shipping demands between port pairs and the potential empty container demands at each port, our goal is to design the container ship route and determine the amount of foldable and standard empty containers to be shipped between each port pair in the context of navigational restrictions, so as to maximize the profit of the shipping services. To save possible leasing or storage costs of empty containers at various ports and meet navigational restrictions, the release of foldable containers and the repositioning of empty containers were taken into account in the decision. Two mixed integer programming models are established to optimize ship route and shipping strategies under splittable and unsplittable demands. The models are further improved by projecting arc variables for simulating the transportation of empty containers, and the improved model has fewer decision variables and higher computational efficiency. Numerical experiments based on the Yangtze River are conducted to test the applicability of methods. Finally, some reference recommendations are presented.

关键词： Inland waterway transportation River container ship routing Empty container repositioning Foldable containers integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

A methodology for determining the optimal reverse flow capacities and the breakeven period for a multi products-component remanufacturing problem of an OEM

引用

OPERATIONS MANAGEMENT RESEARCH 2020年第3-4期13卷 233-248页

作者： Malolan, S. Mathirajan, M. Tiwari, M. K. Natl Inst Technol Tiruchirappalli Dept Management Studies Tiruchirappalli India Indian Inst Sci Dept Management Studies Bangalore Karnataka India Indian Inst Technol Kharagpur Dept Ind & Syst Engn Kharagpur W Bengal India

Original Equipment Manufacturers (OEM) that assemble multiple durable products are actively engaged in adopting remanufacturing practices. This study addresses the introduction of a new business proposal, which is carrying out remanufacturing of components from acquired returns by an OEM through the set-up of required Reverse Flow Capacities (RFC), which are capacities for dismantling the returns and capacities for remanufacturing various components. Hence, by incorporating the activity on remanufacturing of components, an OEM creates a new cheaper source for obtaining components, in addition to the conventional sources of manufacturing and/or purchasing. The components obtained from any of these three sources can be used to assemble the multiple durable products for satisfying demands. The study refers to this problem as "Multi Products-Component Remanufacturing (MP-CR) problem". Furthermore, it is identified that the incorporation of MP-CR problem has tremendous potential in the Indian automobile sector. With these, this study address two strategic issues and an operation issue for the incorporation of new MP-CR problem to an OEM. The first strategic issue is the determination of RFC that must be set-up. This strategic issue is addressed in synchronize with the operational issue of determining the optimal Inventory & Production Plans (I&PP) for assembling multiple products for a given planning horizon. In addition, once the optimal RFC is determined, the second strategic issue is the determination of optimal period (called as Breakeven Period (BEP)), after which the OEM would reclaim the capital investment for setting-up the optimal RFC. In order to address these three interrelated decisions, a systematic methodology is proposed. In the proposed methodology, first an integer linear programming model is developed for the existing system of the OEM to determine the optimal I&PP. Next, this model is extended to determine the optimal RFC and corresponding optimal I&PP

关键词： Component remanufacturing Multiple products Reverse flow capacities Inventory and production planning Breakeven period integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Optimised approach for VNF embedding in NFV

引用

IET COMMUNICATIONS 2018年第20期12卷 2630-2638页

作者： Yi, Bo Wang, Xingwei Huang, Min Northeastern Univ Coll Comp Sci & Engn Shenyang 110169 Liaoning Peoples R China Northeastern Univ Coll Software Shenyang 110169 Liaoning Peoples R China Northeastern Univ Coll Informat Sci & Engn State Key Lab Synthet Automat Proc Ind Shenyang 110819 Liaoning Peoples R China

The Virtual Network Function (VNF) embedding problem is important for service provision in the context of Network Function Virtualisation (NFV). However, this problem is proved to be NP-hard and challenging, and requires to be explored further. In this study, the authors first formulate it as an integer linear programming (ILP) model for optimal solutions. Then, to compensate for the high running time of solving the ILP model, they propose a heuristic approach which fulfils the embedding process by jointly taking the global network connectivity and the local substrate node capacity into consideration. The simulation on real-world network topologies demonstrates that the proposed approach can provide solutions within 1.7 times of the optimal solution offered by ILP. In addition, the experiments also suggest that the proposed approach can provide up to 2.75 times reduction in the overall cost than the other benchmarks.

关键词： integer programming virtualisation telecommunication network topology linear programming optimised approach VNF embedding NFV Virtual Network Function embedding problem Network Function Virtualisation NP-hard integer linear programming model ILP model global network connectivity local substrate node capacity real-world network topologies

来源：评论

学校读者我要写书评

暂无评论

A new model and algorithm for RSA problem in elastic optical networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2019年第3期31卷 145-155页

作者： Ji, Chunxia Wang, Yuping Xu, Zhanqi Li, Xia Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China Xidian Univ Sch Telecommun Engn Xian 710071 Peoples R China

Routing and spectrum allocation (RSA) is an important problem in elastic optical networks (EONs). With the increase of network scale and task requests, the imbalance of the network topology becomes more and more prominent, causing congestion of some links in the network and even paralysation of the entire network. To tackle this issue, in this paper, we first set up an integer linear programming model for RSA problems in EONs, which minimises the number of used slots, optimises the balance of networks and the burden of KeyLinks (i.e., the links which are easy blocked when large requests comes). Then we design a new routing scheme called dynamically adjusted shortest hop count and minimum rank value first (DSHMRF) to select the candidate routes for each request. Moreover, we propose a new genetic algorithm called direction and distance-based genetic algorithm (DDGA) to look for optimal routes for all requests among the candidate routes. To allocate the spectrum reasonably, we adopt first fit (FF) scheme. Finally, the experiments are conducted on several network topologies of different scales with different request sets and the results indicate that the proposed model is effective and the proposed genetic algorithm is efficient.

关键词： EON elastic optical network routing spectrum allocation integer linear programming model genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimization model to design a new cruise itinerary: the case of Costa Crociere

An optimization model to design a new cruise itinerary: the ...

引用

15th International-Federation-of-Automatic-Control (IFAC) Symposium on Control in Transportation Systems (CTS)

作者： Asta, Veronica Ambrosino, Daniela Bartoli, Federico CIELI Genoa Italy Univ Genoa Dept Econ & Business Studies DIEC Genoa Italy Costa Crociere Spa Genoa Italy

This work analyses the complex processes for the development of cruises' itineraries to offer on the market and proposes a mathematical model for determining a new itinerary maximizing revenues, customers satisfaction, while minimizing operative costs. This work represents one of the first attempt to apply optimization techniques to cruise shipping and has been realized in collaboration with Costa Crociere, a cruise company operating in Europe. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Optimization Cruise itinerary designing problem integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem

引用

TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT 2017年 57卷 422-457页

作者： Jabir, E. Panicker, Vinay V. Sridharan, R. Natl Inst Technol Calicut Dept Mech Engn Calicut 673601 Kerala India

The traditional distribution planning problem in a supply chain has often been studied mainly with a focus on economic benefits. The growing concern about the effects of anthropogenic pollutions has forced researchers and supply chain practitioners to address the socio-environmental concerns. This research study focuses on incorporating the environmental impact on route design problem. In this work, the aim is to integrate both the objectives, namely economic cost and emission cost reduction for a capacitated multi-depot green vehicle routing problem. The proposed models are a significant contribution to the field of research in green vehicle routing problem at the operational level. The formulated integer linear programming model is solved for a set of small scale instances using LINGO solver. A computationally efficient Ant Colony Optimization (ACO) based meta-heuristic is developed for solving both small scale and large scale problem instances in reasonable amount of time. For solving large scale instances, the performance of the proposed ACO based meta-heuristic is improved by integrating it with a variable neighbourhood search.

关键词： Vehicle routing problem Environmental impact integer linear programming model Ant colony optimization Variable neighbourhood search

来源：评论

学校读者我要写书评

暂无评论

A Branch-and-Cut algorithm for factory crane scheduling problem

引用

JOURNAL OF GLOBAL OPTIMIZATION 2015年第4期63卷 729-755页

作者： Cheng, Xu Tang, Lixin Pardalos, Panos M. Northeastern Univ Inst Ind Engn & Logist Optimizat Shenyang 110819 Peoples R China Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110819 Peoples R China Univ Florida Ctr Appl Optimizat Ind & Syst Engn Gainesville FL 32611 USA

The factory crane scheduling problem (FCSP) deals with assigning delivery tasks to cranes and then sequencing them, in order to minimize the total completion time for all tasks. In this paper, delivery tasks for required jobs are preemptive allowed at most once before the jobs arrive at exit. The preemptive jobs are temporarily stored in a buffer stack, in which jobs pickup and delivery should be performed under the Last-In-First-Out policy. This feature makes our problem more changeling and interesting. In this paper, FCSP is first formulated as an integer programming model. Based on properties of the problem, FCSP is then reformulated with a much tighter bound. After that, several families of valid inequalities are proposed and used within a Branch-and-Cut framework. In addition, preprocessing techniques and separation heuristics are used to improve algorithm efficiency. Computational experiments are carried out on practical data collected from the steel company. The results support both effectiveness and efficiency of the model refinements as well as the Branch-and-Cut algorithm proposed.

关键词： Factory crane scheduling problem integer linear programming model Branch-and-Cut Valid inequalities

来源：评论

学校读者我要写书评

暂无评论

A Call-based integer programming model for Static Elevator Operation Problems 7

A Call-based Integer Programming Model for Static Elevator O...

引用

Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)

作者： Inamoto, Tsutomu Higami, Yoshinobu Kobayashi, Shin-ya Ehime Univ Grad Sch Sci & Engn Bunkyo 3 Matsuyama Ehime 7908577 Japan

ISBN: (纸本)9781479959556

In this paper, we propose an integer linear programming (ILP) model for static elevator operation problems. The proposed model is based on hall- and car-calls which correspond to pickup and delivery requests in pickup-and-delivery problems (PDPs), thus is similar to ILP models for PDPs. The primary difference between those models and the proposed model is the prevention of the reverse run, which means that an elevator with a passenger is moved to the direction opposite to that of the passenger. In computer illustrations, the proposed model is roughly investigated by being compared with a trip-based ILP model which has been proposed by the authors.

关键词： integer programming lifts linear programming PDP call-based integer programming model car-calls computer illustrations hall-calls integer linear programming model pickup-and-delivery problems static elevator operation problems trip-based ILP model Computational modeling Elevators Equations linear programming Mathematical model Planning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：