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

IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)

作者： Hoang, Anh T. Nguyen, Cuong H. P. Ngoduy, Dong Vu, Hai L. Monash Univ Dept Civil Engn Melbourne Vic Australia

ISBN: (数字)9781665468800

ISBN: (纸本)9781665468800

This paper develops a bi-level control framework that considers the mixed traffic flow of autonomous vehicles (AVs) and human-driven vehicles (HVs) in transport networks. Our framework consists of a multi-class dynamic traffic assignment at the upper level to determine the optimal traffic flow splits for vehicles, while an end-to-end trajectory planning algorithm for AVs is incorporated into the lower level to attain the eco-driving strategy in the mixed traffic environment. The macroscopic decisions (e.g. traffic flow splits) at the upper level can directly affect the progression of the mixed traffic flows, while microscopic decisions (e.g. trajectory profiles) at the lower level can provide realistic feedback (e.g. link supply capacities) to guide the search direction of the upper level and ultimately improve the obtained solution. Besides, we also introduce an effective solution method for this framework that solves the mixed-integer linear programming models at the upper and lower levels. Numerical results indicate that even a low penetration rate of AVs can significantly reduce fuel consumption. Furthermore, AVs can reduce the total travel time of traffic users, eventually mitigating the congestion in the networks.

关键词： Trajectory planning Heuristic algorithms Simulation Microscopy Trajectory Numerical models mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Driving Profile of Autonomous Electric Vehicles Considering Regenerative Braking Limitations

Energy-Aware Driving Profile of Autonomous Electric Vehicles...

引用

IEEE/AIAA Transportation Electrification Conference / Electric Aircraft Technologies Symposium (ITEC+EATS)

作者： Mohammadi, Masoud Heydari, Shoeib Fajri, Poria Harirchi, Farshad Yi, Zonggen Univ Nevada Elect & Biomed Engn Dept Reno NV 89557 USA Amazon Web Serv Detroit MI USA Idaho Natl Lab Energy Storage & Elect Transportat Dept Idaho Falls ID USA

ISBN: (纸本)9781665405607

This paper focuses on finding an optimal energy-aware speed trajectory of an Autonomous Electric Vehicle (AEV) considering regenerative braking capability and its limitations. A position-based Electric Vehicle (EV) energy consumption model is used to emulate vehicle-road operating conditions. It is assumed that the EV is driven in an urban area where the route is only constrained by maximum speed limits and traffic signs. The eco-driving problem is formulated as a mixed integer linear programming (MILP) problem and is solved for two different case studies to demonstrate the importance of considering regenerative braking in identifying optimal speed trajectory of AEVs. The MILP problem is coded in Python and CPLEX is used as a solver for the optimization problem. The results show a variation in the optimal speed trajectories and confirm that when regenerative braking limitations are considered in the calculations leading to an energy-aware speed trajectory, energy consumption can be reduced. This study sets forth a framework for optimizing the braking profile of an AEV by realistically taking into account the vehicle's regenerative braking limitations which ultimately yields an optimal speed trajectory.

关键词： Energy consumption Urban areas Decision making Electric vehicles Trajectory mixed integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Unmanned Aerial Vehicle Last-Mile Delivery Considering Backhauls

引用

IEEE ACCESS 2021年 9卷 85017-85033页

作者： Jeon, Ahram Kang, Joohang Choi, Byungil Kim, Nakyung Eun, Joonyup Cheong, Taesu Korea Univ Grad Sch Management Technol Seoul 02841 South Korea Korea Univ Sch Ind & Management Engn Seoul 02841 South Korea

Utilizing unmanned aerial vehicles for delivery service has been drawing attention in the logistics industry. Since commercial unmanned aerial vehicles have fundamental limitations on payloads and battery capacities, hybrid ground vehicle and unmanned aerial vehicle models have been actively investigated as practical solutions. However, these studies have focused on linehaul (delivery) demands, excluding a large number of backhaul (pickup) demands. If we consider both demands at the same time, an empty unmanned aerial vehicle that finished linehaul service can be immediately used to serve a backhaul customer. In this study, we investigate the differences that arise by considering backhauls as an additional element of the routing problem. A mixed integer linear programming model is developed, and a heuristic is constructed to solve large-scale problems. To demonstrate the effectiveness of our model, we compare it to existing models using a real-world example. Our solution is also evaluated based on experiments employing a large number of randomly generated datasets.

关键词： Drone flying sidekick traveling salesman problem heuristic mixed integer linear programming unmanned aerial vehicle vehicle routing problem with backhauls

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL QOS-AWARE NETWORK SLICING FOR SERVICE-ORIENTED NETWORKS WITH FLEXIBLE ROUTING 47

OPTIMAL QOS-AWARE NETWORK SLICING FOR SERVICE-ORIENTED NETWO...

引用

47th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Chen, Wei-Kun Liu, Ya-Feng Dai, Yu-Hong Luo, Zhi-Quan Beijing Inst Technol Sch Math & Stat Beijing Peoples R China Chinese Acad Sci AMSS ICMSEC LSEC Beijing Peoples R China Shenzhen Res Inst Big Data Shenzhen Peoples R China Chinese Univ Hong Kong Shenzhen Peoples R China

ISBN: (纸本)9781665405409

In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse quality of service (QoS) requirements. We first propose a mixed integer nonlinear program (MINLP) formulation for this problem that optimizes the network resource consumption while jointly considers QoS requirements, flow routing, and resource budget constraints. In particular, the proposed formulation is able to flexibly route the traffic flow of the services on multiple paths and provide end-to-end (E2E) delay and reliability guarantees for all services. Due to the intrinsic nonlinearity, the MINLP formulation is computationally difficult to solve. To overcome this difficulty, we then propose a mixed integer linear program (MILP) formulation and show that the two formulations and their continuous relaxations are equivalent. Different from the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial time solvable linear programming problem, which makes the MILP formulation much more computationally solvable. Numerical results demonstrate the effectiveness and efficiency of the proposed formulations over existing ones.

关键词： E2E delay/reliability flexible routing mixed integer linear programming network slicing QoS constraints

来源：评论

学校读者我要写书评

暂无评论

Late Train-Crew Rescheduling—a Model and a Heuristic Approach

引用

Transportation Research Procedia 2025年 86卷 337-344页

作者： Liyun Yu Carl Henrik Häll Anders Peterson Christiane Schmidt Department of Science and Technology Linköping University Norrköping Sweden

In this paper, we reschedule the duties of train drivers one day before the operation. Due to absent drivers (e.g., because of sick leave), some trains have no driver. Thus, duties on the operation day need to be rescheduled. We start with a feasible crew schedule of the remaining operating drivers, a set of unassigned tasks which were assigned to the absent drivers, and a group of standby drivers with fixed start time, end time, start depot, and end depot. Our aim is to generate a crew schedule with as few cancelled driving tasks and changed tasks as possible. We developed a mixed integer linear programming (MILP) model for short-term crew rescheduling. We also present a Tabu-Search-Based approach with the same objective function and equivalent restrictions of our mathematical model. We compare the results of the MILP model solved by Gurobi 11.0 and of the Tabu-Search-Based approach. Our Tabu-Search-Based approach takes less time and memory occupation to compute a ‘good-enough’ result. We further test the performance of our approach under different circumstances. The data used in the experiments are real data provided by Mälartåg.

关键词： Railway crew rescheduling mixed integer linear programming Tabu search

来源：评论

学校读者我要写书评

暂无评论

Parallel drone scheduling vehicle routing problems with collective drones

引用

COMPUTERS & OPERATIONS RESEARCH 2024年 163卷

作者： Montemanni, Roberto Dell'Amico, Mauro Corsini, Andrea Univ Modena & Reggio Emilia Dept Sci & Methods Engn Via Amendola 2 I-42122 Reggio Emilia Italy

We study last-mile delivery problems where trucks and drones collaborate to deliver goods to final customers. In particular, we focus on problem settings where either a single truck or a fleet with several homogeneous trucks work in parallel to drones, and drones have the capability of collaborating for delivering missions. This cooperative behavior of the drones, which are able to connect to each other and work together for some delivery tasks, enhance their potential, since connected drone has increased lifting capabilities and can fly at higher speed, overcoming the main limitations of the setting where the drones can only work independently. In this work, we contribute a Constraint programming model and a valid inequality for the version of the problem with one truck, namely the Parallel Drone Scheduling Traveling Salesman Problem with Collective Drones and we introduce for the first time the variant with multiple trucks, called the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. For the latter version of the problem, we propose two Constraint programming models and a mixed integer linear programming model. An extensive experimental campaign leads to state-of-the-art results for the problem with one truck and some understanding of the presented models' behavior on the version with multiple trucks. Some insights about future research are finally discussed.

关键词： Parallel Drone Scheduling Vehicle Routing Problems with cooperative drones Constraint programming mixed integer linear programming Parallel Drone Scheduling Traveling Salesman

来源：评论

学校读者我要写书评

暂无评论

Mathematical models and exact algorithms for the Colored Bin Packing Problem

引用

COMPUTERS & OPERATIONS RESEARCH 2024年 164卷

作者： Borges, Yulle G. F. Schouery, Rafael C. S. Miyazawa, Flavio K. Univ Estadual Campinas Inst Comp BR-13083852 Campinas SP Brazil

This paper focuses on exact approaches for the Colored Bin Packing Problem (CBPP), a generalization of the classical one-dimensional Bin Packing Problem in which each item has, in addition to its length, a color, and no two items of the same color can appear consecutively in the same bin. To simplify modeling, we present a characterization of any feasible packing of this problem in a way that does not depend on its ordering. This allows us to describe the problem with a simple mathematical model. Furthermore, we present four exact algorithms for the CBPP. First, we propose a generalization of Valerio de Carvalho's arc flow formulation for the CBPP using a graph with multiple layers, each representing a color. Second, we present an improved arc flow formulation that uses a more compact graph and has the same linear relaxation bound as the first formulation. And finally, we design two exponential set-partition models based on reductions to a generalized vehicle routing problem, which are solved by a branch-cut-and-price algorithm through VRPSolver. To compare the proposed algorithms, a varied benchmark set with 574 instances of the CBPP is presented. Experimental results show that our best model, the improved arc flow formulation, was able to solve instances of up to 500 items and 37 colors. The set-partition models are also shown to exceed their arc flow counterparts in instances with a very small number of colors.

关键词： Bin Packing Problem Arc flow VRPSolver mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A reformulation approach to resolving the inconsistency of max-min equations on fuzzy algebra

引用

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 2024年

作者： Li, Pingke Beijing Univ Technol Coll Econ & Management Beijing Peoples R China

Modelling with fuzzy relations in approximate reasoning is obstructed sometimes by the inconsistency of obtained fuzzy relational equations. This paper tackles the inconsistency resolving problem for a finite system of max-min equations by modifying only the right-hand side vector as slightly as possible with respect to the sum of absolute deviations. It is demonstrated that this problem may be reformulated equivalently as a polynomial-sized mixed integer linear programming problem. Although such a reformulation results in a problem of much larger size than its original compact form, it may be solved to optimality on instances of moderate size or even large size by an off-the-shelf solver for mixed integer linear programming and in some sense does not require a tailored solving method.

关键词： Fuzzy relational equations inconsistency mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Solving a real-life multi-period trailer-truck waste collection problem with time windows

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年第PartA期237卷

作者： Van Engeland, Jens Lavigne, Carolien Belien, Jeroen De Jaeger, Simon Katholieke Univ Leuven Inst Mobil Leuven Belgium Katholieke Univ Leuven Fac Econ & Business Ctr Econ & Corp Sustainabil Campus Brussels Brussels Belgium Katholieke Univ Leuven Fac Econ & Business Operat Management Res Grp Campus Brussels Brussels Belgium

By introducing local recovery networks, regional and local environmental authorities can play an important role in facilitating the circular economy. This paper studies a network design problem that encompasses the recovery of separately collected household waste streams, which are collected in containers at civic amenity sites. We formulate a generic tactical-operational container collection problem that will be solved using a mixed integer linear programming approach. This paper makes both a theoretical and practical contribution. We are the first to study a two container vehicle capacity restriction combined with collection site inventory capacities, time windows, shift break time, and shift duration constraints. The model is applied to a number of real-life test instances and scenarios. The results provide insight in how different combinations of scenarios exactly affect the fleet requirements. This not only includes the number of trucks or information under which circumstances an additional truck would (not) be needed, but also the 12-day collection schedule for the collection crews.

关键词： Container collection Waste management mixed integer linear programming optimization Tactical-operational planning

来源：评论

学校读者我要写书评

暂无评论

Optimal dispatch of BESS-fed virtual power lines under transmission congestion and bulk renewable generation

引用

ELECTRIC POWER SYSTEMS RESEARCH 2024年 229卷

作者： Nanou, Sotirios I. Psarros, Georgios N. Natl Tech Univ Athens NTUA Sch Elect & Comp Engn 9 Iroon Polytech str Athens 15780 Greece

This paper presents a mixed-integer linear programming (MILP) unit commitment (UC) model for the envisaged virtual power line (VPL) concept, which relies on a coordinated power flow control between two battery energy storage stations (BESS) that are strategically positioned at the supply and demand side of critical transmission line corridors which could exhibit congestion in case of large scale deployment of renewable energy source (RES) stations. The proposed VPL model includes MILP constraints governing the charge/discharge mode of each BESS unit in relation to power flow constraints as well as the availability of RES power. The VPL functionality is further augmented by allocating fast-acting reserves that can be released upon detection of critical line outages, in order to provide virtual power flows through the paired BESS units. As a proof of concept, a 6-bus and the IEEE RTS-79 test system are tested under bulk RES generation. The MILP-UC model is built in GAMS software and detailed UC schedules are assessed in order to demonstrate the potential benefits that VPLs can offer as storage as a transmission-only assets (SATOAs).

关键词： Virtual power line Unit commitment mixed integer linear programming Battery energy storage station

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：