检索结果-南通市图书馆

Weapon configuration, allocation and route planning with time windows for multiple unmanned combat air vehicles

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2018年第5期29卷 953-968页

作者： ZHANG Jiaming LIU Zhong SHI Jianmai CHEN Chao Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology

Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.

关键词： unmanned combat air vehicles(UCAVs) mission planning route planning weapon configuration time windows

Robust Electric Vehicle Routing Problem with time windows under Demand Uncertainty and Weight-Related Energy Consumption

在线全文

学校读者我要写书评

暂无评论

Complex System Modeling and Simulation 2022年第1期2卷 18-34页

作者： Yindong Shen Leqin Yu Jingpeng Li Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China Division of Computer Science and Mathematics University of StirlingStirlingFK94LAUK

Vehicle routing problem with time windows(VRPTW)is a core combinatorial optimization problem in distribution *** electric vehicle routing problem with time windows under demand uncertainty and weight-related energy consumption is an extension of the *** some researchers have studied either the electric VRPTW with nonlinear energy consumption model or the impact of the uncertain customer demand on the conventional vehicles,the literature on the integration of uncertain demand and energy consumption of electric vehicles is still ***,practically,it is usually not feasible to ignore the uncertainty of customer demand and the weight-related energy consumption of electronic vehicles(EVs)in actual ***,we propose the robust optimization model based on a route-related uncertain set to tackle this ***,adaptive large neighbourhood search heuristic has been developed to solve the problem due to the NP-hard nature of the *** effectiveness of the method is verified by experiments,and the influence of uncertain demand and uncertain parameters on the solution is further explored.

关键词： electric vehicle routing problem time windows uncertain demand energy consumption model robust optimization adaptive large neighbourhood search

A GA approach to vehicle routing problem with time windows considering loading constraints

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2017年第1期23卷 54-62页

作者：刘建胜 Luo Zhiwen Duan Duanzhi Lai Zhihui Huang Jiali School of Mechanical and Electronic Engineering Nanchang University School of Management Shandong University

As a new variant of vehicle routing problem( VRP),a finished vehicle routing problem with time windows in finished vehicle logistics( FVRPTW) is modeled and solved. An optimization model for FVRPTW is presented with the objective of scheduling multiple transport routes considering loading constraints along with time penalty function to minimize the total cost. Then a genetic algorithm( GA) is developed. The specific encoding and genetic operators for FVRPTW are ***,in order to accelerate its convergence,an improved termination condition is given. Finally,a case study is used to evaluate the effectiveness of the proposed algorithm and a series of experiments are conducted over a set of finished vehicle routing problems. The results demonstrate that the proposed approach has superior performance and satisfies users in practice. Contributions of the study are the modeling and solving of a complex FVRPTW in logistics industry.

关键词： finished vehicle logistics (FVL) vehicle routing problem (VRP) genetic algo-rithm (GA) time windows

REFINEMENTS OF THE COLUMN GENERATION PROCESS FOR THE VEHICLE ROUTING PROBLEM WITH time windows

在线全文

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 2004年第3期13卷 326-341页

作者： Jesper LARSEN Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs.LyngbyDenmark

The Vehicle Routing Problem with time windows is a generalization of the well knowncapacity constrained Vehicle Routing Problem.A homogeneous fleet of vehicles has to service a setof *** service of the customers can only start within a weU-defined time intervaldenoted the time *** objective is to determine routes for the vehicles that minimizes theaccumulated cost(or distance).Currently the best approaches for determining optimal solutions arebased on column generation and Branch-and-Bound,also known as *** paperpresents two ideas for ran-time improvements of the Branch-and-Price framework for the VehicleRouting Problem with time *** ideas reveal a significant potential for run-timerefinements when speeding up an exact approach without compromising optimality.

关键词： Vehicle routing time windows column generation shortest path branch-and-bound

Model and Algorithm for the Berth Allocation Problem with time windows

在线全文

学校读者我要写书评

暂无评论

Model and Algorithm for the Berth Allocation Problem with Ti...

2009中国控制与决策会议

作者： QIN Jin~(1,2) MIAO Li-xin~1 SHI Feng~2 CHEN Chang-bin~1 1 Research Center for Logistics,Graduate School at Shenzhen,Tsinghua University,Shenzhen 518055 2 School of Traffic and Transportation Engineering,CentralSouth University,Changsha,410075

＜正＞The berth allocation problem studies the optimal scheduling of assigning arrival ships to berths along a quay in container *** objective is to minimize the total service time for all ships in the planning *** time window constraints on the service time of ships and the available time of berth are considered in this *** a new model and a heuristic based on the Tabu Search algorithm are developed for this berth allocation problem with time *** conduct eight computational experiments which showed that the proposed algorithm is adaptable to the real world *** for larger sizes it is always better than the CPLEX on computational time. So this method may be helpful in the efficient management of busy terminals during extreme peaking conditions.

关键词： berth allocation container terminal optimal model time windows tabu search.

Model and Algorithm of Multi-depot Container Truck Transportation with time windows

在线全文

cnki会议

学校读者我要写书评

暂无评论

Model and Algorithm of Multi-depot Container Truck Transport...

2009中国控制与决策会议

作者： Won Young Yun Department of Industrial Engineering Pusan National UniversityBusan 609-735Korea

＜正＞A multi-depot container truck transportation problem with time windows is studied in this *** types of transportation resources as trucks and containers and four types of container movements as inbound/outbound full and inbound/outbound empty movements are *** problem is formulated as a graph and then mathematically modeled as a multi-traveling salesman problem with time windows（m-TSPTW） with multiple depots.A reactive tabu search（RTS） algorithm is developed and tested based on a number of randomly generated *** results compared with the commercial tool CPLEX indicate that the RTS algorithm can find the optimum solutions of small-sized examples in short ***,the algorithm is robust and stable to solve large-sized example.

关键词： Container movement traveling salesman problem(TSP) time windows tabu search(TS) multiple depots

Modeling and Solving the Public Transport Driver Scheduling Problem with time windows

在线全文

cnki会议

学校读者我要写书评

暂无评论

Modeling and Solving the Public Transport Driver Scheduling ...

第二十四届中国控制会议

作者： Raymond S. K. Kwan University of Leeds.Leeds LS2 9JT.UK

＜正＞ The public transport driver scheduling problem known to be NP-hard is customarily modeled by Integer Linear Programming （ILP） model. The ILP-based approach involves generating a set of legal potential driver duties from which a minimal and most efficient subset is selected. Filtering rules are often applied and time windows have to be simplified into one or two discrete times so that the set of potential duties generated would not be prohibitively large. The resultant model solved therefore diverts from the true real-life setting and optimality is compromised. This paper presents a realistic model. which represents the driver scheduling problem instead of fitting the problem to an existing model, e.g. ILP model. Based on the model a constrictive approach employing Tabu Search is designed. Filtering rules are unnecessary under this approach while time windows can be handled. Solutions obtained might be better serving the real problems and therefore more acceptable.

关键词： public transport scheduling driver scheduling tabu search time windows modeling

An Evolutionary Ant Colony Algorithm for a Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Hard time windows

在线全文

cnki会议

学校读者我要写书评

暂无评论

An Evolutionary Ant Colony Algorithm for a Vehicle Routing P...

第30届中国控制与决策会议

作者： Xingcheng Pu Keli Wang School of Computer Science Chongqing University of Posts and Telecommunications

In order to minimize the travel distance, an evolutionary ant colony algorithm(EAC) has been developed to solve the vehicle routing problem with simultaneous pick-up and delivery and hard time windows(VRPSPDHTW). In this algorithm, a candidate set is used to reduce the amount of computation while improving the quality of the solution. time window factor and demand factor are added to the state transition rules in order to find the most suitable customer. By using a shuffled complex evolution algorithm, ant colony is optimized selectively. Experiment shows that this strategy not only reduces the amount of computation, but also avoids falling into local optima. A new method for updating pheromones is presented, and the local search methods are used to further optimize the solutions. Numerical examples show that the presented algorithm is effective for handling VRPSPDHTW.

关键词： Ant Colony Shuffled Complex Evolutionary Vehicle Routing Simultaneous Pick-up and Delivery time windows

Designing a locating-routing three-echelon supply chain network under uncertainty

在线全文

cnki会议

学校读者我要写书评

暂无评论

International Journal of Intelligent Computing and Cybernetics 2022年第4期15卷 562-588页

作者： Leila Hashemi Armin Mahmoodi Milad Jasemi Richard C.Millar Jeremy Laliberte Department of Industrial Management Islamic Azad University South Tehran BranchTehranIslamic Republic of Iran Department of Industrial Management Islamic Azad University ofMasjid-i-SoliemanMasjid-i-SoliemanIslamic Republic of Iran Stephens College of Business University of MontevalloMontevalloAlabamaUSA Department of Engineering Management and Systems Engineering The George Washington UniversityWashingtonDistrict of ColumbiaUSA Department of Mechanical and Aerospace Engineering Carleton UniversityOttawaCanada

Purpose-In the present research,location and routing problems,as well as the supply chain,which includes manufacturers,distributor candidate sites and retailers,are *** goal of addressing the issue is to reduce delivery times and systemcosts for retailers so that routing and distributor locationmay be ***/methodology/approach-By adding certain unique criteria and limits,the issue becomes more *** expect simultaneous deliveries and pickups,and retail service start times have soft and hard time *** expenses,noncompliance with the soft time window,distributor construction,vehicle purchase or leasing,andmanufacturing costs are all part of the system *** problem’s conceptual model is developed and modeled first,and then General Algebraic Modeling System software(GAMS)and Multiple Objective Particle Swarm Optimization(MOPSO)and non-dominated sorting genetic algorithm II(NSGAII)algorithms are used to solve it in small ***-According to the mathematical model’s solution,the average error of the two suggested methods,in contrast to the exact answer,is less than 0.7%.In addition,the performance of algorithms in terms of deviation from the GAMS exact solution is pretty satisfactory,with a divergence of 0.4%for the biggest problem(N 5100).As a result,NSGAII is shown to be superior to *** limitations/implications-Since this paper deals with two bi-objective models,the priorities of decision-makers in selecting the best solution were not taken into account,and each of the objective functions was given an equal weight based on the weighting *** model has not been compared or studied in both robust and deterministic *** is because,with the exception of the variable that indicates traffic mode uncertainty,all variables are deterministic,and the uncertainty character of demand in each level of the supply chain is *** implications-The suggested model’s conclusions

关键词： Metaheuristic algorithms time windows Supply chain management Robust optimization Location-routing problems