A branch-and-bound algorithm for the time-Dependent rural postman problem

2019 ◽  
Vol 102 ◽  
pp. 150-157 ◽  
Author(s):  
Tobia Calogiuri ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero ◽  
Renata Mansini
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Time Dependent ◽  
Rural Postman Problem

scholarly journals Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
M. Huang ◽  
Huaping Wu ◽  
Vincent Cho ◽  
W. H. Ip ◽  
Xingwei Wang ◽  
...  
Keyword(s):  
Branch And Bound ◽  
Heuristic Algorithm ◽  
Single Machine ◽  
Single Machine Scheduling ◽  
Branch And Bound Algorithm ◽  
Time Dependent ◽  
Reasonable Time ◽  
Special Cases ◽  
Short Time ◽  
Error Percentage

The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed. A branch and bound algorithm and a heuristic algorithm are used in the solution, and two special cases are also examined. The computational experiments show that, for the situation with a rate-modifying activity, the proposed branch and bound algorithm can solve situations with 50 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal solution with an error percentage less than 0.053 in a very short time. In situations with multi-rate-modifying activities, the proposed branch and bound algorithm can solve the case with 15 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal with an error percentage less than 0.070 in a very short time. The branch and bound algorithm and the heuristic algorithm are both shown to be efficient and effective.

A branch-and-bound algorithm for the time-dependent travelling salesman problem

Networks ◽  
2018 ◽  
Vol 72 (3) ◽  
pp. 382-392 ◽  
Author(s):  
Anna Arigliano ◽  
Tobia Calogiuri ◽  
Gianpaolo Ghiani ◽  
Emanuela Guerriero
Keyword(s):  
Branch And Bound ◽  
Travelling Salesman Problem ◽  
Branch And Bound Algorithm ◽  
Time Dependent ◽  
Travelling Salesman

Unit Commitment Solution by Branch and Bound Algorithm

2020 ◽  
Author(s):  
Bishaljit Paul ◽  
Sushovan Goswami ◽  
Dipu Mistry ◽  
Chandan Kumar Chanda
Keyword(s):  
Branch And Bound ◽  
Unit Commitment ◽  
Branch And Bound Algorithm

scholarly journals Identification of mechanical properties of arteries with certification of global optimality

2021 ◽  
Author(s):  
Jan-Lucas Gade ◽  
Carl-Johan Thore ◽  
Jonas Stålhand
Keyword(s):  
Global Solution ◽  
Branch And Bound ◽  
Clinical Data ◽  
Minimization Problem ◽  
Branch And Bound Algorithm ◽  
Stationary Points ◽  
Model Parameters ◽  
Global Optimality ◽  
Clinical Value ◽  
Non Linear

AbstractIn this study, we consider identification of parameters in a non-linear continuum-mechanical model of arteries by fitting the models response to clinical data. The fitting of the model is formulated as a constrained non-linear, non-convex least-squares minimization problem. The model parameters are directly related to the underlying physiology of arteries, and correctly identified they can be of great clinical value. The non-convexity of the minimization problem implies that incorrect parameter values, corresponding to local minima or stationary points may be found, however. Therefore, we investigate the feasibility of using a branch-and-bound algorithm to identify the parameters to global optimality. The algorithm is tested on three clinical data sets, in each case using four increasingly larger regions around a candidate global solution in the parameter space. In all cases, the candidate global solution is found already in the initialization phase when solving the original non-convex minimization problem from multiple starting points, and the remaining time is spent on increasing the lower bound on the optimal value. Although the branch-and-bound algorithm is parallelized, the overall procedure is in general very time-consuming.

Sign in / Sign up

Export Citation Format

Share Document