Branding/Logomark minus Citation Combined Shape Icon/Bookmark-empty Icon/Copy Icon/Collection Icon/Close Copy 7 no author result Created with Sketch. Icon/Back Created with Sketch. Match!
Juergen Branke
University of Warwick
59Publications
16H-index
2,202Citations
Publications 59
Newest
Published in OR Spectrum 1.87
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick),
Wen Zhang2
Estimated H-index: 2
(Warw.: University of Warwick)
Simulation optimisation offers great opportunities in the design and optimisation of complex systems. In the presence of multiple objectives, there is usually no single solution that performs best on all objectives. Instead, there are several Pareto-optimal (efficient) solutions with different trade-offs which cannot be improved in any objective without sacrificing performance in another objective. For the case where alternatives are evaluated on multiple stochastic criteria, and the performance...
Published on Apr 22, 2019in Flexible Services and Manufacturing Journal 2.52
Mustafa Demirbilek1
Estimated H-index: 1
(Warw.: University of Warwick),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick),
Arne K. Strauss8
Estimated H-index: 8
(Warw.: University of Warwick)
Human resource planning in home healthcare is gaining importance day by day since companies in developed and developing countries face serious nurse and caregiver shortages. In the problem considered in this paper, the decision of patient assignment must be made immediately when the patient request arrives. Once patients have been accepted, they are serviced at the same days, times and by same nurse during their episode of care. The objective is to maximise the number of patient visits for a set...
Published on Mar 1, 2019in Health Care Management Science 2.06
Mustafa Demirbilek1
Estimated H-index: 1
(Warw.: University of Warwick),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick),
Arne K. Strauss8
Estimated H-index: 8
(Warw.: University of Warwick)
The importance of home healthcare is growing rapidly since populations of developed and even developing countries are getting older and the number of hospitals, retirement homes, and medical staff do not increase at the same rate. We consider the Home Healthcare Nurse Scheduling Problem where patients arrive dynamically over time and acceptance and appointment time decisions have to be made as soon as patients arrive. The objective is to maximise the average number of daily visits for a single n...
Published on Dec 11, 2018
Jordan MacLachlan (Victoria University of Wellington), Yi Mei15
Estimated H-index: 15
(Victoria University of Wellington)
+ 1 AuthorsMengjie Zhang32
Estimated H-index: 32
(Victoria University of Wellington)
This paper uses a Genetic Programming Hyper-Heuristic (GPHH) to evolve routing policies for the Uncertain Capacitated Arc Routing Problem (UCARP). Given a UCARP instance, the GPHH evolves feasible solutions in the form of decision making policies which decide the next task to serve whenever a vehicle completes its current service. Existing GPHH approaches have two drawbacks. First, they tend to generate small routes by routing through the depot and refilling prior to the vehicle being fully load...
Published on Nov 1, 2018in European Journal of Operational Research 3.81
Michael Pearce2
Estimated H-index: 2
(Warw.: University of Warwick),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick)
Abstract This paper considers the problem of simultaneously identifying the optima for a (continuous or discrete) set of correlated tasks, where the performance of a particular input parameter on a particular task can only be estimated from (potentially noisy) samples. This has many applications, for example, identifying a stochastic algorithm’s optimal parameter settings for various tasks described by continuous feature values. We adapt the framework of Bayesian Optimisation to this problem. We...
Published on Jun 1, 2018in Genetic Programming and Evolvable Machines 1.33
Rinde R. S. van Lon4
Estimated H-index: 4
(Katholieke Universiteit Leuven),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick),
Tom Holvoet22
Estimated H-index: 22
(Katholieke Universiteit Leuven)
Dynamic pickup and delivery problems (PDPs) require online algorithms for managing a fleet of vehicles. Generally, vehicles can be managed either centrally or decentrally. A common way to coordinate agents decentrally is to use the contract-net protocol (CNET) that uses auctions to allocate tasks among agents. To participate in an auction, agents require a method that estimates the value of a task. Typically, this method involves an optimization algorithm, e.g. to calculate the cost to insert a ...
Published on Apr 3, 2018
Danial Yazdani9
Estimated H-index: 9
(LJMU: Liverpool John Moores University),
Trung Thanh Nguyen13
Estimated H-index: 13
(LJMU: Liverpool John Moores University)
+ 1 AuthorsJin Wang1
Estimated H-index: 1
(LJMU: Liverpool John Moores University)
Dynamic optimization problems (DOPs) are problems that change over time and many real-world problems are classified as DOPs. However, most of investigations in this domain are focused on tracking moving optima (TMO) without considering any other objectives which creates a gap between real-world problems and academic research in this area. One of the important optimization objectives in many real-world problems is previous-solution displacement restriction (PSDR) in which successive solutions sho...
Published on Apr 1, 2018in European Journal of Operational Research 3.81
Nalan Gulpinar9
Estimated H-index: 9
(Warw.: University of Warwick),
Ethem Çanakoğlu7
Estimated H-index: 7
(BAU: Bahçeşehir University),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick)
This paper deals with a stochastic multi-period task-resource allocation problem. A team of agents with a set of resources is to be deployed on a multi-period mission with the goal to successfully complete as many tasks as possible. The success probability of an agent assigned to a task depends on the resources available to the agent. Unsuccessful tasks can be tried again at later periods. While the problem can in principle be solved by dynamic programming, in practice this is computationally pr...
Published on Jan 1, 2018in Informs Journal on Computing 1.85
Robin Ball44
Estimated H-index: 44
(Warw.: University of Warwick),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick),
Stephan Meisel8
Estimated H-index: 8
(WWU: University of Münster)
This paper proposes a simulated annealing variant for optimization problems in which the solution quality can only be estimated by sampling from a random distribution. The aim is to find the solution with the best expected performance, as, e.g., is typical for problems where solutions are evaluated using a stochastic simulation. Assuming Gaussian noise with known standard deviation, we derive a fully sequential sampling procedure and decision rule. The procedure starts with a single sample of th...
Published on Dec 3, 2017
Michael Pearce2
Estimated H-index: 2
(Warw.: University of Warwick),
Juergen Branke16
Estimated H-index: 16
(Warw.: University of Warwick)
This paper considers the problem of identifying the best of a discrete set of alternatives for each of a set of correlated problem instances. We assume that the instances can be described by a set of continuous features and the performance of a particular alternative on a particular problem instance can only be estimated from noisy samples. A possible application is in manufacturing, where we would like to identify the best dispatching rule to be used depending on shop floor conditions, and perf...
1234567