Relief resource such as food, drinking water and other emergency living materials need to be updated regularly during a certain period of warranty. Therefore, this kind of emergency resource reserve needs to consider ...
详细信息
Relief resource such as food, drinking water and other emergency living materials need to be updated regularly during a certain period of warranty. Therefore, this kind of emergency resource reserve needs to consider both the daily management cost and the emergency supply guarantee. In order to study the joint of the physical reserve of emergency materials and agreement reserve, a hybrid integerprogramming model is established by selecting a supermarket around the shelter as a protocol supplier for a storage period of the shelter. In the case of limited investment in emergency management funds, the number of storage materials in the shelters and surrounding supermarkets is determined, and the Lingo software is used to solve the problem. Finally, the validity of the model is verified by an example.
Based on observations made in a cabinet manufacturing plant, a multi-objective mixed integer programming model for coordinated warehouse order picking and production scheduling is proposed. To minimize production make...
详细信息
Based on observations made in a cabinet manufacturing plant, a multi-objective mixed integer programming model for coordinated warehouse order picking and production scheduling is proposed. To minimize production makespan and total picking time in the warehouse, a non-dominated sorting GA-II (NSGA-II) with a modified PMX crossover and inverse, insert, swap mutation operators is used. Compared to the solutions found by Gurobi 7.0, GA obtains a more diverse and higher quality set of non-dominated solutions. Moreover, it is observed (but not proved) that in an optimal solution, the sequence of jobs and that of picking components for those jobs are structurally related.
An algorithm is developed to optimize vehicle speed trajectory over multiple signalized intersections with known traffic signal information to minimize fuel consumption and travel time, and to meet ride comfort requir...
详细信息
ISBN:
(纸本)9781509045839
An algorithm is developed to optimize vehicle speed trajectory over multiple signalized intersections with known traffic signal information to minimize fuel consumption and travel time, and to meet ride comfort requirements using sequential convex optimization method. A comparison between the proposed method and dynamic programming is carried out to verify its optimality. In addition, vehicle motion during turning is studied because of its significant effect on fuel consumption and travel time.
Model predictive control (MPC) is recognized as a very versatile and effective way of controlling constrained hybrid dynamical systems in closed-loop. The main drawback of hybrid MPC is the heavy computation burden of...
详细信息
ISBN:
(纸本)9781424414970
Model predictive control (MPC) is recognized as a very versatile and effective way of controlling constrained hybrid dynamical systems in closed-loop. The main drawback of hybrid MPC is the heavy computation burden of the associated on-line mixed-integer optimization. Explicit MPC solutions overcome such a problem by rewriting the control law in piecewise affine form, but are limited to relatively simple hybrid control problem setups. This paper presents an alternative approach for reducing the complexity of computations by suitably constraining the mode sequence over the prediction horizon, so that on-line optimization is solved more quickly. While tracking performance of the feedback loop may be affected because of the suboptimality of the approach, closed-loop stability is guaranteed. The effectiveness of the method is demonstrated by an example.
The problem of distribution centers location with multiple practical constraints,such as soft service time window,rigid work time window,vehicle being reused and so on,is shown ***,a multi-factor integrated optimizati...
详细信息
The problem of distribution centers location with multiple practical constraints,such as soft service time window,rigid work time window,vehicle being reused and so on,is shown ***,a multi-factor integrated optimization model is given,which not only optimizes distribution centers location and vehicle routes,but also meets all the multiple practical constraints.A bi-level nested genetic algorithm is proposed thirdly,where the design of the lower algorithm meets various constraints of ***,the feasibility of the model and the efficiency of the algorithm are tested by a numerical example.
Extended formulations are given for the single item uncapacitated lot-sizing problem with backlogging, piecewise linear concave production costs, sales with piecewise linear selling prices and start-up costs. Without ...
详细信息
Extended formulations are given for the single item uncapacitated lot-sizing problem with backlogging, piecewise linear concave production costs, sales with piecewise linear selling prices and start-up costs. Without start-up costs, the formulation is shown to be tight. With start-up costs, it is conjectured that the formulations given are tight. Computational results are presented suggesting that certain multi-item instances with joint small or big bucket capacity constraints can be solved using these reformulations.
Wind power bidding is critical for wind power producers operations in an electricity market. Due to the uncertainly and variability of wind power output, some markets impose a penalty on the deviation between the wind...
详细信息
ISBN:
(纸本)9781457710001
Wind power bidding is critical for wind power producers operations in an electricity market. Due to the uncertainly and variability of wind power output, some markets impose a penalty on the deviation between the wind power bids in the day-ahead market and the real wind power output in the real-time market. The objective of a wind power producers bidding problem is to maximize the producers profit while minimizing the penalty and ensuring the output from its wind farms can be utilized to the largest extent. In this paper, we present a wind power bidding strategy based on chance-constrained optimization. The chance constraint is used to define the probability that certain amount of wind power bid into the market can be accepted. We formulate the problem as a chance-constrained two-stage (CCTS) stochastic optimization program. The second stage represents the many possible realizations of wind power output by scenarios. We also consider pumped-storage hydro power plants as storage to accommodate the fluctuation of wind power. Sample Average Approximation (SAA) is used to solve the problem. Numerical examples are also provided.
This paper builds a mixed integer programming model for the VRPSPD. An Ant Colony System (ACS) approach combining with the pheromone updating strategy of ASRank and MMAS ant algorithm is proposed. The initial vehicle ...
详细信息
This paper builds a mixed integer programming model for the VRPSPD. An Ant Colony System (ACS) approach combining with the pheromone updating strategy of ASRank and MMAS ant algorithm is proposed. The initial vehicle load is designed to be a random value correlated to the delivery and pick-up demands of the rest clients. The experimental results show that the approach could improve the vehicle load rate and get rid of the added total distance caused by fluctuating load and maximum capacity constraint. It could obtain the satisfied solution with high convergence speed in an acceptable time.
Molten iron transportation in an iron and steel enterprise involve moving loaded torpedo cars with hot molten iron and empty torpedo cars by locomotives between blast furnaces and steelmaking plants. This paper consid...
详细信息
ISBN:
(纸本)9781424415304;1424415306
Molten iron transportation in an iron and steel enterprise involve moving loaded torpedo cars with hot molten iron and empty torpedo cars by locomotives between blast furnaces and steelmaking plants. This paper considers the locomotive scheduling problem, one of the most complex routing problems where both pickup and delivery operations are included. It consists in finding one feasible schedule for each locomotive in order to satisfy all moving requests and in such a way that the concerned costs are minimized. We consider a set-partitioning model of such problem whose columns represent locomotive schedules. We then apply a column generation algorithm for solving the LP relaxed model and a branch and bound algorithm for obtaining integer solutions. Computational experiments demonstrate that the proposed algorithm is capable of solving problems with industrial size to optimality within a reasonable computation time.
Fast web service selection approach is crucial for seamless and dynamic integration of e-business applications. However, since existing service selection approaches take up a lot of time, this make service selection o...
详细信息
Fast web service selection approach is crucial for seamless and dynamic integration of e-business applications. However, since existing service selection approaches take up a lot of time, this make service selection out of time control. In this paper, we propose a fast web service selection(FWSS) approach for service composition system in e-business. In FWSS, only those services that fit to the context of users are valid candidates for the composition, and then mixed integer programming is used to find the most suitable service from above services. Experimental results show that our approach can fast perform service selection for web service composition.
暂无评论