There is a big gap between theoretical research and practical application of reference network planning. Most of the existing planning models in academic research take cost as the objective function. Although various ...
详细信息
ISBN:
(纸本)9798350349047;9798350349030
There is a big gap between theoretical research and practical application of reference network planning. Most of the existing planning models in academic research take cost as the objective function. Although various advanced models and methods are proposed based on this, they are rarely applied in actual power companies. In this paper, a new reference network planning model is proposed according to the actual demand. According to the field investigation, "power supply to the nearest load" is taken as the goal, and the load moment is expressed analytically. In order to meet the increasing demand of renewable energy integrating into the power grid, the concept of acceptable disturbance range is added to the model constraint to improve the system's absorption capacity of renewable energy. Finally, the N-1 security constraint is considered to improve the reliability of the model. The model is transformed into a mixed integer linear programming (MILP)problem by priority objective programming method and can be solved with mature commercial solvers. The validity of the model is verified by IEEE-RTS24 node system. When N-1 safety constraints are taken into account, the advantages of the proposed model become apparent, with a total cost reduction of about 2.5%.
The paper proposes a generative pedestrian trajectory modeling framework named HISS - Human Interactions in Shared Space. The trajectory modeling framework is based on a receding horizon optimization approach utilizin...
详细信息
The paper proposes a generative pedestrian trajectory modeling framework named HISS - Human Interactions in Shared Space. The trajectory modeling framework is based on a receding horizon optimization approach utilizing pedestrian behavior and interactions that seeks to capture pedestrian trajectory planning and execution. The benefit of the proposed dynamic optimization trajectory generation approach is that it requires minimal calibration data under a variety of traffic scenarios. In this paper, we formalize several pedestrian-pedestrian interaction scenarios and implement trajectories' conflict avoidance through mixed integer linear programming (MILP). We validate the proposed framework on two benchmark datasets - DUT and TrajNet++. The paper shows that when the framework's parameters are tuned to certain initial conditions and pedestrian behavior and interaction rules, the framework generates pedestrian trajectories similar to those observable in real-world scenarios, justifying the framework's capability to provide explanations and solutions to various traffic situations. This feature makes the proposed framework useful for modelers and urban city planners in making policy decisions.
作者:
Wu, GuohongJiang, RuiBeijing Jiaotong Univ
Key Lab Transport Ind Big Data Applicat Technol Co Minist Transport Beijing Peoples R China Beijing Jiaotong Univ
Key Lab Transport Ind Big Data Applicat Technol Co Minist Transport Beijing 100044 Peoples R China
Trajectory smoothing design (TSD) may significantly reduce fuel consumption and improve driving comfort at intersections. In this paper, a mixed integer linear programming (MILP) model with discrete time is formulated...
详细信息
Trajectory smoothing design (TSD) may significantly reduce fuel consumption and improve driving comfort at intersections. In this paper, a mixed integer linear programming (MILP) model with discrete time is formulated to jointly optimize autonomous intersection management and TSD, aiming to improve traffic efficiency, fuel economy and driving comfort simultaneously. Driving safety of car-following and collision avoidance at conflict points, diverge points and converge points, as well as constraints of acceleration and jerk are considered. To reasonably describe vehicle movement within intersection areas, the vehicle trajectory within the intersection is treated as a channel considering the vehicle width. A rolling horizon framework is used to solve the model. We have compared the traffic efficiency, fuel economy, monetary cost and driving comfort of the joint optimization model with that of the state-of-the-art two-stage strategy. Finally, sensitivity analysis with respect to left-turn ratio, weighted coefficient of TSD and control zone length is conducted.
This work focuses on the driving strategy optimization problem of a scenario in which two trains come from two branches under virtual coupling, aiming at going through the junction area efficiently. A distance-discret...
详细信息
This work focuses on the driving strategy optimization problem of a scenario in which two trains come from two branches under virtual coupling, aiming at going through the junction area efficiently. A distance-discrete optimal control model is constructed. The optimization objective is to maximize the trip time during which the two trains operate in coupled state. The line conditions, dynamic properties of the trains and the safety protection constraints are considered. The nonlinear constraints are converted into linear constraints with piecewise affine function and logical variables, and the proposed problem is converted into mixed integer linear programming(MILP) problem which can be solved by existing solvers such as Cplex. Four simulation experiments are conducted to verify the effectiveness of MILP. The dynamic programming(DP) algorithm is used as the benchmark algorithm in the case study. Compared with DP algorithm in small state space, MILP has better performance since it shortens the coupling time. Moreover,the improvement of line capacity of virtual coupling is35.42% compared with the fixed blocking system.
This research extends the constrained vehicle routing problem concept to solve flexible flow shop scheduling problems. mixed-integerlinearprogramming and constraint programming formulations are developed for a flow ...
详细信息
This research extends the constrained vehicle routing problem concept to solve flexible flow shop scheduling problems. mixed-integerlinearprogramming and constraint programming formulations are developed for a flow shop problem with no-wait, time lags and release time restrictions to minimize the makespan in both permutation and non-permutation schedules. The comparative analysis of various models reveals that constraint programming models have superior computational performance than mixed-integerlinearprogramming models. However, the mixed-integerlinearprogramming models are also timely-efficient. Moreover, the efficiency of developed models is also represented in comparison with several benchmark datasets. Based on the findings, while the objective function values of the mixed-integerlinearprogramming and constraint programming models in non-permutation schedules exhibit lower values than their respective equivalents in permutation schedules, both models demonstrate longer runtime in non-permutation schedules. Results represent that the proposed constraint programming and mixed-integerlinearprogramming models are among the top three models of the benchmark datasets in terms of the number of decision variables and computational performance. One of the limitations of the research is that there is no comprehensive dataset in the literature considering all the restrictions in permutation and non-permutation schedules.
This paper studies the concept of synchromodal freight transportation. A mathematical model which minimizes the total duration and the CO2 emissions is presented along with a metaheuristic approach using Genetic Algor...
详细信息
ISBN:
(纸本)9783031686337;9783031686344
This paper studies the concept of synchromodal freight transportation. A mathematical model which minimizes the total duration and the CO2 emissions is presented along with a metaheuristic approach using Genetic Algorithm (GA). The model is validated on the instances based on the Seine axis river in France, which has a multitude of inland waterways and terminals. The GA obtains optimal solutions for small-sized instances and provides good enough solutions with a low deviation from the best-known solution in larger instances.
We study the construction of a transmit signal for downlink multi-user multiple-input single-output (MU-MISO) systems with cost-effective 1-bit digital-to-analog converters (DACs). In our earlier work, this challengin...
详细信息
ISBN:
(纸本)9798350393194;9798350393187
We study the construction of a transmit signal for downlink multi-user multiple-input single-output (MU-MISO) systems with cost-effective 1-bit digital-to-analog converters (DACs). In our earlier work, this challenging problem was formulated as a mixed integer linear programming (MILP) and solved through conventional LP relaxation. In this paper, we present a two-step iterative algorithm with an elegant performance-complexity tradeoff. The proposed algorithm can approach the performance of the LP-based method while reducing the computational complexity by 1/ log(N-t), where N-t is the number of transmit antennas. Via simulations, we demonstrate the effectiveness of the proposed algorithm.
Motivated by the safety of a manned aircraft while engaging a stationary target inside a restricted circular airspace, the problem of cooperative guidance for a team comprising a manned commander aircraft and an unman...
详细信息
ISBN:
(数字)9781624107115
ISBN:
(纸本)9781624107115
Motivated by the safety of a manned aircraft while engaging a stationary target inside a restricted circular airspace, the problem of cooperative guidance for a team comprising a manned commander aircraft and an unmanned wingman is considered. The commander employs proportional navigation guidance to approach the target and the wingman is proposed to use line-of-sight guidance to maintain its position along the line joining the commander and the target. After prosecuting the target, the wingman exits the airspace restriction while the commander avoids the airspace throughout the engagement. Simulations are carried out for various approach geometries. Results present the efficacy of the proposed guidance method.
Gates are natural bottlenecks between a container terminal and its hinterland. We consider here a truck assignment system to control the trucks arrivals and departures at the container terminal gate. From a carrier po...
详细信息
ISBN:
(纸本)9783031686337;9783031686344
Gates are natural bottlenecks between a container terminal and its hinterland. We consider here a truck assignment system to control the trucks arrivals and departures at the container terminal gate. From a carrier point of view, the routes for a fleet of vehicles have to be optimized in order to handle all requests in a daytime horizon. A request includes two operations: the pickup of one container followed by its delivery. Either the pickup or the delivery takes place in a terminal and one time slot has to be assigned to it. A gate capacity is set for each time slot and time windows are considered for each pickup and delivery operation. The objective is to minimize a combination of travel costs, waiting costs and time slot assignment cost. A mixed-integer mathematical program is proposed for this problem. Tests are run on realistic instances proposed by the SOGET company.
mixed integer linear programming is a powerful and widely used approach to solving optimization problems, but its expressiveness is limited. In this paper we introduce the optimization-aided language SCIMITAR, which e...
详细信息
ISBN:
(纸本)9798400712159
mixed integer linear programming is a powerful and widely used approach to solving optimization problems, but its expressiveness is limited. In this paper we introduce the optimization-aided language SCIMITAR, which encodes optimization problems using an expressive functional language, with a compiler that targets a mixedintegerlinear program solver. SCIMITAR provides easy access to encoding techniques that normally require expert knowledge, enabling solve-time conditional constraints, inlining, loop unrolling, and many other high-level language constructs. We give operational semantics for SCIMITAR and constraint encodings of various features. To demonstrate SCIMITAR, we present a number of examples and benchmarks including classic optimization domains and more complex problems. Our results indicate that SCIMITAR's use of a dedicated MILP solver is effective for expressively modeling optimization problems embedded within functional programs.
暂无评论