Results 1 to 10 of about 31 (31)

A distributionally robust optimization approach for two-stage facility location problems

open access: yesEURO Journal on Computational Optimization, 2020
In this paper, we consider a facility location problem where customer demand constitutes considerable uncertainty, and where complete information on the distribution of the uncertainty is unavailable.
Arash Gourtani   +2 more
doaj   +1 more source

ε-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario

open access: yesEURO Journal on Computational Optimization, 2020
We consider a model of two parties’ competition organized as a Stackelberg game. The parties open their facilities intending to maximize profit from serving the customers that behave following a binary rule.
Vladimir Beresnev, Andrey Melnikov
doaj   +1 more source

A multi-period shelter location-allocation model with evacuation orders for flood disasters

open access: yesEURO Journal on Computational Optimization, 2016
Floods are a significant threat for several countries, endangering the safety and the well-being of populations. Civil protection authorities are in charge of flood emergency evacuation, providing means to help the evacuation and ensuring that people ...
Melissa Gama   +2 more
doaj   +1 more source

Robust flows with losses and improvability in evacuation planning

open access: yesEURO Journal on Computational Optimization, 2016
We consider a network flow problem, where the outgoing flow is reduced by a certain percentage in each node. Given a maximum amount of flow that can leave the source node, the aim is to find a solution that maximizes the amount of flow which arrives at ...
Marc Goerigk, IsmailaAbderhamane Ndiaye
doaj   +1 more source

Sink location to find optimal shelters in evacuation planning

open access: yesEURO Journal on Computational Optimization, 2016
The sink location problem is a combination of network flow and location problems: from a given set of nodes in a flow network a minimum cost subset W has to be selected such that given supplies can be transported to the nodes in W.
P. Heßler, H.W. Hamacher
doaj   +1 more source

Towards optimizing the deployment of optical access networks

open access: yesEURO Journal on Computational Optimization, 2014
In this paper we study the cost-optimal deployment of optical access networks considering variants of the problem such as fiber to the home (FTTH), fiber to the building (FTTB), fiber to the curb (FTTC), or fiber to the neighborhood (FTTN).
Martin Grötschel   +2 more
doaj   +1 more source

An improved cut-and-solve algorithm for the single-source capacitated facility location problem

open access: yesEURO Journal on Computational Optimization, 2018
In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases.
SuneLauth Gadegaard   +2 more
doaj   +1 more source

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers

open access: yesEURO Journal on Computational Optimization, 2019
In the two-dimensional guillotine cutting-stock problem, the objective is to minimize the number of large plates used to cut a list of small rectangles.
François Clautiaux   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy