Journal of Heuristics最新文献_第5页

Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs 调度具有存储资源和分段线性成本的耗能任务的上界和下界

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2022-01-27 DOI: 10.1007/s10732-021-09486-w

Sandra Ulrich Ngueveu, Christian Artigues, Nabil Absi, Safia Kedad-Sidhoum

{"title":"Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs","authors":"Sandra Ulrich Ngueveu, Christian Artigues, Nabil Absi, Safia Kedad-Sidhoum","doi":"10.1007/s10732-021-09486-w","DOIUrl":"https://doi.org/10.1007/s10732-021-09486-w","url":null,"abstract":"This paper considers the problem of scheduling a set of time- and energy-constrained preemptive tasks on a discrete time horizon. At each time period, the total energy required by the tasks that are in process can be provided by two energy sources: a reversible one and a non-reversible one. The non-reversible energy source can provide an unlimited amount of energy for a given period but at the expense of a time-dependent piecewise linear cost. The reversible energy source is a storage resource. The goal is to schedule each task preemptively inside its time window and to dispatch the required energy to the sources at each time period, while satisfying the reversible source capacity constraints and minimizing the total cost. We propose a mixed integer linear program of pseudo-polynomial size to solve this NP-hard problem. Acknowledging the limits of this model for problem instances of modest size, we propose an iterative decomposition matheuristic to compute an upper bound. The method relies on an efficient branch-and-price method or on a local search procedure to solve the scheduling problem without storage. The energy source allocation problem for a fixed schedule can in turn be solved efficiently by dynamic programming as a particular lot-sizing problem. We also propose a lower bound obtained by solving the linear programming relaxation of a new extended formulation by column generation. Experimental results show the quality of the bounds compared to the ones obtained using mixed integer linear program.","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"37 6","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A new heuristic for finding verifiable k-vertex-critical subgraphs 一种寻找可验证k顶点临界子图的新启发式算法

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2022-01-24 DOI: 10.1007/s10732-021-09487-9

Alex Gliesch, M. Ritt

引用次数: 0

Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints 利用状态空间最短路径启发式算法求解受服务时数约束的长途点到点车辆路径和驾驶员调度问题

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2022-01-10 DOI: 10.1007/s10732-021-09489-7

De Genaro Chiroli, Daiane Maria, Mayerle, Sérgio Fernando, de Figueiredo, João Neiva

{"title":"Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints","authors":"De Genaro Chiroli, Daiane Maria, Mayerle, Sérgio Fernando, de Figueiredo, João Neiva","doi":"10.1007/s10732-021-09489-7","DOIUrl":"https://doi.org/10.1007/s10732-021-09489-7","url":null,"abstract":"This paper addresses the vehicle routing and driver scheduling problem of finding a low cost route and stoppage schedule for long-haul point-to-point full-load trips with intermediate stops due to refueling needs and driver hours-of-service regulatory restrictions. This is an important problem for long-haul truck drivers because in practice regulatory driving limits often do not coincide with availability of stoppage alternatives for quick rest, for meal, for overnight, or for weekly downtime required stops. The paper presents a methodology and algorithm to pick routes that optimize stoppages within the HOS constraints, an important factor of both highway safety and driver productivity. A solution for this variant of the vehicle routing and truck driver scheduling problem (VRTDS-HOS) that is fast enough to potentially be used in real time is proposed by modeling possible stoppage configurations as nodes in an iteratively built multi-dimensional state-space graph and by using heuristics to decrease processing time when searching for the lowest-cost path in that graph. Individual nodes in the graph are characterized by spatial, temporal, and stoppage attributes, and are expanded sequentially to search for low-cost paths between the origin and the destination. Within this multi-dimensional state-space graph, the paper proposes two heuristics applied to a shortest-path algorithmic solution based on the (A^*) algorithm to increase processing speed enough to potentially permit real-time usage. An illustrative application to Brazilian regulations is provided. Results were successful and are reported together with sensitivity analyses comparing alternative routes and different heuristics processing speeds.\u0000","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Intersections management for autonomous vehicles: a heuristic approach 自动驾驶汽车交叉口管理:一种启发式方法

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2022-01-09 DOI: 10.1007/s10732-021-09488-8

Silva, Victor, Siebra, Clauirton, Subramanian, Anand

引用次数: 1

Constraint-guided evolutionary algorithm for solving the winner determination problem 求解赢家确定问题的约束引导进化算法

IF 2.7 4区计算机科学

Journal of Heuristics Pub Date : 2021-09-23 DOI: 10.1007/s10732-021-09485-x

Fernanda Nakano Kazama, A. Araujo, Paulo de Barros Correia, E. Guerrero-Peña

引用次数: 2

Randomized rounding algorithms for large scale unsplittable flow problems 大规模不可拆分流问题的随机舍入算法