排序方式: 共有67条查询结果,搜索用时 312 毫秒
51.
The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. In this paper we propose to solve this NP-hard problem using an adaptive search method related to the Tabu Search metaheuristic. Numerical results on large scale linear BLPs are presented. 相似文献
52.
Jamal?OuennicheEmail author Prasanna?K.?Ramaswamy Michel?Gendreau 《The Journal of the Operational Research Society》2017,68(11):1377-1398
In practice, solving realistically sized combinatorial optimization problems to optimality is often too time-consuming to be affordable; therefore, heuristics are typically implemented within most applications software. A specific category of heuristics has attracted considerable attention, namely local search methods. Most local search methods are primal in nature; that is, they start the search with a feasible solution and explore the feasible space for better feasible solutions. In this research, we propose a dual local search method and customize it to solve the traveling salesman problem (TSP); that is, a search method that starts with an infeasible solution, explores the dual space—each time reducing infeasibility, and lands in the primal space to deliver a feasible solution. The proposed design aims to replicate the designs of optimal solution methodologies in a heuristic way. To be more specific, we solve a combinatorial relaxation of a TSP formulation, design a neighborhood structure to repair such an infeasible starting solution, and improve components of intermediate dual solutions locally. Sample-based evidence along with statistically significant t-tests support the superiority of this dual design compared to its primal design counterpart. 相似文献
53.
Marchand Alexia Gendreau Michel Blais Marko Guidi Jonathan 《Computational Management Science》2019,16(3):501-519
Computational Management Science - To operate a large-scale hydropower production system in an ever-changing environment, operating rules are a convenient way of communication between short-term... 相似文献
54.
55.
56.
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows 总被引:3,自引:0,他引:3
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint programming which allow an efficient search of such neighborhoods. The advantages of using a large neighborhood are not only the increased probability of finding a better solution at each iteration but also the reduction of the need to invoke specially-designed methods to avoid local minima. These operators are combined in a variable neighborhood descent in order to take advantage of the different neighborhood structures they generate. 相似文献
57.
Roxane Kouassi Michel Gendreau Jean-Yves Potvin Patrick Soriano 《Journal of Heuristics》2009,15(4):381-402
In this paper, different heuristics are devised to solve a multi-period capacity expansion problem for a local access telecommunications
network with a tree topology. This expansion is done by installing concentrators at the nodes and cables on the links of the
network. The goal is to find a least cost capacity expansion strategy over a number of periods to satisfy the demand. A local
search heuristic is first proposed to improve previously reported results on problem instances based on different cost and
demand structures. This heuristic is then integrated into a genetic algorithm to obtain further improvements. 相似文献
58.
Alireza Rahimi-Vahed Teodor Gabriel Crainic Michel Gendreau Walter Rei 《Journal of Heuristics》2013,19(3):497-524
In this paper, we consider a multi-depot periodic vehicle routing problem which is characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods, and two types of constraints that are often found in reality, i.e., vehicle capacity and route duration constraints. The objective is to minimize total travel costs. To tackle the problem, we propose an efficient path relinking algorithm whose exploration and exploitation strategies enable the algorithm to address the problem in two different settings: (1) As a stand-alone algorithm, and (2) As a part of a co-operative search algorithm called integrative co-operative search. The performance of the proposed path relinking algorithm is evaluated, in each of the above ways, based on standard benchmark instances. The computational results show that the developed PRA performs well, in both solution quality and computational efficiency. 相似文献
59.
In this paper, we propose a methodology for branch-and-cut-and-price when cuts and columns are generated simultaneously. The methodology is illustrated with two application cases: the Split Delivery Vehicle Routing Problem (SDVRP) and the Bus Rapid Transit Route Design Problem (BRTRDP). 相似文献
60.
We have studied the adsorption of human serum albumin and human gamma globulins onto a polyurethane (Pellethane 2363-80A) using an attenuated total reflectance (ATR) flow cell. Spectra of the proteins adsorbed onto the polyurethane surface, and of the same proteins in solution were collected for comparison. Significant spectral differences between the solution and surface adsorbed spectra of both proteins were observed. 相似文献